s
Abstract:
hashing
Citations
| 132 | Data Structures and Algorithms 1: Sorting and Searching – Mehlhorn - 1984 |
| 113 | Should tables be sorted – Yao - 1981 |
| 82 | Explicit construction of linear sized superconcentrators – Gabber, Galil - 1981 |
| 55 | Membership in Constant Time and Almost-Minimum Space – Brodnik, Munro - 1999 |
| 34 | The spatial complexity of oblivious k-probe hash functions – Schmidt, Siegel - 1990 |
| 27 | Are bitvectors optimal – Buhrman, Miltersen, et al. - 2002 |
| 19 | Low redundancy in static dictionaries with O(1) lookup time – Pagh - 1999 |
| 4 | Natural bounded concentrators – Morgenstern - 1995 |
