{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:22Z","timestamp":1725565882508},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_52","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"606-617","source":"Crossref","is-referenced-by-count":12,"title":["A General Technique for Managing Strings in Comparison-Driven Data Structures"],"prefix":"10.1007","author":[{"given":"Gianni","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45022-X_8","volume-title":"Automata, Languages and Programming","author":"S. Alstrup","year":"2000","unstructured":"Alstrup, S., Holm, J.: Improved algorithms for finding level ancestors in dynamic trees. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 73\u201384. Springer, Heidelberg (2000)"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1137\/S009753970240481X","volume":"32","author":"L. Arge","year":"2003","unstructured":"Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM Journal on Computing\u00a032, 1488\u20131508 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45749-6_17","volume-title":"Algorithms - ESA 2002","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Demaine, E.M., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, p. 152. Springer, Heidelberg (2002)"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. LATIN, 88\u201394 (2000)","DOI":"10.1007\/10719839_9"},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"S.W. Bent","year":"1985","unstructured":"Bent, S.W., Sleator, D.D., Tarjan, R.E.: Biased search trees. SIAM Journal on Computing\u00a014, 545\u2013568 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR6","unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: SODA, pp. 360\u2013369 (1997)"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/363958.363987","volume":"7","author":"H.A. Clampett","year":"1964","unstructured":"Clampett, H.A.: Randomized binary searching with the tree structures. Communications of the ACM\u00a07, 163\u2013165 (1964)","journal-title":"Communications of the ACM"},{"key":"52_CR8","unstructured":"Cole, R., Hariharan, R.: Dynamic LCA queries on trees. In: SODA, pp. 235\u2013244 (1999)"},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44867-5_7","volume-title":"Experimental and Efficient Algorithms","author":"P. Crescenzi","year":"2003","unstructured":"Crescenzi, P., Grossi, R., Italiano, G.F.: Search data structures for skewed strings. In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol.\u00a02647, Springer, Heidelberg (2003)"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: STOC, pp. 365\u2013372 (1987)","DOI":"10.1145\/28395.28434"},{"key":"52_CR11","unstructured":"Gonzalez, T.F.: The on-line d-dimensional dictionary problem. In: SODA, pp. 376\u2013385 (1992)"},{"key":"52_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-48523-6_34","volume-title":"Automata, Languages and Programming","author":"R. Grossi","year":"1999","unstructured":"Grossi, R., Italiano, G.F.: Efficient techniques for maintaining multidimensional keys in linked data structures. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, p. 372. Springer, Heidelberg (1999) (extended abstract)"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Gueting, R.H., Kriegel, H.-P.: Multidimensional B-tree: An efficient dynamic file structure for exact match queries. In: 10th GI Annual Conference, pp. 375\u2013388 (1980)","DOI":"10.1007\/978-3-642-67838-7_35"},{"key":"52_CR14","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing\u00a013, 338\u2013355 (1984)","journal-title":"SIAM Journal of Computing"},{"key":"52_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"Huddleston, S., Mehlhorn, K.: A new data structure for representing sorted lists. Acta Informatica\u00a017, 157\u2013184 (1982)","journal-title":"Acta Informatica"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Irving, R.W., Love, L.: The suffix binary search tree and suffix AVL tree. Journal of Discrete Algorithms 387\u2013408 (2003)","DOI":"10.1016\/S1570-8667(03)00034-0"},{"key":"52_CR17","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing\u00a022, 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/0208014","volume":"8","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K.: Dynamic binary search. SIAM J. on Computing\u00a08, 175\u2013198 (1979)","journal-title":"SIAM J. on Computing"},{"key":"52_CR19","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Data structures and algorithms: 1. Searching and sorting (1984)","DOI":"10.1007\/978-3-642-69672-5"},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. SIAM Journal on Computing\u00a02, 33\u201343 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.2001.1160","volume":"40","author":"S. Roura","year":"2001","unstructured":"Roura, S.: Digital access to comparison-based tree data structures and algorithms. Journal of Algorithms\u00a040, 1\u201323 (2001)","journal-title":"Journal of Algorithms"},{"key":"52_CR22","doi-asserted-by":"crossref","unstructured":"Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica, 464\u2013497 (1996)","DOI":"10.1007\/BF01940876"},{"key":"52_CR23","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM\u00a032, 652\u2013686 (1985)","journal-title":"Journal of the ACM"},{"key":"52_CR24","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data structures and network algorithms. SIAM, Philadelphia (1983)"},{"key":"52_CR25","first-page":"328","volume":"52","author":"V.K. Vaishnavi","year":"1996","unstructured":"Vaishnavi, V.K.: On k-dimensional balanced binary trees. JCSS\u00a052, 328\u2013348 (1996)","journal-title":"JCSS"},{"key":"52_CR26","doi-asserted-by":"crossref","unstructured":"Willard, D.E.: A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Informat. and Comput (1992)","DOI":"10.1016\/0890-5401(92)90034-D"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:23:59Z","timestamp":1605741839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}