Lower bounds for predecessor searching in the cell probe model

Pranab Sen. Lower bounds for predecessor searching in the cell probe model. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark. pages 73-83, IEEE Computer Society, 2003. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.