Flemming Friche Rodler

Suggest Changes
Learn More
We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect(More)
  • 1