The complexity of searching a sorted array of strings

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Arne Andersson Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden
Torben Hagerup Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany
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, Växjö University, 35195 Växjö, Swed ...
The complexity of searching a sorted array of strings Published by ACM 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 13
· Downloads (cumulative): 197
· Citation Count: 2

Published in:
· Proceeding
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Pages 317 - 325
ACM New York, NY, USA ©1994
table of contents ISBN:0-89791-663-8 doi>10.1145/195058.195175

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