Web www.itu.dkOptimal Static Range Reporting in One Dimension (2000)

Cached

Download Links

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

Active Bibliography

15 Optimal static range reporting in one dimension – Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe - 2001
53 New data structures for orthogonal range searching – Stephen Alstrup, Theis Rauhe, Gerth Stølting Brodal - 2000
14 Dynamic ordered sets with exponential search trees – Arne Andersson, Mikkel Thorup - 2002
4 On adaptive integer sorting – Anna Pagh, Rasmus Pagh, Mikkel Thorup - 2004
27 Cell Probe Complexity - a Survey – Peter Bro Miltersen - 1999
5 On Searching Sorted Lists: A Near-Optimal Lower Bound – Paul Beame, Faith Fich - 1997
30 Deterministic Dictionaries – Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh - 2001
Low-Entropy Computational Geometry – Wolfgang Johann Heinrich Mulzer - 2010
18 A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube – Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov - 1999
Limitations of Non-Uniform Computational Models – Amit Chakrabarti - 2002
57 Optimal Bounds for the Predecessor Problem – Paul Beame, Faith E. Fich
27 Time-space trade-offs for predecessor search – Mikkel Thorup - 2006
4 Mikkel Thorup: Randomization does not help searching predecessors – Mikkel Thorup
3 Improved Data Structures for Predecessor Queries in Integer Sets – Rajeev Raman - 1996
1 Lower Bound Techniques for Data Structures – Mihai Patrascu - 2008
69 On RAM priority queues – Mikkel Thorup - 1996
5 Fast Algorithms for Shortest Paths and Sorting – Rajeev Raman - 1996
44 Optimal Bounds for the Predecessor Problem and Related Problems – Paul Beame, Faith E. Fich - 2001
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time ∗ – unknown authors - 2008