A tight lower bound for searching a sorted array

  • Authors:

  • Arne Andersson;Johan Håstad;Ola Petersson

  • Affiliations:

  • Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden;Department of Computer Science, Royal Institute of Technology, 10044 Stockholm, Sweden;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

  • Venue:
  • STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract