SIGN IN
SIGN UP
Multidimensional search trees that provide new types of memory reductions
Full Text:
PDF
Buy this Article
Author:
Dan E. Willard
State Univ. of New York at Albany, Albany
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 34 Issue 4, Oct. 1987
Pages 846-858
ACM
New York, NY
, USA
table of contents
doi>
10.1145/31846.42228
1987 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 9
· Downloads (cumulative): 506
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
graph and tree search strategies
performance
sorting and searching
theory
verification
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