Efficient splitting and merging algorithms for order decomposable problems
From MaRDI portal
Publication:4571990
DOI10.1007/3-540-63165-8_215zbMath1401.68055OpenAlexW1500139253MaRDI QIDQ4571990
Giuseppe F. Italiano, Roberto Grossi
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_215
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computational aspects related to convexity (52B55) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of dynamic data structures
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- General methods for adding range restrictions to decomposable searching problems
- Some principles for dynamizing decomposable searching problems
- Worst-case optimal insertion and deletion methods for decomposable searching problems
- Optimal dynamization of decomposable searching problems
- Maintenance of configurations in the plane
- Dynamic multi-dimensional data structures based on quad- and k-d trees
- Divided \(k-d\) trees
- Decomposable searching problems
- Concatenable structures for decomposable problems
- Quad trees: A data structure for retrieval by composite keys
- Organization and maintenance of large ordered indexes
- Union-copy structures and dynamic segment trees
- Adding range restriction capability to dynamic data structures
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamization of order decomposable set problems
- Lower bounds on the efficiency of transforming static data structures into dynamic structures
- Multidimensional binary search trees used for associative searching
- Optimal External Memory Interval Management
This page was built for publication: Efficient splitting and merging algorithms for order decomposable problems
