Sciweavers

COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 9 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen