Revisiting the COUNTER algorithms for list update
From MaRDI portal
Publication:287261
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
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)
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)