{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:57:36Z","timestamp":1648817856249},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"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":[[2005,10]]},"DOI":"10.1007\/s00236-005-0173-3","type":"journal-article","created":{"date-parts":[[2005,10,14]],"date-time":"2005-10-14T00:07:46Z","timestamp":1129248466000},"page":"57-78","source":"Crossref","is-referenced-by-count":0,"title":["Exponentially decreasing number of operations in balanced trees"],"prefix":"10.1007","volume":"42","author":[{"given":"Lars","family":"Jacobsen","sequence":"first","affiliation":[]},{"given":"Kim Skak","family":"Larsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,14]]},"reference":[{"key":"173_CR1","unstructured":"Adel'son-Vel'skii, G.M., Landis, E.M.: An algorithm for the organisation of information. Doklady Akadamii Nauk SSSR. 146, 263\u2013266 (1962) In Russian. English translation in Soviet Math. Doklady, 3, 1259-1263 (1962)"},{"key":"173_CR2","doi-asserted-by":"crossref","unstructured":"Andersson, A., Fagerberg, R., Larsen, K.S.: Balanced binary search trees. In: Dinesh P. Mehta, Sartaj Sahni (eds.), Handbook of Data Structures and Applications, Chapman & Hall\/CRC Computer & Information Science Series, pp. 10\u20131\u201310\u201328. CRC Press (2005)","DOI":"10.1201\/9781420035179.ch10"},{"key":"173_CR3","unstructured":"Dietz, P.F., Raman, R.: Persistence, amortization and randomization. In: Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp 78\u201388, (1991)"},{"key":"173_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences 38, 86\u2013124 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"173_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"Huddleston, S., Mehlhorn, K.: A new data structure for representing sorted lists. Acta Informatica 17, 157\u2013184 (1982)","journal-title":"Acta Informatica"},{"key":"173_CR6","unstructured":"Jacobsen, L.: Search trees with local rules. PhD thesis, Department of Mathematics and Computer Science, University of Southern Denmark (2001)"},{"key":"173_CR7","doi-asserted-by":"crossref","unstructured":"Jacobsen, L., Larsen, K.S., Nielsen, M.N.: On the existence and construction of non-extreme $$(a,b)$$ -trees. Information Processing Letters, 84(2), 69\u201373 (2002)","DOI":"10.1016\/S0020-0190(02)00228-4"},{"issue":"4","key":"173_CR8","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/S0022-0000(03)00027-8","volume":"66","author":"K.S. Larsen","year":"2003","unstructured":"Larsen, K.S.: Relaxed multi-way trees with group updates. Journal of Computer and System Sciences, 66(4), 657\u2013670 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"173_CR9","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Sorting and Searching, vol. 1 of Data Structures and Algorithms. Springer-Verlag (1984)","DOI":"10.1007\/978-3-642-69672-5_2"},{"issue":"1","key":"173_CR10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0215002","volume":"15","author":"K. Mehlhorn","year":"1986","unstructured":"Mehlhorn, K. Tsakalidis, A.: An amortized analysis of insertions into AVL-trees. SIAM Journal on Computing 15(1), 22\u201333 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"173_CR11","unstructured":"Overmars, M. H.: Searching in the past ii: general transforms. Technical Report RUU-CS-81-9. Department of Computer Science, University of Utrecht, The Netherlands (1981)"},{"key":"173_CR12","unstructured":"Raman, R.: Eliminating amortization: on data structures with guaranteed response time. PhD thesis, Department of Computer Science, University of Rochester, Rochester, New York (1992)"},{"key":"173_CR13","unstructured":"Sarnak, N.: Persistent data structures. PhD thesis, Department of Computer Science, New York University, New York (1986)"},{"issue":"4","key":"173_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1051\/ita\/1985190403231","volume":"19","author":"A. K. Tsakalidis","year":"1985","unstructured":"Tsakalidis, A. K.: Rebalancing operations for deletions in avl-trees. R.A.I.R.O. Informatique Th\u00e9orique 19(4), 323\u2013329 (1985)","journal-title":"R.A.I.R.O. Informatique Th\u00e9orique"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0173-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0173-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0173-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T08:28:24Z","timestamp":1586507304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0173-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["173"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0173-3","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}