uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Tight bounds for searching a sorted array of strings
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology. Computing science.
2000 (English)In: SIAM journal on computing (Print), ISSN 0097-5397, E-ISSN 1095-7111, Vol. 30, no 5, 1552-1578 p.Article in journal (Refereed) Published
Abstract [en]

Given a k-character query string and an array of n strings arranged in lexicographical order, computing the rank of the query string among the n strings or deciding whether it occurs in the array requires the inspection of $$ \Theta\left( \frac {k\log {\log n}} {\log {\log {(4+\frac{k \log{\log n}}{\log n})}}}+k+\log n\right) $$ characters in the worst case.Read More: http://epubs.siam.org/doi/abs/10.1137/S0097539797329889

Place, publisher, year, edition, pages
2000. Vol. 30, no 5, 1552-1578 p.
Keyword [en]
string searching; character comparisons; dictionaries; potential functions; lower bounds
National Category
Engineering and Technology
URN: urn:nbn:se:uu:diva-36479DOI: 10.1137/S0097539797329889OAI: oai:DiVA.org:uu-36479DiVA: diva2:64378
Available from: 2006-04-02 Created: 2006-04-02 Last updated: 2013-10-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://epubs.siam.org/sam-bin/dbq/article/32988

Search in DiVA

By author/editor
Andersson, Arne
By organisation
Department of Information Technology
In the same journal
SIAM journal on computing (Print)
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 194 hits
ReferencesLink to record
Permanent link

Direct link