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

Modified binary searching for static tables / D. MERLINI; SPRUGNOLI R.; VERRI M. C.. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 285 (1):(2002), pp. 73-88. [10.1016/S0304-3975(01)00291-2]

Modified binary searching for static tables

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

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 efficiently, An analysis of the method is performed and empirical evidence is given that it actually works.
2002
285 (1)
73
88
D. MERLINI; SPRUGNOLI R.; VERRI M. C.
File in questo prodotto:
File Dimensione Formato  
r12.pdf

Accesso chiuso

Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 126.46 kB
Formato Adobe PDF
126.46 kB Adobe PDF   Richiedi una copia

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/311556
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact