Decomposable searching problems I. Static-to-dynamic transformation

Journal of Algorithms

Volumn 1, Issue 4, 1980, Pages 301-358

  Bentley, Jon Louis ^a   Saxe, James B ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000108833     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(80)90015-2     Document Type: Article

References (25)

1. Divide and Conquer Algorithms for Closest-Point Problems in Multidimensional Space
2. Decomposable searching problems
3. Efficient worst-case data structures for range searching
4. A problem in multivariate statistics: Algorithm, data structure, and applications
5. An Alphard specification of a correct and efficient transformation on data structures
6. Multidimensional searching problems
7. Optimizing the Dynamization of Decomposable Searching Problems
8. Dynamic Systems of Static Data-Structures
9. Dynamization of Decomposable Searching Problems
10. Applications of a planar separator theorem
11. A data structure for orthogonal range queries
12. A Transformation for Adding Range Restriction Capability to Dynamic Data Structures for Decomposable Searching Problems
13. Dynamic Solutions of Decomposable Searching Problems
14. Implicit data structures
15. Two general methods for dynamizing decomposable searching problems
16. A New Approach to Planar Point Location
17. On a Greedy Heuristic for Complete Matching
18. Partial match retrieval algorithms
19. Computational Geometry
20. A data structure for manipulating priority queues
21. Predicate-Oriented Database Search Algorithms