{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:49:55Z","timestamp":1774385395655,"version":"3.50.1"},"reference-count":88,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:00:00Z","timestamp":1768435200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["MCIN\/AEI\/10.13039\/501100011033"],"award-info":[{"award-number":["MCIN\/AEI\/10.13039\/501100011033"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Gobierno de Espa\u00f1a Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2020-112581GB-C21"],"award-info":[{"award-number":["PID2020-112581GB-C21"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Science Review"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cosrev.2026.100904","type":"journal-article","created":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T16:57:23Z","timestamp":1771606643000},"page":"100904","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The analysis of partial match queries in random multidimensional trees: A selected survey"],"prefix":"10.1016","volume":"61","author":[{"given":"Amalia","family":"Duch","sequence":"first","affiliation":[]},{"given":"Hsien-Kuei","family":"Hwang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1302-9067","authenticated-orcid":false,"given":"Conrado","family":"Mart\u00ednez","sequence":"additional","affiliation":[]},{"given":"Ralph","family":"Neininger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cosrev.2026.100904_bib0005","series-title":"Lectures in Mathematics ETH Z\u00fcrich","article-title":"Gradient flows in metric spaces and in the space of probability measures","author":"Ambrosio","year":"2008"},{"key":"10.1016\/j.cosrev.2026.100904_bib0010","series-title":"Proceedings of the 11th Latin American Theoretical Informatics Conference (LATIN), vol. 8392 of Lecture Notes in Computer Science","first-page":"743","article-title":"Quad-k-d trees","author":"Bereczky","year":"2014"},{"key":"10.1016\/j.cosrev.2026.100904_bib0015","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.tcs.2015.12.030","article-title":"Quad-kd trees: a general framework for kd trees and quad trees","volume":"616","author":"Bereczky","year":"2016","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"10.1016\/j.cosrev.2026.100904_bib0020","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM"},{"issue":"5","key":"10.1016\/j.cosrev.2026.100904_bib0025","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(79)90117-0","article-title":"Decomposable searching problems","volume":"8","author":"Bentley","year":"1979","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.cosrev.2026.100904_bib0030","series-title":"Cambridge Studies in Advanced Mathematics","article-title":"Random fragmentation and coagulation processes","volume":"vol. 102","author":"Bertoin","year":"2006"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100904_bib0035","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/356789.356797","article-title":"Data structures for range searching","volume":"11","author":"Bentley","year":"1979","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.cosrev.2026.100904_bib0040","series-title":"Wiley Series in Probability and Statistics: Probability and Statistics","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316962","article-title":"Convergence of probability measures","author":"Billingsley","year":"1999"},{"key":"10.1016\/j.cosrev.2026.100904_bib0045","series-title":"VLDB\u201996, Proceedings of 22th International Conference on Very Large Data Bases, September 3-6, 1996, Mumbai (Bombay), India","first-page":"28","article-title":"The X-tree: an index structure for high-dimensional data","author":"Berchtold","year":"1996"},{"key":"10.1016\/j.cosrev.2026.100904_bib0050","series-title":"Proceedings of the23RdAnnual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"1056","article-title":"Partial match queries in random quadtrees","author":"Broutin","year":"2012"},{"issue":"6","key":"10.1016\/j.cosrev.2026.100904_bib0055","doi-asserted-by":"crossref","first-page":"2560","DOI":"10.1214\/12-AAP912","article-title":"A limit process for partial match queries in random quadtrees and 2-d trees","volume":"23","author":"Broutin","year":"2013","journal-title":"Ann. Appl. Probab."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0060","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/320455.320469","article-title":"Hashing and trie algorithms for partial match retrieval","volume":"1","author":"Burkhard","year":"1976","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.cosrev.2026.100904_bib0065","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s002360000044","article-title":"Analysis of range search for random k-d trees","volume":"37","author":"Chanzy","year":"2001","journal-title":"Acta Inform."},{"key":"10.1016\/j.cosrev.2026.100904_bib0070","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1137\/S0097539702412131","article-title":"Partial match queries in random quadtrees","volume":"32","author":"Chern","year":"2003","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/j.cosrev.2026.100904_bib0075","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1137\/S0097539703437491","article-title":"Partial match queries in random k-d trees","volume":"35","author":"Chern","year":"2006","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cosrev.2026.100904_bib0080","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1239\/aap\/1300198518","article-title":"Partial match queries in two-dimensional quadtrees: a probabilistic approach","volume":"43","author":"Curien","year":"2011","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/j.cosrev.2026.100904_bib0085","series-title":"Workshop on Algorithms and Data Structures (WADS\u201989). Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-51542-9_4","article-title":"Analysis of Kdt-trees: Kd-trees improved by local reorganisations","volume":"vol. 382","author":"Cunto","year":"1989"},{"key":"10.1016\/j.cosrev.2026.100904_bib0090","series-title":"Introduction to Algorithms","author":"Cormen","year":"2022"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100904_bib0095","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","article-title":"Searching in metric spaces","volume":"33","author":"Ch\u00e1vez","year":"2001","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"10.1016\/j.cosrev.2026.100904_bib0100","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1017\/S096354831200017X","article-title":"Strong convergence of partial match queries in random quadtrees","volume":"21","author":"Curien","year":"2012","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.cosrev.2026.100904_bib0105","series-title":"Design and Analysis of Multidimensional Data Structures","author":"Duch Brown","year":"2004"},{"key":"10.1016\/j.cosrev.2026.100904_bib0110","series-title":"Algorithms \u2013 ESA 2012","first-page":"383","article-title":"Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes","author":"de Berg","year":"2012"},{"key":"10.1016\/j.cosrev.2026.100904_bib0115","series-title":"9th International Symposium on Algorithms and Computation (ISAAC)","first-page":"199","article-title":"Randomized k-dimensional binary search trees","volume":"vol. 1533","author":"Duch","year":"1998"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100904_bib0120","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1002\/rsa.20476","article-title":"Selection by rank in k-dimensional binary search trees","volume":"45","author":"Duch","year":"2014","journal-title":"Random Struct. & Alg."},{"key":"10.1016\/j.cosrev.2026.100904_bib0125","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1137\/S0097539799358926","article-title":"Squarish k-d trees","volume":"30","author":"Devroye","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cosrev.2026.100904_bib0130","series-title":"Proceedings of the 14th ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO)","first-page":"131","article-title":"Partial match queries in relaxed k-dt trees","author":"Duch","year":"2017"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100904_bib0135","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1007\/s00453-015-0097-4","article-title":"On the cost of fixed partial match queries in k-d trees","volume":"75","author":"Duch","year":"2016","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2026.100904_bib0140","series-title":"Proceedings of the 12th Latin American Theoretical Informatics Conference (LATIN) of Lecture notes in computer science","first-page":"376","article-title":"Random partial match in quad-k-d trees","volume":"vol. 9644","author":"Duch","year":"2016"},{"key":"10.1016\/j.cosrev.2026.100904_bib0145","series-title":"Proceedings of the 29Th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA) Leibniz international proceedings in informatics (LIPIcs)","first-page":":20:1","article-title":"Fixed partial match queries in quadtrees","volume":"vol. 110","author":"Duch","year":"2018"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100904_bib0150","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0196-6774(02)00213-4","article-title":"On the average performance of orthogonal range search in multidimensional data structures","volume":"44","author":"Duch","year":"2002","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100904_bib0155","doi-asserted-by":"crossref","first-page":":4:1","DOI":"10.1145\/1644015.1644019","article-title":"Updating relaxed k-d trees","volume":"6","author":"Duch","year":"2009","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.cosrev.2026.100904_bib0160","first-page":"385","article-title":"On the expected cost of partial match queries in random quad-k-d trees","volume":"3","author":"Duch","year":"2024","journal-title":"La Matematica. Off. J. Assoc. Women Math."},{"key":"10.1016\/j.cosrev.2026.100904_bib0165","series-title":"Proceedings of the 15th Latin American Theoretical Informatics Conference (LATIN) Lecture notes in computer science","first-page":"38","article-title":"Median and hybrid median k-dimensional trees","volume":"vol. 13568","author":"Duch","year":"2022"},{"key":"10.1016\/j.cosrev.2026.100904_bib0170","series-title":"Handbook of Data Structures and Applications","author":"Mehta","year":"2017"},{"key":"10.1016\/j.cosrev.2026.100904_bib0175","series-title":"Proceedings of the 15Th International Symposium on Algorithms and Computation (ISAAC) Lecture notes in computer science","first-page":"415","article-title":"Randomized insertion and deletion in point quad trees","volume":"vol. 3341","author":"Duch","year":"2004"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100904_bib0180","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","article-title":"quad trees: a data structure for retrieval on composite key","volume":"4","author":"Finkel","year":"1974","journal-title":"Acta Inform."},{"issue":"1\u20132","key":"10.1016\/j.cosrev.2026.100904_bib0185","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(95)00002-E","article-title":"Mellin transforms and asymptotics: harmonic sums","volume":"144","author":"Flajolet","year":"1995","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.cosrev.2026.100904_bib0190","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(95)00002-E","article-title":"Mellin transforms and asymptotics: harmonic sums","volume":"144","author":"Flajolet","year":"1995","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0195","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(92)00065-Y","article-title":"Mellin transforms and asymptotics: digital sums","volume":"123","author":"Flajolet","year":"1994","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.cosrev.2026.100904_bib0200","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF01891833","article-title":"Analytic variations on quad trees","volume":"10","author":"Flajolet","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2026.100904_bib0205","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02574372","article-title":"Search costs in quadtrees and singularity perturbation asymptotics","volume":"12","author":"Flajolet","year":"1994","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0210","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/rsa.3240070203","article-title":"Hypergeometrics and the cost structure of quadtrees","volume":"7","author":"Flajolet","year":"1995","journal-title":"Random Struct. & Alg."},{"key":"10.1016\/j.cosrev.2026.100904_bib0215","series-title":"Introduction to Partial Differential Equations","author":"Folland","year":"1995"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0220","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/5383.5453","article-title":"Partial match retrieval of multidimensional data","volume":"33","author":"Flajolet","year":"1986","journal-title":"J. ACM"},{"issue":"1\u20132","key":"10.1016\/j.cosrev.2026.100904_bib0225","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0304-3975(94)00281-M","article-title":"Mellin transforms and asymptotics: finite differences and Rice\u2019s integrals","volume":"144","author":"Flajolet","year":"1995","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.cosrev.2026.100904_bib0230","series-title":"Analytic Combinatorics","author":"Flajolet","year":"2009"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100904_bib0235","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00371-012-0675-2","article-title":"An efficient multi-resolution framework for high quality interactive rendering of massive point clouds using multi-way kd-trees","volume":"29","author":"Goswami","year":"2013","journal-title":"The Visual Computer"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0240","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","article-title":"Multidimensional access methods","volume":"30","author":"Gaede","year":"1998","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0245","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/971697.602266","article-title":"R-trees: a dynamic index structure for spatial searching","volume":"14","author":"Guttman","year":"1984","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/j.cosrev.2026.100904_bib0250","series-title":"The Mathematician\u2019s Mind: the Psychology of Invention in the Mathematical Field","author":"Hadamard","year":"1965"},{"key":"10.1016\/j.cosrev.2026.100904_bib0255","series-title":"Doctoral Dissertation, Czech Technical University","article-title":"Heuristic ray shooting algorithms","author":"Havran","year":"2000"},{"key":"10.1016\/j.cosrev.2026.100904_bib0260","series-title":"Advances in Visual Computing","first-page":"681","article-title":"Fast kd-tree construction for 3d-rendering algorithms like ray tracing","author":"Hussain","year":"2007"},{"issue":"1127","key":"10.1016\/j.cosrev.2026.100904_bib0265","article-title":"Higher moments of banach space valued random variables","volume":"238","author":"Janson","year":"2015","journal-title":"Mem. Amer. Math. Soc."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100904_bib0270","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","article-title":"The TV-tree: an index structure for high-dimensional data","volume":"3","author":"Lin","year":"1994","journal-title":"The VLDB J."},{"key":"10.1016\/j.cosrev.2026.100904_bib0275","series-title":"Analysis of Partial Match Queries in Multidimensional Search Trees","author":"Lau Laynes-Lozada","year":"2019"},{"key":"10.1016\/j.cosrev.2026.100904_bib0280","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1991"},{"key":"10.1016\/j.cosrev.2026.100904_bib0285","series-title":"R-Trees: Theory and Applications: Theory and Applications","author":"Manolopoulos","year":"2006"},{"key":"10.1016\/j.cosrev.2026.100904_bib0290","series-title":"Proceedings of the 16th ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO)","first-page":"54","article-title":"Sesquickselect: one and a half pivots for cache-efficient selection","author":"Mart\u00ednez","year":"2019"},{"issue":"1\u20132","key":"10.1016\/j.cosrev.2026.100904_bib0295","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02679618","article-title":"Partial match queries in relaxed multidimensional search trees","volume":"29","author":"Mart\u00ednez","year":"2001","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"10.1016\/j.cosrev.2026.100904_bib0300","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02679618","article-title":"Partial match queries in relaxed multidimensional search trees","volume":"29","author":"Mart\u00ednez","year":"2001","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100904_bib0305","article-title":"Adaptive sampling strategies for quickselect","volume":"6","author":"Mart\u00ednez","year":"2010","journal-title":"ACM Trans. Algor."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0310","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/274787.274812","article-title":"Randomized binary search trees","volume":"45","author":"Mart\u00ednez","year":"1998","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100904_bib0315","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/S0097539700382108","article-title":"Optimal sampling strategies in quicksort and quickselect","volume":"31","author":"Mart\u00ednez","year":"2001","journal-title":"SIAM J. Comput."},{"issue":"3\u20134","key":"10.1016\/j.cosrev.2026.100904_bib0320","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<403::AID-RSA11>3.0.CO;2-K","article-title":"Asymptotic distributions for partial match queries in k-d trees","volume":"17","author":"Neininger","year":"2000","journal-title":"Random Struct. Algorithms"},{"issue":"9","key":"10.1016\/j.cosrev.2026.100904_bib0325","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","article-title":"The grid file: an adaptable symmetric multikey file structure","volume":"1","author":"Nievergelt","year":"1984","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0330","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1214\/aoap\/1015345300","article-title":"Limit laws for partial match queries in quadtrees","volume":"11","author":"Neininger","year":"2001","journal-title":"Ann. Appl. Probab."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100904_bib0335","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1214\/aoap\/1075828056","article-title":"A general limit theorem for recursive algorithms and combinatorial structures","volume":"14","author":"Neininger","year":"2004","journal-title":"Ann. Appl. Probab."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100904_bib0340","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1214\/14-AOP919","article-title":"On a functional contraction method","volume":"43","author":"Neininger","year":"2015","journal-title":"Ann. Probab."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100904_bib0345","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1007\/s00453-015-0041-7","article-title":"Analysis of pivot sampling in dual-pivot quicksort: a holistic analysis of yaroslavskiy\u2019s partition scheme","volume":"75","author":"Nebel","year":"2016","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2026.100904_bib0350","article-title":"Incomplete Gamma and related functions","author":"Paris","year":"2010"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0355","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01934379","article-title":"Analysis of the grid file algorithms","volume":"25","author":"Regnier","year":"1985","journal-title":"BIT"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100904_bib0360","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing\u2014a fast access method for dynamic files","volume":"4","author":"Ronald","year":"1979","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100904_bib0365","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1051\/ita\/1991250100851","article-title":"A limit theorem for \u201cquicksort\u201d","volume":"25","author":"R\u00f6sler","year":"1991","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100904_bib0370","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/375827.375837","article-title":"Improved master theorems for divide-and-conquer recurrences","volume":"48","author":"Roura","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/j.cosrev.2026.100904_bib0375","series-title":"Applications of Spatial Data Structures","author":"Samet","year":"1990"},{"key":"10.1016\/j.cosrev.2026.100904_bib0380","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","year":"1990"},{"key":"10.1016\/j.cosrev.2026.100904_bib0385","series-title":"Foundations of Multidimensional and Metric Data Structures","author":"Samet","year":"2006"},{"key":"10.1016\/j.cosrev.2026.100904_bib0390","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/rsa.3240070106","article-title":"The variance of a partial match retrieval in a multidimensional symmetric trie","volume":"7\/1","author":"Schachinger","year":"1995","journal-title":"Random Struct. & Alg."},{"key":"10.1016\/j.cosrev.2026.100904_bib0395","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<428::AID-RSA12>3.0.CO;2-6","article-title":"Limiting distributions for the costs of partial match retrievals in multidimensional tries","volume":"17","author":"Schachinger","year":"2000","journal-title":"Random Struct. & Alg."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100904_bib0400","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/S0097539703425873","article-title":"Distributional results for costs of partial match queries in asymmetric k-dimensional tries","volume":"33","author":"Schachinger","year":"2004","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cosrev.2026.100904_bib0405","series-title":"An Introduction to the Analysis of Algorithms","author":"Sedgewick","year":"2013"},{"key":"10.1016\/j.cosrev.2026.100904_bib0410","series-title":"Proceedings of the Fourteenth International Conference on Very Large Databases","first-page":"360","article-title":"Techniques for design and implementation of spatial access methods","author":"Seeger","year":"1988"},{"key":"10.1016\/j.cosrev.2026.100904_bib0415","doi-asserted-by":"crossref","first-page":"289","DOI":"10.5194\/isprsarchives-XL-3-289-2014","article-title":"Efficient point cloud collision detection and analysis in a tunnel environment using kinematic laser scanning and k-d tree search","volume":"XL-3","author":"Schauer","year":"2014","journal-title":"Int. Arch. Photogramm. Remote Sens. Spat. Inf. Sci."},{"issue":"3","key":"10.1016\/j.cosrev.2026.100904_bib0420","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.aei.2015.03.007","article-title":"Collision detection between point clouds using an efficient kd tree implementation","volume":"29","author":"Schauer","year":"2015","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.cosrev.2026.100904_bib0425","series-title":"Grundlehren Der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]","article-title":"Optimal transport","volume":"vol. 338","author":"Villani","year":"2009"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100904_bib0430","first-page":"1","article-title":"Ray tracing deformable scenes using dynamic bounding volume hierarchies","volume":"25","author":"Wald","year":"2006","journal-title":"ACM Trans. on Graph. (TOG)"},{"key":"10.1016\/j.cosrev.2026.100904_bib0435","series-title":"Similarity Search","author":"Zezula","year":"2006"},{"key":"10.1016\/j.cosrev.2026.100904_bib0440","series-title":"Handbook of Differential Equations","author":"Zwillinger","year":"1997"}],"container-title":["Computer Science Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013726000134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013726000134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:22:35Z","timestamp":1774372955000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574013726000134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":88,"alternative-id":["S1574013726000134"],"URL":"https:\/\/doi.org\/10.1016\/j.cosrev.2026.100904","relation":{},"ISSN":["1574-0137"],"issn-type":[{"value":"1574-0137","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The analysis of partial match queries in random multidimensional trees: A selected survey","name":"articletitle","label":"Article Title"},{"value":"Computer Science Review","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cosrev.2026.100904","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"100904"}}