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

17 Optimal static range reporting in one dimension – Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe - 2001
26 Dynamic Ordered Sets with Exponential Search Trees – Arne Andersson, Mikkel Thorup - 2001
67 New data structures for orthogonal range searching – Stephen Alstrup, Theis Rauhe, Gerth Stølting Brodal - 2000
8 Delaunay Triangulations in O(sort(n)) Time and More – Kevin Buchin, Wolfgang Mulzer
4 On adaptive integer sorting – Anna Pagh, Rasmus Pagh, Mikkel Thorup - 2004
29 Cell probe complexity - a survey – Peter Bro Miltersen
5 On Searching Sorted Lists: A Near-Optimal Lower Bound – Paul Beame, Faith Fich - 1997
Spring ’12 Scribe Notes Collection – Prof Erik Demaine, Ta Tom Morgan, Justin Zhang, Editing Justin, Zhang Contents
34 Deterministic Dictionaries – Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh - 2001
Low-Entropy Computational Geometry – Wolfgang Johann Heinrich Mulzer - 2010
Limitations of Non-Uniform Computational Models – Amit Chakrabarti - 2002
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
63 Optimal Bounds for the Predecessor Problem – Paul Beame, Faith E. Fich
36 Time-space trade-offs for predecessor search – Mikkel Thorup - 2006
7 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
70 On RAM priority queues – Mikkel Thorup - 1996
4 Fast Algorithms for Shortest Paths and Sorting – Rajeev Raman - 1996