Lower bounds on simple hash table operations?
The best known lower bounds are discussed in Thorup's "Mihai Pǎtraşcu: Obituary and Open Problems", and none preclude deterministic amortized constant-time operations.