A faster exact-counting protocol for anonymous dynamic networks

DOI10.1007/S00453-017-0367-4MaRDI QIDQ1755728zbMATH OpenOpenAlexFDO

Authors Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro

Publication date 11 January 2019

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-017-0367-4

zbMATH Keywords

distributed algorithmscountingtime-varying graphsanonymous dynamic networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Network protocols (68M12)

Recommendations

• A faster counting protocol for anonymous dynamic networks
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• Polynomial anonymous dynamic distributed computing without a unique leader
• Naming and counting in anonymous unknown dynamic networks

Cites work

• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• A faster counting protocol for anonymous dynamic networks
• An early-stopping protocol for computing aggregate functions in Sensor Networks
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Causality, influence, and computation in possibly disconnected synchronous dynamic networks
• Distributed computation in dynamic networks
• Exact mixing times for random walks on trees
• Fault-tolerant aggregation: flow-updating meets mass-distribution
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Naming and counting in anonymous unknown dynamic networks
• Non trivial computations in anonymous dynamic networks
• On Distributed Averaging Algorithms and Quantization Effects
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

Cited in

(7)

• A distributed counting architecture for exploring the structure of anonymous active-passive networks
• Polynomial anonymous dynamic distributed computing without a unique leader
• A faster counting protocol for anonymous dynamic networks
• Sublinear algorithms in \(T\)-interval dynamic networks
• Polynomial anonymous dynamic distributed computing without a unique leader
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations

This page was built for publication: A faster exact-counting protocol for anonymous dynamic networks

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