{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:49Z","timestamp":1725664129766},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_243","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:23Z","timestamp":1330261763000},"page":"138-146","source":"Crossref","is-referenced-by-count":3,"title":["A simple balanced search tree with O(1) worst-case update time"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Fleischer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"A. Andersson, T.W. Lai: \u201dComparison-efficient and write-optimal searching and sorting\u201d Proc. 2nd ISA 1991, 273\u2013282","DOI":"10.1007\/3-540-54945-5_71"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"P.F. Dietz, R. Raman: \u201dA constant update time finger search tree\u201d Advances in Computing and Information \u2014 ICCI '90, Lecture Notes in Computer Science, Vol. 468, Springer 1990, 100\u2013109 Also as Univ. of Rochester CS Dept. TR 321, December 1989","DOI":"10.1007\/3-540-53504-7_66"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"P.F. Dietz, D.D. Sleator: \u201dTwo algorithms for maintaining order in a list\u201d Proc. 19th ACM STOC 1987, 365\u2013372","DOI":"10.1145\/28395.28434"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"J.R. Driscoll, N. Sarnak, D.D. Sleator, R.E. Tarjan: \u201dMaking data structures persistent\u201d Journal of Computer and System Sciences 38 (1989), 86\u2013124","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"L. Guibas, E. McCreight, M. Plass, J. Roberts: \u201dA new representation for linear lists\u201d Proc. 9th ACM STOC 1977, 49\u201360","DOI":"10.1145\/800105.803395"},{"key":"15_CR6","volume-title":"Technical Report 154","author":"D. Harel","year":"1980","unstructured":"D. Harel: \u201cFast updates with a guaranteed time bound per update\u201d Technical Report 154, Dept. of ICS, University of California at Irvine, 1980"},{"key":"15_CR7","volume-title":"Technical Report 145","author":"D. Harel","year":"1979","unstructured":"D. Harel, G. Lueker: \u201cA data structure with movable fingers and deletions\u201d Technical Report 145, Dept. of ICS, University of Califonia at Irvine, 1979"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"S. Huddleston, K. Mehlhorn: \u201dA new data structure for representing sorted lists\u201d Acta Informatica 17 (1982), 157\u2013184","journal-title":"Acta Informatica"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF00299635","volume":"26","author":"C. Levcopoulos","year":"1988","unstructured":"C. Levcopoulos, M.H. Overmars: \u201dA balanced search tree with O(1) worst-case update time\u201d Acta Informatica 26 (1988), 269\u2013277","journal-title":"Acta Informatica"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"K. Mulmuley: \u201dRandomized multidimensional search trees: Dynamic sampling\u201d Proc. 7th Symposium on Computational Geometry 1991, 121\u2013131","DOI":"10.1145\/109648.109662"},{"key":"15_CR11","first-page":"27","volume":"18","author":"M.H. Overmars","year":"1982","unstructured":"M.H. Overmars: \u201dA O(1) average time update scheme for balanced search trees\u201d Bull. EATCS 18 (1982), 27\u201329","journal-title":"Bull. EATCS"},{"key":"15_CR12","unstructured":"M.H. Overmars: \u201dThe design of dynamic data structures\u201d Lecture Notes in Computer Science, Vol. 156, Springer 1983"},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(81)90093-4","volume":"12","author":"M.H. Overmars","year":"1981","unstructured":"M.H. Overmars, J. van Leeuwen: \u201dWorst-case optimal insertion and deletion methods for decomposable searching methods\u201d Information Processing Letters 12 (1981), 168\u2013173","journal-title":"Information Processing Letters"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(83)90099-6","volume":"16","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan: \u201dUpdating a balanced search tree in O(1) rotations\u201d Information Processing Letters 16 (1983), 253\u2013257","journal-title":"Information Processing Letters"},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0019-9958(85)80034-6","volume":"67","author":"A.K. Tsakalidis","year":"1985","unstructured":"A.K. Tsakalidis: \u201dAVL-trees for localized search\u201d Information and Control 67 (1985), 173\u2013194","journal-title":"Information and Control"},{"key":"15_CR16","unstructured":"J. van der Erf: \u201dEen datastructuur met zoektijd O(log n) en constante update-tijd (in Dutch)\u201d Technical Report RUU-CS-87-19, Dept. of Computer Science, University of Utrecht 1987"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_243.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:08Z","timestamp":1605647588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_243","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}