Efficient splitting and merging algorithms for order decomposable problems.
From MaRDI portal
Recommendations
- Efficient splitting and merging algorithms for order decomposable problems
- Some optimal algorithms for decomposed partially ordered sets
- scientific article; zbMATH DE number 1880331
- Algorithmic approach to the split problems
- Time-space optimal parallel merging and sorting
- scientific article; zbMATH DE number 1696745
- An O(n2) Algorithm for Undirected Split Decomposition
Cites work
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 3716801 (Why is no real title available?)
- scientific article; zbMATH DE number 3716802 (Why is no real title available?)
- scientific article; zbMATH DE number 3722116 (Why is no real title available?)
- scientific article; zbMATH DE number 1424325 (Why is no real title available?)
- A linear algorithm for finding the convex hull of a simple polygon
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- A new approach to rectangle intersections part I
- Adding range restriction capability to dynamic data structures
- Batched dynamic solutions to decomposable searching problems
- Binary Search Trees of Bounded Balance
- Concatenable structures for decomposable problems
- Decomposable searching problems
- Decomposable searching problems I. Static-to-dynamic transformation
- Divided \(k-d\) trees
- Dynamic multi-dimensional data structures based on quad- and k-d trees
- Dynamization of order decomposable set problems
- Efficient splitting and merging algorithms for order decomposable problems
- General methods for adding range restrictions to decomposable searching problems
- Lower bounds on the efficiency of transforming static data structures into dynamic structures
- Maintenance of configurations in the plane
- Maintenance of geometric extrema
- Multidimensional binary search trees used for associative searching
- Multidimensional divide-and-conquer
- On the computational power of pushdown automata
- On the dynamization of data structures
- Optimal dynamization of decomposable searching problems
- Quad trees: A data structure for retrieval by composite keys
- Some principles for dynamizing decomposable searching problems
- The design of dynamic data structures
- Two general methods for dynamizing decomposable searching problems
- Union-copy structures and dynamic segment trees
- Worst-case optimal insertion and deletion methods for decomposable searching problems
Cited in
(5)- Concatenable segment trees (extended abstract)
- A general approach for cache-oblivious range reporting and approximate range counting
- Some optimal algorithms for decomposed partially ordered sets
- Efficient splitting and merging algorithms for order decomposable problems
- Cache-oblivious range reporting with optimal queries requires superlinear space
This page was built for publication: Efficient splitting and merging algorithms for order decomposable problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854311)
