Fast local searches and updates in bounded universes
From MaRDI portal
(Redirected from Publication:691776)
Recommendations
Cites work
- scientific article; zbMATH DE number 2119699 (Why is no real title available?)
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Data Structures with Local Update Operations
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Dynamic ordered sets with exponential search trees
- Efficient data structures for range searching on a grid
- Efficient regular data structures and algorithms for dilation, location, and proximity problems
- Geometric approximation algorithms
- Improved bounds for finger search on a RAM
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Optimal bounds for the predecessor problem and related problems
- Optimal finger search trees in the pointer machine
- Orthogonal range searching on the RAM, revisited
- Preserving order in a forest in less than logarithmic time and linear space
- Priority Search Trees
Cited in
(5)
This page was built for publication: Fast local searches and updates in bounded universes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691776)