Remembering conflicts in history yields dynamic algorithms
Authors:
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 21-30
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fully dynamic delaunay triangulation in logarithmic expected time per operationComputational Geometry, 1992
- Applications of random sampling to on-line algorithms in computational geometryDiscrete & Computational Geometry, 1992
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- Four results on randomized incremental constructions1992
- Randomized multidimensional search trees (extended abstract): dynamic sampling1991
- Bounded ordered dictionaries in O(log log N) time and O(n) spaceInformation Processing Letters, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- A fast planar partition algorithm. I1988
- Dynamic perfect hashing: upper and lower bounds1988
- Algorithms in Combinatorial Geometry1987