{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:31Z","timestamp":1761611071462},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0020-0190(94)00115-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"147-154","source":"Crossref","is-referenced-by-count":17,"title":["A constant update time finger search tree"],"prefix":"10.1016","volume":"52","author":[{"given":"Paul F","family":"Dietz","sequence":"first","affiliation":[]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00115-4_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(94)00115-4_BIB2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(84)80015-7","article-title":"Hash functions for priority queues","volume":"63","author":"Ajtai","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(94)00115-4_BIB3","first-page":"540","article-title":"Randomized search trees","author":"Aragon","year":"1989","journal-title":"Proc. 30th IEEE Conf. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)00115-4_BIB4","first-page":"1209","article-title":"On the economical construction of the transitive closure of a directed graph","volume":"11","author":"Arlazarov","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0020-0190(94)00115-4_BIB5","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","article-title":"Design and analysis of a data structure for representing sorted lists","volume":"9","author":"Brown","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00115-4_BIB6","first-page":"77","article-title":"Persistence, amortization and randomization","author":"Dietz","year":"1991","journal-title":"Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0020-0190(94)00115-4_BIB7","first-page":"365","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987","journal-title":"Proc. 19th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)00115-4_BIB8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00115-4_BIB9","article-title":"A simple balanced search tree with O(1) worst-case update time","author":"Fleischer","year":"1992"},{"key":"10.1016\/0020-0190(94)00115-4_BIB10","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","article-title":"Surpassing the information theoretic bound with fusion trees","volume":"47","author":"Fredman","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00115-4_BIB11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00115-4_BIB12","first-page":"49","article-title":"A new representation for sorted lists","author":"Guibas","year":"1977","journal-title":"Proc. 9th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)00115-4_BIB13","article-title":"Fast updates of balanced search trees with a guaranteed time bound per update","author":"Harel","year":"1980"},{"key":"10.1016\/0020-0190(94)00115-4_BIB14","article-title":"A data structure with movable fingers and deletions","author":"Harel","year":"1979"},{"key":"10.1016\/0020-0190(94)00115-4_BIB15","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00115-4_BIB16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","article-title":"A new data structure for representing sorted lists","volume":"17","author":"Huddleston","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(94)00115-4_BIB17","first-page":"62","article-title":"Localized search in sorted lists","author":"Kosaraju","year":"1981","journal-title":"Proc. 13th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)00115-4_BIB18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00299635","article-title":"A balanced search tree with O(1) worst-case update time","volume":"26","author":"Levcopolous","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(94)00115-4_BIB19","first-page":"27","article-title":"An O(1) average time update scheme for balanced binary search trees","volume":"18","author":"Overmars","year":"1982","journal-title":"Bull. EATCS"},{"key":"10.1016\/0020-0190(94)00115-4_BIB20","volume":"156","author":"Overmars","year":"1983"},{"key":"10.1016\/0020-0190(94)00115-4_BIB21","article-title":"Eliminating amortization: On data structures with guaranteed response time (Ph.D. Thesis)","author":"Raman","year":"1992"},{"key":"10.1016\/0020-0190(94)00115-4_BIB22","author":"Tarjan","year":"1983"},{"key":"10.1016\/0020-0190(94)00115-4_BIB23","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0019-9958(85)80034-6","article-title":"AVL-trees for localized search","volume":"67","author":"Tsakalidis","year":"1985","journal-title":"Inform. and Control."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:52:18Z","timestamp":1555131138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0020019094001154"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00115-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}