Optimal space distributed move-to-front lists

DOI10.1145/112600.112607MaRDI QIDQ5255807zbMATH OpenOpenAlexFDO

Authors Fotios Zaharoglou, Michael Saks

Publication date 19 June 2015

Published in Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/112600.112607

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(1)

• Towards a practical snapshot algorithm

This page was built for publication: Optimal space distributed move-to-front lists

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