Median and hybrid median \(K\)-dimensional trees

DOI10.1007/978-3-031-20624-5_3OpenAlexW4312885400MaRDI QIDQ6163962

Amalia Duch, Mercè Pons, Conrado Martínez, Salvador Roura

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20624-5_3

zbMATH Keywords

analysis of algorithmsmultidimensional data structurespartial match queries\(K\)-d trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Median and hybrid median \(K\)-dimensional trees

Cites Work

• Unnamed Item
• Unnamed Item
• Divided \(k-d\) trees
• Partial match queries in relaxed multidimensional search trees
• Foundations of multidimensional and metric data structures.
• Squarish k-d Trees
• Improved master theorems for divide-and-conquer recurrences
• Multidimensional binary search trees used for associative searching
• Asymptotic expansion Of the incomplete beta function for large values Of the first parameter
• Partial match retrieval of multidimensional data
• Median and hybrid median \(K\)-dimensional trees

This page was built for publication: Median and hybrid median \(K\)-dimensional trees