From the 1 of 6 linked papers with an AI index.
6 papers
Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood
Yang Hu, William Kuszmaul, Jingxun Liang +3
The paper studies a smoothed version of quadratic probing for hash tables, comparing Robin Hood and anti‑Robin Hood insertion orders and showing that anti‑Robin Hood achieves logar…
Non-minimal k-perfect hashing: Tight lower bounds and an application to fast static hash tables
Ragnar Groot Koerkamp, Stefan Hermann, Peter Sanders +1
A minimal perfect hash function (minimal PHF) is a data structure mapping a static set of keys to bins without collisions. Two natural generalizations are minimal -PHFs…
Learned Static Function Data Structures
Stefan Hermann, Hans-Peter Lehmann, Giorgio Vinciguerra +1
We consider the task of constructing a data structure for associating a static set of keys with values, while allowing arbitrary output values for queries involving keys outside th…
Modern Minimal Perfect Hashing: A Survey
Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh +4
Given a set of keys, a perfect hash function for maps the keys in to the first integers without collisions. It may return an arbitrary result for any key…
Engineering Minimal k-Perfect Hash Functions
Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann +2
Given a set S of n keys, a k-perfect hash function (kPHF) is a data structure that maps the keys to the first m integers, where each output integer can be hit by at most k input ke…
Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer +1
Randomised algorithms often employ methods that can fail and that are retried with independent randomness until they succeed. Randomised data structures therefore often store indic…