A tight lower bound for searching a sorted array

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Arne Andersson Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden
Johan Håstad Department of Computer Science, Royal Institute of Technology, 10044 Stockholm, Sweden
Ola Petersson Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden and Department of Mathematics, Statistics and Computer Science, Vaxjo University, 35195 Växjö, Sweden
Published in:
Cover Image
 
· Proceeding
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Pages 417-426
ACM New York, NY, USA ©1995
table of contents ISBN:0-89791-718-9 doi>10.1145/225058.225171
A tight lower bound for searching a sorted array Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 240
· Citation Count: 1


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