The design of dynamic data structures
From MaRDI portal
Publication:797269
zbMATH Open0545.68009MaRDI QIDQ797269FDOQ797269
Authors: Mark H. Overmars 
Publication date: 1983
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)
Cited In (90)
- Title not available (Why is that?)
- Authenticated hash tables based on cryptographic accumulators
- An algorithm for handling many relational calculus queries efficiently.
- An application of $m$-ary trees to the design of data structures for geometric searching problems
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying
- An optimal algorithm for the on-line closest-pair problem
- Dynamic layers of maxima with applications to dominating queries
- On approximate nearest neighbors under \(l_\infty\) norm
- Efficient dynamic algorithms for some geometric intersection problems
- Dynamic coresets
- Complexity models for incremental computation
- Using persistent data structures for adding range restrictions to searching problems
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- Fractional cascading. I: A data structuring technique
- Dynamic half-space range reporting and its applications
- On the definition and computation of rectilinear convex hulls
- On updating suffix tree labels
- Many distances in planar graphs
- Loopless Gray code enumeration and the Tower of Bucharest
- A dynamic fixed windowing problem
- Title not available (Why is that?)
- Indexing moving points
- Efficient partition trees
- DESIGN METHODOLOGY OF BOUNDARY DATA STRUCTURES
- Resolving SINR queries in a dynamic setting
- Efficient dynamic range searching using data replication
- Time-optimal top-\(k\) document retrieval
- On estimating the complexity of logarithmic decomposition
- Maintaining multiple representations of dynamic data structures
- Red-black trees with constant update time
- Fitting a step function to a point set with outliers based on simplicial thickness data structures
- Efficient splitting and merging algorithms for order decomposable problems.
- Efficient splitting and merging algorithms for order decomposable problems
- Maintaining range trees in secondary memory. Part I: Partitions
- Binary search trees of almost optimal height
- Divided \(k-d\) trees
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- An incremental reconstruction method for dynamic planar point location
- A balanced search tree O(1) worst-case update time
- Approximate range searching in external memory
- A note on Boolean matrix multiplication
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
- Dynamic data structures for \(k\)-nearest neighbor queries
- Connected component and simple polygon intersection searching
- A constant update time finger search tree
- Maintaining the minimal distance of a point set in polylogarithmic time
- Dynamic partition trees
- Priority queues and sorting for read-only data
- Dynamic matrix rank
- Dynamic deferred data structuring
- Incremental Voronoi diagrams
- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Dynamic interpolation search in \(o(\log\log n)\) time
- Dynamic point location in arrangements of hyperplanes
- Minimizing the sum of diameters efficiently
- Verified Root-Balanced Trees
- Orthogonal queries in segments
- Zooming by repeated range detection
- Fractional cascading. II: Applications
- I/O-efficient dynamic planar point location
- Dynamic partition trees
- Dynamic planar orthogonal point location in sublogarithmic time
- Title not available (Why is that?)
- Space-efficient functional offline-partially-persistent trees with applications to planar point location
- Dynamic closest pairs — A probabilistic approach
- Dynamic geometric data structures via shallow cuttings
- Concatenable segment trees (extended abstract)
- On the succinct representation of equivalence classes
- Title not available (Why is that?)
- Problems in data structures and algorithms
- Approximate Range Searching in External Memory
- Reliable resource searching in P2P networks
- Straight-path queries in trajectory data
- Binary search trees: How low can you go?
- Improved points approximation algorithms based on simplicial thickness data structures
- Title not available (Why is that?)
- Data structures with dynamical random transitions
- Updating approximately complete trees
- Title not available (Why is that?)
- Predecessor queries in dynamic integer sets
- Resolving SINR Queries in a Dynamic Setting
- Fully Dynamic Transitive Closure in plane dags with one source and one sink
- Optimizing binary heaps
- Dynamic algorithms for the Dyck languages
- A dynamic separator algorithm
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- Variations of largest rectangle recognition amidst a bichromatic point set
- Dynamic planar range skyline queries in log logarithmic expected time
- Nearly Optimal Static Las Vegas Succinct Dictionary
This page was built for publication: The design of dynamic data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797269)
