Biased range trees

DOI10.1007/S00453-010-9440-YMaRDI QIDQ2428657zbMATH OpenOpenAlexFDO

Authors John Howat, Pat Morin, Vida Dujmović

Publication date 26 April 2012

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-010-9440-y

zbMATH Keywords

computational geometrydata structuresorthogonal range searchingdistribution-sensitive data structures

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 7051217
• Biased Search Trees
• Two New Kinds of Biased Search Trees

Cites work

• scientific article; zbMATH DE number 1617272 (Why is no real title available?)
• scientific article; zbMATH DE number 5764827 (Why is no real title available?)
• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• scientific article; zbMATH DE number 6321467 (Why is no real title available?)
• scientific article; zbMATH DE number 6297698 (Why is no real title available?)
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• A Lower Bound on the Complexity of Orthogonal Range Queries
• A Mathematical Theory of Communication
• A simple entropy-based algorithm for planar point location
• Biased range trees
• Entropy, triangulation, and point location in planar subdivisions
• Entropy-preserving cuttings and space-efficient planar point location
• Expected asymptotically optimal planar point location
• Filtering Search: A New Approach to Query-Answering
• Fractional cascading. I: A data structuring technique
• Ignoring ignorance and agreeing to disagree
• Introduction to algorithms.
• Multidimensional binary search trees used for associative searching
• Multidimensional divide-and-conquer
• Nearly optimal binary search trees
• On the Complexity of Maintaining Partial Sums
• Optimal Expected-Case Planar Point Location
• Optimal planar point location
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting

Cited in

(4)

• Priority Range Trees
• scientific article; zbMATH DE number 7051217 (Why is no real title available?)
• A history of distribution-sensitive data structures
• Biased range trees

This page was built for publication: Biased range trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428657)