Dynamic bounds for linear and uniform probing with insertions and deletions
Determine whether linear probing or uniform probing, in open addressing without reordering that supports both insertions and deletions over an infinite time horizon, achieve expected insertion time, search probe complexity, or amortized probe complexity that are bounded solely as a function of δ^{-1}.
References
One can also extend the study of open-addressing without reordering to settings that support both insertions and deletions over an infinite time horizon . In this setting, even very basic schemes such as linear probing and uniform probing have resisted analysis---it is not known whether either scheme achieves expected insertion times, probe complexities, or amortized probe complexities that even bounded as a function of $\delta{-1}$.