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 ecently. An analysis of the method is performed and empirical evidence is given that it actually works.

Modified Binary Searching for Static Tables / D. Merlini;R. Sprugnoli;M. C. Verri. - STAMPA. - (2000), pp. 211-225. [10.1007/3-540-46521-9_18]

Modified Binary Searching for Static Tables

MERLINI, DONATELLA;SPRUGNOLI, RENZO;VERRI, MARIA CECILIA
2000

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 ecently. An analysis of the method is performed and empirical evidence is given that it actually works.
2000
3540671595
Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Lecture Notes in Computer Science 1767
211
225
D. Merlini;R. Sprugnoli;M. C. Verri
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/647389
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact