Sciweavers

CCCG
2010
14 years 29 days ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...