Revisiting the COUNTER algorithms for list update

DOI10.1016/S0020-0190(97)00160-9zbMath1337.68287MaRDI QIDQ287261

Susanne Albers, Michael Mitzenmacher

Publication date: 26 May 2016

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

zbMATH Keywords

data structureson-line algorithmsrandomized algorithmslist update

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A combined BIT and TIMESTAMP algorithm for the list update problem
• On the power of randomization in on-line algorithms
• Randomized competitive algorithms for the list update problem
• Off-line algorithms for the list update problem
• A locally adaptive data compression scheme

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