Efficient threshold detection in a distributed environment

DOI10.1145/1835698.1835742zbMath1315.68149OpenAlexW2016657111MaRDI QIDQ5176197

Yuval Emek, Amos Korman

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

message complexitythreshold detectiontransmission complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model ⋮ Efficient decentralized algorithms for the distributed trigger counting problem ⋮ Unnamed Item

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Efficient threshold detection in a distributed environment