Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

In Proc. 26th ACM Symposium on Theory of Computing,pages 317325. ACM Press, 1994.

Summary: In Proc. 26th ACM Symposium on Theory of
Computing,pages 317­­325. ACM Press, 1994.
The complexity of searching a sorted array of strings
Arne Andersson \Lambda Torben Hagerup y Johan Hšastad z Ola Petersson x
We present an algorithm for finding a given k­character
string in an array of n strings, arranged in alphabetical or­
der, using
k log log n
log log (4 + k log log n
log n )
+ k + log n
character comparisons. This improves significantly upon
previous bounds.
1 Introduction
Given n strings arranged in alphabetical order, how many
characters must we probe to determine whether a k­charac­


Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet


Collections: Computer Technologies and Information Sciences