Pages that link to "Item:Q797269"
From MaRDI portal
The following pages link to The design of dynamic data structures (Q797269):
Displaying 50 items.
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- Efficient dynamic range searching using data replication (Q293421) (← links)
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- Approximate range searching in external memory (Q627532) (← links)
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- A note on Boolean matrix multiplication (Q761038) (← links)
- On the definition and computation of rectilinear convex hulls (Q802314) (← links)
- Dynamic partition trees (Q804289) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Dynamic coresets (Q834605) (← links)
- Dynamic matrix rank (Q843102) (← links)
- Binary search trees of almost optimal height (Q911247) (← links)
- Dynamic deferred data structuring (Q917273) (← links)
- Efficient dynamic algorithms for some geometric intersection problems (Q918702) (← links)
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying (Q963330) (← links)
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374) (← links)
- Zooming by repeated range detection (Q1098306) (← links)
- Fractional cascading. I: A data structuring technique (Q1099957) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- A balanced search tree O(1) worst-case update time (Q1114387) (← links)
- On estimating the complexity of logarithmic decomposition (Q1116321) (← links)
- Maintaining range trees in secondary memory. Part I: Partitions (Q1120266) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- Efficient partition trees (Q1199132) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- An optimal algorithm for the on-line closest-pair problem (Q1330783) (← links)
- Complexity models for incremental computation (Q1331947) (← links)
- A constant update time finger search tree (Q1338781) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Indexing moving points (Q1394801) (← links)
- On approximate nearest neighbors under \(l_\infty\) norm (Q1604212) (← links)
- Loopless Gray code enumeration and the Tower of Bucharest (Q1623270) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- A dynamic fixed windowing problem (Q1825634) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Dynamic planar range skyline queries in log logarithmic expected time (Q2203584) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Optimizing binary heaps (Q2411045) (← links)
