{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:12:46Z","timestamp":1759335166861},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90159-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"203-236","source":"Crossref","is-referenced-by-count":64,"title":["Complexity models for incremental computation"],"prefix":"10.1016","volume":"130","author":[{"given":"Peter Bro","family":"Miltersen","sequence":"first","affiliation":[]},{"given":"Sairam","family":"Subramanian","sequence":"additional","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90159-7_BIB1","first-page":"1","article-title":"Bounded width polynomial size programs recognize exactly those languages in NC1","author":"Barrington","year":"1986","journal-title":"Proc. 18th Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90159-7_BIB2","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/BF00259471","article-title":"Proving relative lower bounds for incremental algorithms","volume":"27","author":"Berman","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90159-7_BIB3","first-page":"757","article-title":"The complexity of finite functions","volume":"A","author":"Boppana","year":"1990","journal-title":"Handbook of Theoretical Science"},{"key":"10.1016\/0304-3975(94)90159-7_BIB4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","article-title":"Problems complete for deterministic logarithmic space","volume":"8","author":"Cook","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)90159-7_BIB5","series-title":"Ph.D. Thesis","article-title":"Complexity issues in parallel logic programming","author":"Delcher","year":"1989"},{"key":"10.1016\/0304-3975(94)90159-7_BIB6","first-page":"371","article-title":"Updating distances in dynamic graphs","volume":"49","author":"Even","year":"1985","journal-title":"Methods Oper. Res."},{"key":"10.1016\/0304-3975(94)90159-7_BIB7","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0207012","article-title":"Observations on the complexity of generating quasi-gray codes","volume":"7","author":"Fredman","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90159-7_BIB8","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/322290.322305","article-title":"The complexity of maintaining an array and computing its partial sums","volume":"29","author":"Fredman","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)90159-7_BIB9","first-page":"345","article-title":"The cell probe complexity of dynamic data structures","author":"Fredman","year":"1989","journal-title":"Proc. 21st ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90159-7_BIB10","series-title":"Tech. Report TR-91-05-01","article-title":"A compendium of problems complete for P","author":"Greenlaw","year":"1991"},{"key":"10.1016\/0304-3975(94)90159-7_BIB11","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978","journal-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90159-7_BIB12","series-title":"Tech. Report No YALEEU\/DCS\/TR 552","article-title":"Nondeterministic Logspace is closed under complement","author":"Immerman","year":"1987"},{"key":"10.1016\/0304-3975(94)90159-7_BIB13","first-page":"871","article-title":"A survey of parallel algorithms for shared memory machines","author":"Karp","year":"1992"},{"key":"10.1016\/0304-3975(94)90159-7_BIB14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is Log space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0304-3975(94)90159-7_BIB15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/SCT.1989.41817","article-title":"The complexity of circuit value and network stability","author":"Mayr","year":"1989","journal-title":"Proc. 4th Ann. Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(94)90159-7_BIB16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(81)90010-7","article-title":"Optimal dynamization of decomposable searching problems","volume":"12","author":"Mehlhorn","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90159-7_BIB17","series-title":"Tech. Report ALCOM-91-63","article-title":"On-line reevaluation of functions","author":"Miltersen","year":"1991"},{"key":"10.1016\/0304-3975(94)90159-7_BIB18","series-title":"Research Report","article-title":"A list of P-complete problems","author":"Miyano","year":"1989"},{"key":"10.1016\/0304-3975(94)90159-7_BIB19","volume":"Vol. 156","author":"Overmars","year":"1983"},{"key":"10.1016\/0304-3975(94)90159-7_BIB20","series-title":"Tech. Report DCS-TR-139","article-title":"Exploring the structure of incremental algorithms","author":"Paull","year":"1984"},{"key":"10.1016\/0304-3975(94)90159-7_BIB21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90095-0","article-title":"A topological approach to dynamic graph connectivity","volume":"25","author":"Reif","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90159-7_BIB22","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/SFCS.1981.3","article-title":"A complexity theory based on boolean algebra","author":"Skyum","year":"1981","journal-title":"Proc. 22nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90159-7_BIB23","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","article-title":"A data structure for dynamic trees","volume":"24","author":"Sleator","year":"1983","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(94)90159-7_BIB24","series-title":"Tech. Report STAN-CS-89-1275","article-title":"A new approach to stable matching problems","author":"Subramanian","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901597?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901597?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:16:53Z","timestamp":1580901413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594901597"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90159-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}