Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

87

Voted

FOCS
2000
IEEE

82views Theoretical Computer Science» more FOCS 2000»

New Data Structures for Orthogonal Range Searching

15 years 7 months ago

New Data Structures for Orthogonal Range Searching

Download www.it-c.dk

Stephen Alstrup, Gerth Stølting Brodal, The

Real-time Traffic

FOCS 2000 | Theoretical Computer Science |

claim paper

Related Content

» Towards a dynamic data structure for efficient bounded line range search

» Cacheoblivious data structures for orthogonal range searching

» Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing

» Searching for Frequent Colors in Rectangles

» Untangled Monotonic Chains and Adaptive Range Search

» Counting Inversions Offline Orthogonal Range Counting and Related Problems

» A general approach for cacheoblivious range reporting and approximate range counting

» Orthogonal Range Searching on the RAM Revisited

» The cell probe complexity of dynamic range counting

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	FOCS
Authors	Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe

Comments (0)