{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T18:10:05Z","timestamp":1745431805024,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_55","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"527-536","source":"Crossref","is-referenced-by-count":1,"title":["Finger Search in the Implicit Model"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper Sindahl","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Truelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-16761-7_54","volume-title":"Automata, Languages and Programming","author":"A. Borodin","year":"1986","unstructured":"Borodin, A., Fich, F.E., Meyer auf der Heide, F., Upfal, E., Wigderson, A.: A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. In: Kott, L. (ed.) ICALP 1986. LNCS, vol.\u00a0226, pp. 50\u201359. Springer, Heidelberg (1986)"},{"key":"55_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-17514-5_4","volume-title":"Algorithms and Computation","author":"G.S. Brodal","year":"2010","unstructured":"Brodal, G.S., Kejlberg-Rasmussen, C., Truelsen, J.: A Cache-Oblivious Implicit Dictionary with the Working Set Property. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol.\u00a06507, pp. 37\u201348. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Brodal, G.S.: Finger search trees. In: Mehta, D., Sahni, S. (eds.) Handbook of Data Structures and Applications, ch. 11. CRC Press (2005)","key":"55_CR3","DOI":"10.1201\/9781420035179.ch11"},{"key":"55_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-45078-8_11","volume-title":"Algorithms and Data Structures","author":"G. Franceschini","year":"2003","unstructured":"Franceschini, G., Grossi, R.: Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 114\u2013126. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Franceschini, G., Grossi, R., Munro, J.I., Pagli, L.: Implicit B-Trees: New results for the dictionary problem. In: Proc. 43rd FOCS, pp. 145\u2013154. IEEE (2002)","key":"55_CR5","DOI":"10.1109\/SFCS.2002.1181891"},{"issue":"1","key":"55_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/322358.322364","volume":"30","author":"G.N. Frederickson","year":"1983","unstructured":"Frederickson, G.N.: Implicit data structures for the dictionary problem. JACM\u00a030(1), 80\u201394 (1983)","journal-title":"JACM"},{"issue":"1","key":"55_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J.I. Munro","year":"1986","unstructured":"Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in $\\mathcal{O}(\\log^2 n)$ time. JCSS\u00a033(1), 66\u201374 (1986)","journal-title":"JCSS"},{"issue":"2","key":"55_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J.I. Munro","year":"1980","unstructured":"Munro, J.I., Suwanda, H.: Implicit data structures for fast search and update. JCSS\u00a021(2), 236\u2013250 (1980)","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T17:55:06Z","timestamp":1745430906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}