{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:50Z","timestamp":1725559130127},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_37","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"415-426","source":"Crossref","is-referenced-by-count":0,"title":["Randomized Insertion and Deletion in Point Quad Trees"],"prefix":"10.1007","author":[{"given":"Amalia","family":"Duch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF00265991","volume":"24","author":"L. Devroye","year":"1987","unstructured":"Devroye, L.: Branching processes in the analysis of the height of trees. Acta Informatica\u00a024, 277\u2013298 (1987)","journal-title":"Acta Informatica"},{"issue":"5","key":"37_CR2","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1137\/0219057","volume":"19","author":"L. Devroye","year":"1990","unstructured":"Devroye, L., Laforest, L.: An Analysis of Random d-Dimensional Quadtrees. SIAM Journal of Computing\u00a019(5), 821\u2013832 (1990)","journal-title":"SIAM Journal of Computing"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-49381-6_22","volume-title":"Algorithms and Computation","author":"A. Duch","year":"1998","unstructured":"Duch, A., Estivill-Castro, V., Mart\u00ednez, C.: Randomized K-dimensional binary search trees. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol.\u00a01533, pp. 199\u2013208. Springer, Heidelberg (1998)"},{"issue":"9","key":"37_CR4","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1145\/358172.358183","volume":"26","author":"J.L. Eppinger","year":"1983","unstructured":"Eppinger, J.L.: An empirical study of insertion and deletion in binary search trees. Communications of the ACM\u00a026(9), 663\u2013669 (1983)","journal-title":"Communications of the ACM"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R.A. Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quadtrees, a Data Structure for Retrieval on Composite Keys. Acta Informatica\u00a04, 1\u20139 (1974)","journal-title":"Acta Informatica"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01891833","volume":"10","author":"P.. Flajolet","year":"1993","unstructured":"Flajolet, P., Gonnet, G., Puech, C., Robson, J.C.: Analytic Variations on Quadtrees. Algorithmica\u00a010, 473\u2013500 (1993)","journal-title":"Algorithmica"},{"issue":"4","key":"37_CR7","first-page":"151","volume":"12","author":"P. Flajolet","year":"1993","unstructured":"Flajolet, P., Lafforgue, T.: Search Costs in Quadtrees and Singularity Perturbation Analysis. Discrete and Computational Geometry\u00a012(4), 151\u2013175 (1993)","journal-title":"Discrete and Computational Geometry"},{"key":"37_CR8","volume-title":"Evolution of Random Search Trees","author":"H.M. Mahmoud","year":"1992","unstructured":"Mahmoud, H.M.: Evolution of Random Search Trees. Wiley Interscience Series, Hoboken (1992)"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, C., Panholzer, A., Prodinger, H.: On the number of descendants and ascendants in random search trees. Electronic Journal on Combinatorics\u00a05(1) (1998)","DOI":"10.37236\/1358"},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/274787.274812","volume":"45","author":"C. Mart\u00ednez","year":"1998","unstructured":"Mart\u00ednez, C., Roura, S.: Randomized binary search trees. Journal of the ACM\u00a045(2), 288\u2013323 (1998)","journal-title":"Journal of the ACM"},{"key":"37_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"12","key":"37_CR12","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1145\/359038.359043","volume":"23","author":"H. Samet","year":"1980","unstructured":"Samet, H.: Deletion in Two-Dimensional Quadtrees. Communications of the ACM\u00a023(12), 703\u2013710 (1980)","journal-title":"Communications of the ACM"},{"key":"37_CR13","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1990)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:26Z","timestamp":1605759686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}