SIGN IN
SIGN UP
Cache-oblivious planar orthogonal range searching and counting
Full Text:
PDF
Buy this Article
Authors:
Lars Arge
University of Aarhus, Aarhus N, Denmark
Gerth Stølting Brodal
University of Aarhus, Aarhus N, Denmark
Rolf Fagerberg
University of Southern Denmark, Odense M, Denmark
Morten Laustsen
University of Aarhus, Aarhus N, Denmark
2005 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 15
· Downloads (cumulative): 315
· Citation Count: 9
Published in:
· Proceeding
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Pages 160-169
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-58113-991-8
doi>
10.1145/1064092.1064119
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
cache-oblivious
design
geometrical problems and computations
orthogonal range searching
range counting
semi-group range queries
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder