Processing an offline insertion-query sequence with applications
From MaRDI portal
Publication:3173480
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A linear-time algorithm for a special case of disjoint set union
- Computational geometry. Algorithms and applications.
- Design and implementation of an efficient priority queue
- Geometric complexity of some location problems
- Introduction to algorithms
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Obtaining lower bounds using artificial components
- Preserving order in a forest in less than logarithmic time and linear space
- Ray Shooting and Parametric Search
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
- Some approximation algorithms for the clique partition problem in weighted interval graphs
- Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
- Visibility and intersection problems in plane geometry
Cited in
(2)
This page was built for publication: Processing an offline insertion-query sequence with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173480)