{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:32Z","timestamp":1725550472673},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_13","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:06:19Z","timestamp":1130148379000},"page":"134-144","source":"Crossref","is-referenced-by-count":0,"title":["One-Dimensional Finger Searching in RAM Model Revisited"],"prefix":"10.1007","author":[{"given":"S.","family":"Sioutas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Panagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","first-page":"381","volume":"67","author":"G.S. Brodal","year":"2003","unstructured":"Brodal, G.S., Lagogiannis, G., Makris, C., Tsakalidis, A.K., Tsichlas, K.: Optimal finger search trees in the pointer machine. JCSS\u00a067(2), 381\u2013418 (2003)","journal-title":"JCSS"},{"unstructured":"Raman, R.: Eliminating Amortization: On Data Structures with Guaranteed Response Time. PhD Thesis, University of Rochester, New York, Computer Science Dept. U. Rochester, Tech\u00acnical Report TR-439 (1992)","key":"13_CR2"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(81)90093-4","volume":"12","author":"M. Overmars","year":"1981","unstructured":"Overmars, M., Leeuwen, J.v.: Worst case optimal insertion and deletion methods for decom\u00acposable searching problems. Information Processing Letters\u00a012, 168\u2013173 (1981)","journal-title":"Information Processing Letters"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(84)80015-7","volume":"63","author":"M. Ajtai","year":"1984","unstructured":"Ajtai, M., Fredman, M., Komlos, J.: Hash functions for priority queues. Information and Con\u00actrol\u00a063, 217\u2013225 (1984)","journal-title":"Information and Con\u00actrol"},{"key":"13_CR5","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"doi-asserted-by":"crossref","unstructured":"Ranjan, D., Pontelli, E., Gupta, G., Longpre, L.: The Temporal Precedence Problem. In: Algorith\u00acmica (1999) (to appear)","key":"13_CR6","DOI":"10.1007\/s004530010036"},{"doi-asserted-by":"crossref","unstructured":"Beame, P., Fich, F.: Optimal Bounds for the Predecessor Problem. In: Proceedings of the Thirty First Annual ACM Symposium on Theory of Computing, Atlanta, GA (May 1999)","key":"13_CR7","DOI":"10.1145\/301250.301323"},{"key":"13_CR8","first-page":"27","volume":"18","author":"M. Overmars","year":"1982","unstructured":"Overmars, M.: A O(1) average time update scheme for balanced binary search trees. Bulletin of the EATCS\u00a018, 27\u201329 (1982)","journal-title":"Bulletin of the EATCS"},{"doi-asserted-by":"crossref","unstructured":"Tsakalidis, A.: Maintaining order in a generalized linked list. ACTA Informatica\u00a021 (1984)","key":"13_CR9","DOI":"10.1007\/BF00289142"},{"unstructured":"Anderson, A.: Faster deterministic sorting and searching in linear space. In: 37th Annual IEEE Symposium on Foundations of Computer Science (1996)","key":"13_CR10"},{"unstructured":"Anderson, A., Thorup, M.: Exponential search trees for faster deterministic searching, sorting and priority queues in linear space (Manuscript)","key":"13_CR11"},{"doi-asserted-by":"crossref","unstructured":"Anderson, A., Thorup, M.: Tight(er) Worst \u2013 Case Bounds on Dynamic Searching and Prior\u00acity Queues. In: ACM STOC 2000 (2000)","key":"13_CR12","DOI":"10.1145\/335305.335344"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D.E. Willard","year":"1983","unstructured":"Willard, D.E.: Log_logarithmic worst-case range queries are possible in space \u0398(n). Information Processing Letters\u00a017, 81\u201384 (1983)","journal-title":"Information Processing Letters"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M.L. Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. Comput. Syst. Sci\u00a047, 424\u2013436 (1993); Announced at STOC (1990)","journal-title":"Comput. Syst. Sci"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:46:23Z","timestamp":1558287983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11573036_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}