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

Cached

Download Links

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

Documents Related by Co-Citation

104 Multidimensional divide-and-conquer – J L Bentley - 1980
98 Filtering Search: A new approach to query-answering – Bernard Chazelle - 1986
122 The Design of Dynamic Data Structures – M H Overmars - 1983
57 Lower bounds for orthogonal range searching: I. the reporting case – Bernard Chazelle - 1990
124 Data Structures and Algorithms 3: Multi-dimensional Searching and – K Mehlhorn - 1984
21 Linear space data structures for two types of range search – B Chazelle, H Edelsbrunner - 1987
223 Geometric Range Searching and Its Relatives – Pankaj K. Agarwal
27 bounds on the complexity of some optimal data structures – M L Lower Fredman - 1981
156 Priority search trees – E M McCreight - 1985
142 Fractional cascading: I. A data structuring technique – Bernard Chazelle, Leonidas J. Guibas - 1986
40 Lower bounds for orthogonal range searching, II: The arithmetic model – B Chazelle - 1990
172 Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract – Roberto Grossi, Jeffrey, Scott Vitter - 2000
48 Space-time tradeoff for answering range queries – A C Yao - 1982
1969 R-trees: A Dynamic Index Structure for Spatial Searching – Antonin Guttman - 1984
49 Adding range restriction capability to dynamic data structures – D E Willard, G S Lueker - 1985
30 A lower bound on the complexity of orthogonal range queries – M L Fredman - 1981
48 A data structure for orthogonal range queries – G S Lueker - 1978
77 Decomposable searching problems – J L Bentley - 1979
73 The P-range Tree: A New Data Structure for Range Searching – S Subramanian, S Ramaswamy - 1995