{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:54:38Z","timestamp":1778025278769,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1982,6]]},"DOI":"10.1007\/bf00288968","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T13:45:25Z","timestamp":1096897525000},"page":"157-184","source":"Crossref","is-referenced-by-count":133,"title":["A new data structure for representing sorted lists"],"prefix":"10.1007","volume":"17","author":[{"given":"Scott","family":"Huddleston","sequence":"first","affiliation":[]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric Binary B-trees: Data structures and maintenance algorithms. Acta Informat. 1, 290?306 (1972)","journal-title":"Acta Informat."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indizes. Acta Informat. 1, 173?189 (1972)","journal-title":"Acta Informat."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"Bayer, R., Schkolnik, M.: Concurrency of operations on B-trees. Acta Informat. 9, 1?21 (1977)","journal-title":"Acta Informat."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(80)90018-3","volume":"11","author":"N. Blum","year":"1980","unstructured":"Blum, N., Mehlhorn, K.: On the average number of rebalancing steps in weight-balanced trees. Theor. Comput. Sci. 11, 303?320 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","volume":"9","author":"M.R. Brown","year":"1980","unstructured":"Brown, M.R., Tarjan, R.E.: Design and analysis of a data structure for representing sorted lists. SIAM J. Comput. 9, 594?614 (1980)","journal-title":"SIAM J. Comput."},{"key":"CR6","first-page":"8","volume-title":"Proc. 19th Annual Symposium on Foundations of Computer Science","author":"L.J. Guibas","year":"1978","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. Proc. 19th Annual Symposium on Foundations of Computer Science. Ann Arbor: IEEE Computer Socienty, pp. 8?21 (1978)"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Guibas, L., McCreight, E., Plass, M, Roberts, J.: A new representation for linear lists. 9th ACM Symposium on Theory of Computing Boulder, pp. 49?60 (1977)","DOI":"10.1145\/800105.803395"},{"key":"CR8","volume-title":"PhD Dissertation","author":"S. Huddleston","year":"1981","unstructured":"Huddleston, S.: Robust balancing in B-trees. PhD Dissertation, Computer Science Department, University of Washington, Seattle, 1981"},{"key":"CR9","first-page":"234","volume":"104","author":"S. Huddleston","year":"1981","unstructured":"Huddleston, S., Mehlhorn, K.: Robust balancing in B-trees. 5th GI-Conference on Theoretical Informatics 1981, Karlsruhe, LNCS 104, 234?244 (1981)","journal-title":"5th GI-Conference on Theoretical Informatics 1981, Karlsruhe, LNCS"},{"key":"CR10","series-title":"Technical Report 79\/007","volume-title":"Hysterical B-trees","author":"D. Maier","year":"1979","unstructured":"Maier, D., Salveter, S.C.: Hysterical B-trees. Technical Report 79\/007, Dept. of Computer Science, State University of New York at Stony Brook, November 1979"},{"key":"CR11","unstructured":"Mehlhorn, K.: Effiziente Algorithmen. Teubner-Verlag, Studienb\u00fccher Informatik 1977"},{"key":"CR12","series-title":"Lecture Notes in Computer Science Vol. 67","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-09118-1_22","volume-title":"4th GI-Conference on Theoretical Computer Science 1979, Aachen","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K.: Sorting presorted files. 4th GI-Conference on Theoretical Computer Science 1979, Aachen, Lecture Notes in Computer Science Vol. 67, pp. 199?212. Berlin-Heidelberg-New York: Springer 1979"},{"key":"CR13","first-page":"131","volume-title":"Lecture Notes in Computer Science Vol. 74","author":"K. Mehlhorn","year":"1981","unstructured":"Mehlhorn, K.: Searching, sorting and information theory. MFCS 79, Lecture Notes in Computer Science Vol. 74, pp. 131?145. Berlin-Heidelberg-New York: Springer 1981"},{"key":"CR14","unstructured":"Willard, D.E.: The super-B-tree algorithm. Harvard Aiken Computation Laboratory Report TR-03-79"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288968.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288968\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:34Z","timestamp":1554743674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["BF00288968"],"URL":"https:\/\/doi.org\/10.1007\/bf00288968","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}