Sciweavers

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

87

COMPGEOM
2005
ACM

97views Discrete Geometry» more COMPGEOM 2005»

Cache-oblivious planar orthogonal range searching and counting

15 years 4 months ago

Cache-oblivious planar orthogonal range searching and counting

Download www.daimi.au.dk

Lars Arge, Gerth Stølting Brodal, Rolf Fage

Real-time Traffic

COMPGEOM 2005 | Discrete Geometry |

claim paper

Related Content

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

» The cell probe complexity of dynamic range counting

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

» Approximate Range Searching

» Optimal External Memory Planar Point Enclosure

» A searchbased method for forecasting ad impression in contextual advertising

Post Info
More Details (n/a)

Added	13 Oct 2010
Updated	13 Oct 2010
Type	Conference
Year	2005
Where	COMPGEOM
Authors	Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen

Comments (0)