Dynamization of decomposable searching problems yielding good worst-case bounds
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 224-233
- https://doi.org/10.1007/bfb0017314
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Dynamization of decomposable searching problems yielding good worst-case boundsLecture Notes in Computer Science, 1981
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Dynamization of decomposable searching problemsInformation Processing Letters, 1980
- Efficient computation of continuous skeletonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Transforming static data structures to dynamic structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Decomposable searching problemsInformation Processing Letters, 1979
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974