MAX registers, counters, and monotone circuits

DOI10.1145/1582716.1582728zbMATH Open1291.68039OpenAlexW2019354300MaRDI QIDQ5170299FDOQ5170299

Authors: James Aspnes, Hagit Attiya, Keren Censor-Hillel 

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Recommendations

• Polylogarithmic concurrent data structures from monotone circuits
• Consensus with max registers
• Complexity tradeoffs for read and update operations
• Concurrent counting
• Concurrent counting (extended abstract)

zbMATH Keywords

distributed computingshared memorymonotone circuitscountersmax registers

Mathematics Subject Classification ID

Distributed systems (68M14)

Cited In (6)

• Asynchronous reconfiguration with Byzantine failures
• The CB tree: a practical concurrent self-adjusting search tree
• Polylogarithmic concurrent data structures from monotone circuits
• Consensus with max registers
• Long-lived counters with polylogarithmic amortized step complexity
• Asynchronous reconfiguration with Byzantine failures

This page was built for publication: MAX registers, counters, and monotone circuits

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