Sciweavers

302 search results - page 61 / 61
» A Transformation-Based Approach for Storage Optimization
Sort
View
FOCS
2000
IEEE
15 years 2 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 2 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