A New Universal Class of Hash Functions and Dynamic Hashing in Real Time

By Martin Dietzfelbinger, F. Heide. 1990

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

PIR with Compressed Queries and Amortized Query Processing (2018, background): “Relatedly, many data structures, systems, and networking applications use different variants of hashing—consistent [49], asymmetric [73], weighted [72], multi-choice [9, 61], cuckoo [8, 63], and others [18, 34]—to achieve the same goal.”
Cuckoo Hashing (2001, background): “Dietzfelbinger and Meyer auf der Heide [8] improved the update performance by exhibiting a dictionary in which operations are done in constant time with high probability, i.e., probability at least 1 − n”
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation (2009, methodology): “∗Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel.”