{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:57Z","timestamp":1725544617960},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_5","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"80-91","source":"Crossref","is-referenced-by-count":1,"title":["Amortized Rigidness in Dynamic Cartesian Trees"],"prefix":"10.1007","author":[{"given":"Iwona","family":"Bialynicka-Birula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Comm. ACM\u00a023, 229\u2013239 (1980)","journal-title":"Comm. ACM"},{"doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC 1984, pp. 135\u2013143 (1984)","key":"5_CR2","DOI":"10.1145\/800057.808675"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R. Seidel","year":"1996","unstructured":"Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica\u00a016, 464\u2013497 (1996)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Latin American Theoretical Informatics 2000, pp. 88\u201394 (2000)","key":"5_CR4","DOI":"10.1007\/10719839_9"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/rsa.3240050205","volume":"5","author":"L. Devroye","year":"1994","unstructured":"Devroye, L.: On random Cartesian trees. Random Struct. Algorithms\u00a05, 305\u2013328 (1994)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Comput.\u00a014, 257\u2013276 (1985)","journal-title":"SIAM J. Comput."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1137\/S0097539700370539","volume":"34","author":"R. Cole","year":"2005","unstructured":"Cole, R., Hariharan, R.: Dynamic LCA queries on trees. SIAM J. Comput.\u00a034, 894\u2013923 (2005)","journal-title":"SIAM J. Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207168308803364","volume":"13","author":"H. Edelsbrunner","year":"1983","unstructured":"Edelsbrunner, H.: A new approach to rectangle intersections, part I. International Journal Computer Mathematics\u00a013, 209\u2013219 (1983)","journal-title":"International Journal Computer Mathematics"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1137\/S009753970240481X","volume":"32","author":"L. Arge","year":"2003","unstructured":"Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM J. Comput.\u00a032, 1488\u20131508 (2003)","journal-title":"SIAM J. Comput."},{"key":"5_CR10","first-page":"607","volume":"8","author":"G. Lagogiannis","year":"2003","unstructured":"Lagogiannis, G., Makris, C., Panagis, Y., Sioutas, S., Tsichlas, K.: New dynamic balanced search trees with worst-case constant update time. J. Autom. Lang. Comb.\u00a08, 607\u2013632 (2003)","journal-title":"J. Autom. Lang. Comb."}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T21:54:19Z","timestamp":1552514059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11672142_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}