New data structures for orthogonal range searching

New data structures for orthogonal range searching (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Stephen Alstrup , Theis Rauhe , Gerth Stølting Brodal

Venue:	In Proc. 41st IEEE Symposium on Foundations of Computer Science
Citations:	53 - 2 self

BibTeX

@INPROCEEDINGS{Alstrup00newdata,
    author = {Stephen Alstrup and Theis Rauhe and Gerth Stølting Brodal},
    title = {New data structures for orthogonal range searching},
    booktitle = {In Proc. 41st IEEE Symposium on Foundations of Computer Science},
    year = {2000}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

419	Computational geometry - Preparata, Shamos - 1985
231	Making data structures persistent - Driscoll, Sarnak, et al. - 1989
217	Efficiency of a good but not linear set union algorithm - Tarjan - 1975
208	Quad trees, a data structure for retrieval on composite keys - Finkel, Bentley - 1974
207	Storing a sparse table with O(1) worst case access time - Fredman, Komlós, et al. - 1984
182	Design and implementation of an efficient priority queue - Boas, Kaas, et al. - 1977
156	Priority search trees - McCreight - 1985
146	Scaling and related techniques for geometry problems - Gabow, Bentley, et al. - 1984
130	Data Structures for Range Searching - Bentley, Friedman - 1979
124	Data Structures and Algorithms 3: Multi-dimensional Searching and - Mehlhorn - 1984
121	A functional approach to data structures and its use in multidimensional searching - Chazelle - 1988
104	Multidimensional divide-and-conquer - Bentley - 1980
99	Emde Boas. Preserving order in a forest in less than logarithmic time and linear - van - 1977
98	Filtering search: a new approach to query-answering - Chazelle - 1986
77	Decomposable searching problems - Bentley - 1979
76	A class of algorithms which require nonlinear time to maintain disjoint sets - Tarjan - 1979
74	On data structures and asymmetric communication complexity - Miltersen, Nisan, et al. - 1998
74	Log-Logarithmic Worst-Case Range Queries are Possible - Willard - 1983
73	Sorting in linear time - Andersson, Nilsson, et al. - 1995
73	The P-range Tree: A New Data Structure for Range Searching - Subramanian, Ramaswamy - 1995
66	Range searching - Agarwal - 1997
57	Optimal bounds for the predecessor problem - Beame, Fich - 1999
57	Lower bounds for orthogonal range searching, I: The reporting case - Chazelle - 1990
49	Adding range restriction capability to dynamic data structures - Willard, Lueker - 1985
48	A data structure for orthogonal range queries - Lueker - 1978
48	Space-time tradeoff for answering range queries - Yao - 1982
42	On the complexity of maintaining partial sums - Yao - 1985
40	Lower bounds for orthogonal range searching, II: The arithmetic model - Chazelle - 1990
35	Efficient worst-case data structures for range searching - Bentley, Maurer - 1980
34	New data structures for orthogonal range queries - Willard - 1985
30	Efficient Data Structures for Range Searching on a Grid - Overmars - 1988
27	bounds on the complexity of some optimal data structures - Fredman - 1981
25	Eciency of a good but not linear set union algorithm - Tarjan - 1975
24	Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree - Willard - 2000
21	Linear space data structures for two types of range search - Chazelle, Edelsbrunner - 1987
18	Computing partial sums in multidimensional arrays - Chazelle, Rosenberg - 1989
18	Fast deterministic sorting and priority queues in linear space - Thorup - 1998
17	Design and implementation of an ecient priority queue. Mathematical Systems Theory - Boaz, Kaas, et al. - 1977
15	Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations - Thorup - 1997
15	Applications of the fusion tree method to computational geometry and searching - Willard - 1992
13	Bounded ordered dictionaries in O(log log N) time and O(N) space - Mehlhorn, Näher - 1990
12	A problem in multivariate statistics: Algorithm, data structure, and applications - Bentley, Shamos - 1977
11	New results on intersection query problems - Bozanis, Ktsios, et al. - 1997
9	Applications of range query theory to relational data base join and selection operations - Willard - 1996
8	A log log n data structure for three-sided range queries - Fries, Mehlhorn, et al. - 1987
7	Storing a sparse table with worst case access time - Fredman, Komlós, et al. - 1984
5	Optimal retrieval algorithms for small region queries - Bolour - 1981
5	Space-time tradeo for answering range queries - Yao - 1982
4	On the application of sheared retrieval to orthogonal range queries - Willard - 1986
3	A direct dynamic solution to range search and related problems for product regions - Aviad, Shamir - 1981