4 citations · 8 across the 4 of their papers we have counts for
1 paper · 1 filter
D. Belazzougui, A. C. Kaporis, P. G. Spirakis
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only n1+δ bits of memory, for any constant δ>0. The input keys are random wrt a…