Optimal Expected-Time Algorithms for Closest Point Problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jon Louis Bentley
Bruce W. Weide
Andrew C. Yao Stanford University
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 6 Issue 4, Dec. 1980
Pages 563-580
ACM New York, NY, USA
table of contents doi>10.1145/355921.355927
Optimal Expected-Time Algorithms for Closest Point Problems Published by ACM 1980 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 65
· Downloads (cumulative): 1,398
· Citation Count: 76


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder