Modified Binary Searching for Static Tables

Authors:
Donatella Merlini;Renzo Sprugnoli;M. Cecilia Verri
Affiliations:
-;-;-
Venue:
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Year:
2000

Citing 3
Cited 0

Handbook of algorithms and data structures: in Pascal and C (2nd ed.)

Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a new method to retrieve keys in a static table. The keys of the table are stored in such a way that a binary search can be performed more efficently. An analysis of the method is performed and empirical evidence is given that it actually works.