Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
From MaRDI portal
Publication:4943856
DOI10.1137/S0097539797322425zbMath0943.68042OpenAlexW2041550253WikidataQ55888179 ScholiaQ55888179MaRDI QIDQ4943856
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539797322425
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)
Related Items
An algorithm for handling many relational calculus queries efficiently. ⋮ Dynamic layers of maxima with applications to dominating queries ⋮ External-memory multimaps ⋮ Sequential dependency computation via geometric data structures ⋮ Succinct data structure for dynamic trees with faster queries ⋮ Dynamic planar range skyline queries in log logarithmic expected time ⋮ Improved bounds for finger search on a RAM ⋮ Dynamic 3-sided planar range queries with expected doubly-logarithmic time ⋮ Block trees ⋮ Universal compressed text indexing ⋮ Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem ⋮ FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING ⋮ Dynamic relative compression, dynamic partial sums, and substring concatenation ⋮ Color-spanning localized query ⋮ A new framework for addressing temporal range queries and some preliminary results ⋮ Dynamic interpolation search revisited ⋮ Some Results for Elementary Operations ⋮ \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
