Efficient decentralized algorithms for the distributed trigger counting problem

DOI10.1007/S00224-012-9405-4zbMATH Open1253.68058OpenAlexW1964459937MaRDI QIDQ693074FDOQ693074

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

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

Recommendations

• An inherent bottleneck in distributed counting
• Efficient threshold detection in a distributed environment (extended abstract)
• Randomized algorithms for tracking distributed count, frequencies, and ranks
• Distributed convex thresholding
• Distributed Disaster Disclosure

zbMATH Keywords

randomized algorithmdistributed trigger countingmessage complexity

Mathematics Subject Classification ID

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

Cites Work

• Complexity of network synchronization
• Title not available (Why is that?)
• Probability and Computing
• Title not available (Why is that?)
• Local management of a global resource in a communication network
• Controller and estimator for dynamic networks
• Title not available (Why is that?)
• Distributed Disaster Disclosure
• New Bounds for the Controller Problem
• Efficient threshold detection in a distributed environment
• Efficient decentralized algorithms for the distributed trigger counting problem

Cited In (3)

• Efficient decentralized algorithms for the distributed trigger counting problem
• An inherent bottleneck in distributed counting
• Distributed Disaster Disclosure

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

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