Efficient decentralized algorithms for the distributed trigger counting problem

DOI10.1007/s00224-012-9405-4zbMath1253.68058OpenAlexW1964459937MaRDI QIDQ693074

Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal, Vijay K. Garg

Publication date: 7 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9405-4

zbMATH Keywords

randomized algorithmdistributed trigger countingmessage complexity

Mathematics Subject Classification ID

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

Related Items (1)

Efficient decentralized algorithms for the distributed trigger counting problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient decentralized algorithms for the distributed trigger counting problem
• Distributed Disaster Disclosure
• New Bounds for the Controller Problem
• Complexity of network synchronization
• Local management of a global resource in a communication network
• Efficient threshold detection in a distributed environment
• Controller and estimator for dynamic networks
• Probability and Computing

This page was built for publication: Efficient decentralized algorithms for the distributed trigger counting problem