Leo Liberti, James Ostrowski
Journal of Global Optimization
A new method for entering and retrieving information in a hash table is described. The method is intended to be efficient if most entries are looked up several times. The expected number of probes to look up an entry, predicted theoretically and verified by Monte Carlo experiments, is considerably less than for other comparable methods if the table is nearly full. An example of a possible Fortran implementation is given. © 1973, ACM. All rights reserved.
Leo Liberti, James Ostrowski
Journal of Global Optimization
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025