{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:28Z","timestamp":1742617168988,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:53:25Z","timestamp":1330278805000},"page":"98-108","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic algorithms for the Dyck languages"],"prefix":"10.1007","author":[{"given":"Gudmund Skovbjerg","family":"Frandsen","sequence":"first","affiliation":[]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[]},{"given":"Theis","family":"Rauhe","sequence":"additional","affiliation":[]},{"given":"S\u00f8ren","family":"Skyum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","first-page":"39","volume-title":"volume 382 of Lecture Notes in Computer Science","author":"P. F. Dietz","year":"1989","unstructured":"Paul F. Dietz. Optimal algorithms for list indexing and subset rank. In F. Dehne, J.-R. Sack, and N. Santoro, editors, Proc. First Workshop on Algorithms and Data Structures (WADS), volume 382 of Lecture Notes in Computer Science, pages 39\u201346. Springer Verlag, Berlin, 1989."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, and Sven Skyum. Dynamic word problems. In Proc 34th Ann. Symp. on Foundations of Computer Science (FOCS), pages 470\u2013479, 1993.","DOI":"10.1109\/SFCS.1993.366840"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/322290.322305","volume":"29","author":"M. L. Fredman","year":"1982","unstructured":"Michael L. Fredman. The complexity of maintaining an array and computing its partial sums. Journal of the ACM, 29:250\u2013260, 1982.","journal-title":"Journal of the ACM"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Michael L. Fredman and Michael E. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st Ann. Symp. on Theory of Computing (STOC), pages 345\u2013354, 1989.","DOI":"10.1145\/73007.73040"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Leo J. Guibas and Robert Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th Ann. Symp. on Foundations of Computer Science (FOCS), pages 8\u201321. IEEE Computer Society, 1978.","DOI":"10.1109\/SFCS.1978.3"},{"key":"9_CR6","unstructured":"Michael A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, 1978."},{"issue":"2","key":"9_CR7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. M. Karp","year":"1987","unstructured":"Richard M. Karp and Michael O. Rabin. Efficient randomised pattern-matching algorithms. IBM J. Res. Develop., 31(2):249\u2013260, March 1987.","journal-title":"IBM J. Res. Develop."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/322017.322031","volume":"24","author":"R. J. Lipton","year":"1977","unstructured":"Richard J. Lipton and Yechezkel Zalcstein. Word problems solvable in logspace. Journal of the ACM, 24(3):522\u2013526, 1977.","journal-title":"Journal of the ACM"},{"key":"9_CR9","unstructured":"Wilhelm Magnus, Abraham Karrass, and Donald Solitar. Combinatorial Group Theory, volume 13 of Pure and Applied Mathematics. Interscience Publishers, 1966."},{"key":"9_CR10","unstructured":"K. Mehlhorn, R. Sundar, and C. Uhrig. Maintaining dynamic sequences under equality-tests in polylogarithmic time. In Proc. 5th Ann. Symp. on Discrete Algorithms (SODA), pages 213\u2013222. ACM-SIAM, 1994."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Peter Bro Miltersen. Lower bounds for union-split-find related problems on random access machines. In Proc. 26th Ann. Symp. on Theory of Computing (STOC), pages 625\u2013634. ACM, 1994.","DOI":"10.1145\/195058.195415"},{"key":"9_CR12","volume-title":"volume 156 of Lecture Notes in Computer Science","author":"M. H. Overmars","year":"1983","unstructured":"Mark H. Overmars. The design of dynamic data structures, volume 156 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1983."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Sushant Patnaik and Neil Immerman. Dyn-FO: A parallel, dynamic comlexity class. In Proc. 13th ACM Symp. on Principles of Database Systems (PODS), pages 210\u2013221, 1994.","DOI":"10.1145\/182591.182614"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0019-9958(72)90205-7","volume":"20","author":"R. W. Ritchie","year":"1972","unstructured":"R. W. Ritchie and F. N. Springsteel. Language recognition by marking automata. Information and Control, 20:313\u2013330, 1972.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:55:56Z","timestamp":1742597756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}