Abstract: This paper considers the basic question of how strong of a probabilistic guarantee can a hash table, storing $n(1+\Theta(1))\log n$-bit key/value pairs ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results