Back to Results
First PageMeta Content
Cache / Computer science / Cache-oblivious algorithm / K-d tree / Binary logarithm / Computational geometry / Range tree / Fast Fourier transform / Bin / Mathematics / Computing / Analysis of algorithms


Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge†
Add to Reading List

Document Date: 2003-09-17 11:15:54

Open Document

File Size: 234,62 KB

Share Result on Facebook

City

Cambridge / San Diego / /

Company

Bayer / Database Systems / SIGMOD Intl / /

Country

United States / Netherlands / /

Currency

USD / /

/

Facility

store C0 / Massachusetts Institute of Technology / Computer Science Duke University / /

IndustryTerm

external priority search tree / exponential search trees / range search indexing / External memory algorithms / binary search trees / query algorithm / construction algorithm / oblivious search trees / cache-oblivious algorithms / memory systems / graph algorithms / search structure / model algorithms / external memory algorithm / cache-oblivious algorithm / /

Organization

Duke University / Providence / National Science Foundation / American Mathematical Society / Israel Binational Science Foundation / Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge† Andrew Danner‡ Bryan Holland-Minkley§ Department / Massachusetts Institute of Technology / /

Person

Bryan Holland-Minkley / L. Arge / V / Pankaj K. Agarwal∗ Lars Arge / Andrew Danner‡ Bryan / /

Position

Problems General / /

ProvinceOrState

Rhode Island / California / Massachusetts / /

PublishedMedium

Journal of the ACM / Communications of the ACM / /

Technology

graph algorithms / RAM / RAM model algorithms / external memory algorithm / cache-oblivious algorithm / cache-oblivious algorithms / paging / recent I/O-model algorithm / External memory algorithms / construction algorithm / query algorithm / /

SocialTag