{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:25:48Z","timestamp":1765974348054,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_31","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"361-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Ehrhardt","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-16321-0_15","volume-title":"String Processing and Information Retrieval","author":"D Belazzougui","year":"2010","unstructured":"Belazzougui, D., Boldi, P., Vigna, S.: Dynamic Z-fast tries. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 159\u2013172. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-16321-0_15"},{"key":"31_CR2","unstructured":"Belazzougui, D., Boldi, P., Vigna, S.: Predecessor search with distance-sensitive query time (2012). arXiv:1209.5441"},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.comgeo.2012.01.002","volume":"46","author":"P Bose","year":"2013","unstructured":"Bose, P., Dou\u00efeb, K., Dujmovic, V., Howat, J., Morin, P.: Fast local searches and updates in bounded universes. Comput. Geom. Theory Appl. 46(2), 181\u2013189 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"key":"31_CR4","unstructured":"Chan, T.M.: Closest-point problems simplified on the RAM. In: Proc. 13th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 472\u2013473 (2002)"},{"key":"31_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 3rd edn. MIT Press (2009)"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/S0097539705447347","volume":"37","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., P\u01cetra\u015fcu, M.: Dynamic optimality \u2013 almost. SIAM J. Comput. 37(1), 240\u2013251 (2007)","journal-title":"SIAM J. Comput."},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11682462_34","volume-title":"LATIN 2006: Theoretical Informatics","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Heide, F.M., Pagh, R., P\u01cetra\u015fcu, M.: De dictionariis dynamicis pauco spatio utentibus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 349\u2013361. Springer, Heidelberg (2006). doi:10.1007\/11682462_34"},{"key":"31_CR8","unstructured":"Ehrhardt, M.: An In-Depth Analysis of Data Structures Derived from van-Emde-Boas-Trees. Master\u2019s thesis, Freie Universit\u00e4t Berlin (2015) http:\/\/www.mi.fu-berlin.de\/inf\/groups\/ag-ti\/theses\/download\/Ehrhardt15.pdf"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P van Emde Boas","year":"1976","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Math. Systems Theory 10(2), 99\u2013127 (1976)","journal-title":"Math. Systems Theory"},{"issue":"3","key":"31_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P van Emde Boas","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett. 6(3), 80\u201382 (1977)","journal-title":"Inform. Process. Lett."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Geometric approximation algorithms, Mathematical Surveys and Monographs, vol. 173. American Mathematical Society (2011)","DOI":"10.1090\/surv\/173"},{"key":"31_CR12","unstructured":"Knuth, D.E.: The art of computer programming. Sorting and searching, vol. 3, 2nd edn. Addison-Wesley (1998)"},{"issue":"2","key":"31_CR13","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0196-6774(88)90041-7","volume":"9","author":"MH Overmars","year":"1988","unstructured":"Overmars, M.H.: Efficient data structures for range searching on a grid. J. Algorithms 9(2), 254\u2013275 (1988)","journal-title":"J. Algorithms"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Shamos, M.I.: Computational geometry. An introduction. Springer Verlag (1985)","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"31_CR15","unstructured":"P\u01cetra\u015fcu, M.: vEB space: Method 4 (2010). http:\/\/infoweekly.blogspot.de\/2010\/09\/veb-space-method-4.html"},{"issue":"3","key":"31_CR16","doi-asserted-by":"crossref","first-page":"26:1","DOI":"10.1145\/1541885.1541887","volume":"5","author":"M Ru\u017ei\u0107","year":"2009","unstructured":"Ru\u017ei\u0107, M.: Making deterministic signatures quickly. ACM Transactions on Algorithms 5(3), 26:1\u201326:26 (2009)","journal-title":"ACM Transactions on Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:17:45Z","timestamp":1709828265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}