Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
From MaRDI portal
Publication:5002846
DOI10.4230/LIPIcs.ICALP.2018.156zbMath1473.68122arXiv1707.04282OpenAlexW2964260986MaRDI QIDQ5002846
Miguel A. Mosteiro, Dariusz R. Kowalski
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1707.04282
Related Items (4)
Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Distributed Averaging in Opinion Dynamics ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Polynomial anonymous dynamic distributed computing without a unique leader
Cites Work
- Unnamed Item
- Unnamed Item
- Initializing sensor networks of non-uniform density in the weak sensor model
- Computing Boolean functions on anonymous networks
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- 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
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- 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
- Non Trivial Computations in Anonymous Dynamic Networks
This page was built for publication: Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
