Sciweavers

80
Voted
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
14 years 8 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri