The design of dynamic data structures
From MaRDI portal
Publication:797269
zbMath0545.68009MaRDI QIDQ797269
Publication date: 1983
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)
Related Items
An algorithm for handling many relational calculus queries efficiently. ⋮ An optimal algorithm for the on-line closest-pair problem ⋮ Complexity models for incremental computation ⋮ Dynamic layers of maxima with applications to dominating queries ⋮ Loopless Gray code enumeration and the Tower of Bucharest ⋮ I/O-efficient dynamic planar point location ⋮ A constant update time finger search tree ⋮ Dynamic coresets ⋮ Efficient dynamic range searching using data replication ⋮ Predecessor queries in dynamic integer sets ⋮ The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric ⋮ Dynamic half-space range reporting and its applications ⋮ Dynamic matrix rank ⋮ Binary search trees: How low can you go? ⋮ Verified Root-Balanced Trees ⋮ Dynamic closest pairs — A probabilistic approach ⋮ Dynamic algorithms for the Dyck languages ⋮ Straight-path queries in trajectory data ⋮ FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES ⋮ Zooming by repeated range detection ⋮ A dynamic separator algorithm ⋮ Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) ⋮ Fractional cascading. I: A data structuring technique ⋮ Fractional cascading. II: Applications ⋮ Orthogonal queries in segments ⋮ A balanced search tree O(1) worst-case update time ⋮ On estimating the complexity of logarithmic decomposition ⋮ Nearly Optimal Static Las Vegas Succinct Dictionary ⋮ Maintaining range trees in secondary memory. Part I: Partitions ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ Connected component and simple polygon intersection searching ⋮ On the succinct representation of equivalence classes ⋮ Optimizing binary heaps ⋮ On updating suffix tree labels ⋮ Concatenable segment trees ⋮ Indexing moving points ⋮ Incremental Voronoi diagrams ⋮ Red-black trees with constant update time ⋮ Dynamic data structures for \(k\)-nearest neighbor queries ⋮ Fully Dynamic Transitive Closure in plane dags with one source and one sink ⋮ Space-efficient functional offline-partially-persistent trees with applications to planar point location ⋮ Approximate range searching in external memory ⋮ Unnamed Item ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Dynamic planar range skyline queries in log logarithmic expected time ⋮ Binary search trees of almost optimal height ⋮ Unnamed Item ⋮ Dynamic deferred data structuring ⋮ Efficient dynamic algorithms for some geometric intersection problems ⋮ Dynamic geometric data structures via shallow cuttings ⋮ Approximate Range Searching in External Memory ⋮ Dynamic interpolation search in o(log log n) time ⋮ Using persistent data structures for adding range restrictions to searching problems ⋮ Divided \(k-d\) trees ⋮ Updating approximately complete trees ⋮ Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures ⋮ Reliable Resource Searching in P2P Networks ⋮ Maintaining the minimal distance of a point set in polylogarithmic time ⋮ Efficient partition trees ⋮ Dynamic point location in arrangements of hyperplanes ⋮ Fully dynamic Delaunay triangulation in logarithmic expected per operation ⋮ Minimizing the sum of diameters efficiently ⋮ Data structures for halfplane proximity queries and incremental Voronoi diagrams ⋮ Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying ⋮ Priority Queues and Sorting for Read-Only Data ⋮ Dynamic partition trees ⋮ Unnamed Item ⋮ Maintaining multiple representations of dynamic data structures ⋮ Unnamed Item ⋮ An incremental reconstruction method for dynamic planar point location ⋮ Resolving SINR Queries in a Dynamic Setting ⋮ Many distances in planar graphs ⋮ A note on Boolean matrix multiplication ⋮ A dynamic fixed windowing problem ⋮ An application of $m$-ary trees to the design of data structures for geometric searching problems ⋮ A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY ⋮ Efficient splitting and merging algorithms for order decomposable problems. ⋮ Unnamed Item ⋮ On the definition and computation of rectilinear convex hulls ⋮ Dynamic partition trees ⋮ On approximate nearest neighbors under \(l_\infty\) norm ⋮ Linked dynamic tries with applications to LZ-compression in sublinear time and space ⋮ Authenticated hash tables based on cryptographic accumulators
