Polynomial anonymous dynamic distributed computing without a unique leader

DOI10.4230/LIPIcs.ICALP.2019.147OpenAlexW3197858183MaRDI QIDQ5092352

Miguel A. Mosteiro, Dariusz R. Kowalski

Publication date: 21 July 2022

Full work available at URL: https://augusta.pure.elsevier.com/en/publications/polynomial-anonymous-dynamic-distributed-computing-without-a-uniq

zbMATH Keywords

countingdistributed algorithmsanonymous dynamic networks

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Distributed Averaging in Opinion Dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• A faster exact-counting protocol for anonymous dynamic networks
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
• Distributed computation in dynamic networks via random walks
• Distributed computation in dynamic networks
• Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism
• Epidemic Spreading With External Agents
• On the Role of Mobility for Multimessage Gossip
• Naming and Counting in Anonymous Unknown Dynamic Networks
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Gossiping With Multiple Messages
• Fast Distributed Algorithms for Computing Separable Functions
• On Distributed Averaging Algorithms and Quantization Effects
• Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
• Non Trivial Computations in Anonymous Dynamic Networks

This page was built for publication: Polynomial anonymous dynamic distributed computing without a unique leader