On the Probe Complexities of Membership and Perfect Hashing

by Rasmus Pagh

Citations:

12 - 5 self

@MISC{Pagh_onthe,
    author = {Rasmus Pagh},
    title = {On the Probe Complexities of Membership and Perfect Hashing},
    year = {}
}

This paper considers the following static data structure problems.

137	Data Structures and Algorithms 1: Sorting and Searching - Mehlhorn - 1984
120	Should tables be sorted - Yao - 1981
90	and Zvi Galil. Explicit constructions of linear-sized superconcentrators - Gabber - 1981
61	Membership in constant time and almost-minimum space - Brodnik, Munro - 1999
49	Are bitvectors optimal - Buhrman, Miltersen, et al. - 2002
34	The spatial complexity of oblivious k-probe hash functions - Schmidt, Siegel - 1990
21	Low redundancy in static dictionaries with O(1) worst case lookup time - Pagh - 1999
8	Natural bounded concentrators - Morgenstern - 1995