Re:Hash tables with O(1) worst-case lookup and space efficie...
by ckuehne on Sunday February 20, 2011 @12:57PM
(#2242486)
Well, there is perfect hashing [1]. Of course it does only work under several assumptions. And you pay for it in terms of time it takes to construct the hash function or in terms of space.
[1] http://en.wikipedia.org/wiki/Perfect_hash_function