{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:49Z","timestamp":1725663649280},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_63","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:17:09Z","timestamp":1330237029000},"page":"640-649","source":"Crossref","is-referenced-by-count":1,"title":["A complexity theoretic approach to incremental computation"],"prefix":"10.1007","author":[{"given":"S.","family":"Sairam","sequence":"first","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"D. Barrington, \u201cBounded Width Polynomial Size Programs Recognize Exactly Those Languages in NC 1,\u201d Proc. 18th Symposium on Theory of Computing (1986), 1\u20135.","DOI":"10.1145\/12130.12131"},{"key":"63_CR2","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/BF00259471","volume":"27","author":"A. M. Berman","year":"1990","unstructured":"A. M. Berman, M. C. Paul, and B. G. Ryder, \u201cProving Relative Lower Bounds for Incremental Algorithms,\u201d Acta Informatica 27(1990), 665\u2013683.","journal-title":"Acta Informatica"},{"key":"63_CR3","unstructured":"A. Delcher and S. Kasif, \u201cComplexity Issues in Parallel Logic Programming,\u201d Johns Hopkins University, Ph.D Thesis, 1989."},{"key":"63_CR4","unstructured":"R. Greenlaw, H. J. Hoover, and W. L. Ruzzo, \u201cA Compendium of Problems Complete for P,\u201d Department of Computer Science and Engineering, University of Washington, Technical Report TR-91-05-01, 1991."},{"key":"63_CR5","doi-asserted-by":"crossref","unstructured":"L.J. Guibas and R. Sedgewick, \u201cA Dichromatic Framework for Balanced Trees,\u201d Proc. 19th IEEE Symposium on Foundations of Computer Science (1978), 8\u201321.","DOI":"10.1109\/SFCS.1978.3"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"R.M. Karp and V. Ramachandran, \u201cA Survey of Parallel Algorithms for Shared Memory Machines,\u201d in Handbook of Theoretical Computer Science, North Holland, 1990, 871\u2013941.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"63_CR7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","volume":"7","author":"R. E. Ladner","year":"1975","unstructured":"R. E. Ladner, \u201cThe Circuit Value Problem is Log Space Complete for P,\u201d SIGACT News 7(1975), 18\u201320.","journal-title":"SIGACT News"},{"key":"63_CR8","doi-asserted-by":"crossref","unstructured":"E. Mayr and A. Subramanian, \u201cThe Complexity of Circuit Value and Network Stability,\u201d Proc. 4th Annual Conference on Structure in Complexity Theory (1989), 114\u2013123.","DOI":"10.1109\/SCT.1989.41817"},{"key":"63_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(81)90010-7","volume":"12","author":"K. Mehlhorn","year":"1981","unstructured":"K. Mehlhorn and M. Overmars, \u201cOptimal Dynamization of Decomposable Searching Problems,\u201d Information Processing Letters 12(1981), 93\u201398.","journal-title":"Information Processing Letters"},{"key":"63_CR10","volume-title":"Technical Report ALCOM-91-63","author":"P. B. Miltersen","year":"1991","unstructured":"P. B. Miltersen, \u201cOn-line reevaluation of functions,\u201d Computer Science Dept, Aarhus University, Aarhus DK., Technical Report ALCOM-91-63, May 1991."},{"key":"63_CR11","volume-title":"Research Report","author":"S. Miyano","year":"1989","unstructured":"S. Miyano, S. Shiraishi, and T. Shoudai, \u201cA List of P-Complete Problems,\u201d Research Institute of Fundamental Information Science, Kyushu, Research Report, 1989."},{"key":"63_CR12","unstructured":"M. Overmars, \u201cThe Design of Dynamic Data Structures,\u201d Lecture Notes in Computer Science 156(1983)."},{"key":"63_CR13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90095-0","volume":"25","author":"J. H. Reif","year":"1987","unstructured":"J.H. Reif, \u201cA Topological Approach to Dynamic Graph Connectivity,\u201d Information Processing Letters 25 (1987), 65\u201370.","journal-title":"Information Processing Letters"},{"key":"63_CR14","doi-asserted-by":"crossref","unstructured":"S. Skyum and L. G. Valiant, \u201cA Complexity Theory Based on Boolean Algebra,\u201d Proc. 22nd IEEE Symposium on Foundations of Computer Science (1981), 244\u2013253.","DOI":"10.1109\/SFCS.1981.3"},{"key":"63_CR15","unstructured":"A. Subramanian, \u201cA New Approach to Stable Matching Problems,\u201d Department of Computer Science, Stanford University, Technical Report STAN-CS-89-1275, 1989."}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:31Z","timestamp":1605629071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}