Random Node-Asynchronous Updates on Graphs

DOI10.1109/TSP.2019.2910485OpenAlexW2941414022WikidataQ127986237 ScholiaQ127986237MaRDI QIDQ5238822

P. P. Vaidyanathan, Oguzhan Teke

Publication date: 28 October 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2019.2910485

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Distributed algorithms for random graphs 👍 👎
• Random asynchronous iterations in distributed coordination algorithms 👍 👎
• Asynchronous deterministic rendezvous in graphs 👍 👎
• Asynchronous rumor spreading on random graphs 👍 👎
• Asynchronous Gossip-Based Random Projection Algorithms Over Networks 👍 👎
• Randomized protocols for asynchronous consensus 👍 👎
• On the Use of Randomness in Local Distributed Graph Algorithms 👍 👎
• Local Update Algorithms for Random Graphs 👍 👎
• Mathematical Foundations of Computer Science 2005 👍 👎

This page was built for publication: Random Node-Asynchronous Updates on Graphs

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