{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:09:31Z","timestamp":1725566971678},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_3","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T10:43:16Z","timestamp":1133779396000},"page":"48-59","source":"Crossref","is-referenced-by-count":0,"title":["Developments in Data Structure Research During the First 25 Years of FSTTCS"],"prefix":"10.1007","author":[{"given":"Raimund","family":"Seidel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Mehta, Sahni (eds.): Handbook of Data Structures and Applications. Chapman & Hall\/CRC (2005)","DOI":"10.1201\/9781420035179"},{"key":"3_CR2","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. J. ACM\u00a032, 652\u2013686 (1985)","journal-title":"J. ACM"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\u00a034, 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods\u00a06, 306\u2013318 (1985)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., Saxe, J.B.: Decomposable searching problems i: Static-to-dynamic transformation. J. Algorithms\u00a01, 301\u2013358 (1980)","journal-title":"J. Algorithms"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"The Design of Dynamic Data Structures","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The design of dynamic data structure. In: Overmars, M. (ed.) The Design of Dynamic Data Structures. LNCS, vol.\u00a0156, Springer, Heidelberg (1983)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G.: Efficient computation of continuous skeletons. In: FOCS, pp. 18\u201327 (1979)","DOI":"10.1109\/SFCS.1979.15"},{"key":"3_CR8","first-page":"133","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: I. a data structuring technique. Algorithmica\u00a01, 133\u2013162 (1986)","journal-title":"a data structuring technique. Algorithmica"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01840441","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: Ii. applications. Algorithmica\u00a01, 163\u2013191 (1986)","journal-title":"applications. Algorithmica"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0196-6774(86)90004-0","volume":"7","author":"R. Cole","year":"1986","unstructured":"Cole, R.: Searching and storing similar lists. J. Algorithms\u00a07, 202\u2013220 (1986)","journal-title":"J. Algorithms"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jagm.1995.1032","volume":"19","author":"S. Sen","year":"1995","unstructured":"Sen, S.: Fractional cascading revisited. J. Algorithms\u00a019, 161\u2013172 (1995)","journal-title":"J. Algorithms"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K. Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S.: Dynamic fractional cascading. Algorithmica\u00a05, 215\u2013241 (1990)","journal-title":"Algorithmica"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci.\u00a038, 86\u2013124 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR14","unstructured":"Sarnak, N.: Persistend Data Structures. Ph.D thesis, New York University (1986)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Commun. ACM\u00a029, 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"key":"3_CR16","volume-title":"Computational Geometry: An Introduction through Randomized Algorithms","author":"K. Mulmuley","year":"1993","unstructured":"Mulmuley, K.: Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Commun. ACM\u00a033, 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R. Seidel","year":"1996","unstructured":"Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica\u00a016, 464\u2013497 (1996)","journal-title":"Algorithmica"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T., Sun, J.Z.: The skip quadtree: a simple dynamic data structure for multidimensional data. In: Symposium on Computational Geometry, pp. 296\u2013305 (2005)","DOI":"10.1145\/1064092.1064138"},{"key":"3_CR20","first-page":"143","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. JCSS\u00a018, 143\u2013154 (1979)","journal-title":"JCSS"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with 0(1) worst case access time. J. ACM\u00a031, 538\u2013544 (1984)","journal-title":"J. ACM"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M. Dietzfelbinger","year":"1994","unstructured":"Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., auf der Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput.\u00a023, 738\u2013761 (1994)","journal-title":"SIAM J. Comput."},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R. Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms\u00a051, 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci.\u00a048, 533\u2013551 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett.\u00a06, 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Andersson, A.: Searchin dn priority queues in o(log n) time. In: Mehta, Sahni (eds.) Handbook of Data Structures and Applications, Chapman & Hall\/CRC (2005)","DOI":"10.1201\/9781420035179.ch39"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"Mehlhorn, K., N\u00e4her, S.: Leda: A platform for combinatorial and geometric computing. Commun. ACM\u00a038, 96\u2013102 (1995)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:09:24Z","timestamp":1683299364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11590156_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}