2 citations · 5 across the 7 of their papers we have counts for
4 papers · 1 filter
Stuffed IBLTs: Optimal Linear Multiset Sketches
Jonas Klausen, Rasmus Pagh, Stefan Walzer
A \emph{linear sketch} is a randomized linear mapping of a vector to a lower dimensional sketch vector, designed to preserve relevant information about . We consider sketche…
Quadratic Probing Insertions Are Time
Yang Hu, William Kuszmaul, Jingxun Liang +3
First proposed in 1968, quadratic probing has stood for more than half a century as one of the simplest and most widely used hash-table designs in computer science. It is conjectur…
Non-Minimal -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…
Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood
Yang Hu, William Kuszmaul, Jingxun Liang +3
Quadratic probing is one of the most widely used open-addressing hash-table schemes in practice, but after more than half a century, even its most basic performance guarantees rema…