A functional approach to data structures and its use in multidimensional searching (1988)

Cached

Download Links

by Bernard Chazelle
Venue:SIAM J. Comput
Citations:132 - 3 self

Documents Related by Co-Citation

123 Multidimensional divide-and-conquer – J L Bentley - 1980
107 Filtering Search: A new approach to query-answering – Bernard Chazelle - 1986
130 The Design of Dynamic Data Structures – M Overmars - 1983
65 Lower bounds for orthogonal range searching: I. the reporting case – Bernard Chazelle - 1990
130 Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry – K Mehlhorn - 1984
23 Linear space data structures for two types of range search – B Chazele, H Edelsbrunner - 1987
256 Geometric Range Searching and Its Relatives – Pankaj K. Agarwal
27 Lower bounds on the complexity of some optimal data structures – M L Fredman - 1981
177 Priority search trees – E McCreight - 1985
159 Fractional cascading: I. A data structuring technique – Bernard Chazelle, Leonidas J. Guibas - 1986
41 Lower bounds for orthogonal range searching. II: The arithmetic model – B CHAZELLE - 1990
172 Space-efficient static trees and graphs – G Jacobson - 1989
53 Space-time tradeoff for answering range queries (extended abstract – Andrew Chi-Chih Yao - 1982
51 Adding range restriction capability to dynamic data structures – D E Willard, G S Lueker - 1985
2201 R-trees: A Dynamic Index Structure for Spatial Searching – Antonin Guttman - 1984
30 A lower bound on the complexity of orthogonal range queries – M L Fredman
56 A data structure for orthogonal range queries – S Lueker - 1978
80 Decomposable searching problems – J L Bentley - 1979
78 The p-range tree: a new data structure for range searching in secondary memory – S Subramanian, S Ramaswamy - 1995