Sciweavers

21 search results - page 5 / 5
» coco 2003
Sort
View
163
Voted
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 12 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