Revisiting the COUNTER algorithms for list update

DOI10.1016/S0020-0190(97)00160-9zbMATH Open1337.68287MaRDI QIDQ287261FDOQ287261

Authors: Susanne Albers, Michael Mitzenmacher 

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• Randomized competitive algorithms for the list update problem
• scientific article
• A new lower bound for the list update problem in the partial cost model
• The list update problem: Improved bounds for the counter scheme
• Two results on the list update problem

zbMATH Keywords

data structuresrandomized algorithmslist updateon-line algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• A locally adaptive data compression scheme
• On the power of randomization in on-line algorithms
• Randomized competitive algorithms for the list update problem
• Title not available (Why is that?)
• A combined BIT and TIMESTAMP algorithm for the list update problem
• Off-line algorithms for the list update problem

Cited In (5)

• List update with probabilistic locality of reference
• List Update with Locality of Reference
• A combined BIT and TIMESTAMP algorithm for the list update problem
• A new lower bound for the list update problem in the partial cost model
• A Survey of Algorithms and Models for List Update

This page was built for publication: Revisiting the COUNTER algorithms for list update

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287261)