On the Space Complexity of Set Agreement

DOI10.1145/2767386.2767406zbMath1333.68053arXiv1505.02690OpenAlexW1984644859MaRDI QIDQ2796262

Eric Ruppert, Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.02690

zbMATH Keywords

space complexity\(k\)-set agreement\(m\)-obstruction-freedom

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (4)

Progress-Space Tradeoffs in Single-Writer Memory Implementations ⋮ On the uncontended complexity of anonymous agreement ⋮ Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers ⋮ Unnamed Item

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: On the Space Complexity of Set Agreement