William K. Moses Jr.

Amanda Redlich

Frederick Stock

CoRR, April, 2025

Brief Announcement: Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents.

[BibT_eX]

[DOI]

Amanda Redlich

Frederick Stock

Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

2024

Awake Complexity of Distributed Minimum Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2024

Time- and Communication-Efficient Overlay Network Construction via Gossip.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd.

[BibT_eX]

[DOI]

Amanda Redlich

Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Towards Communication-Efficient Peer-To-Peer Networks.

[BibT_eX]

[DOI]

Khalid Hourani

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Efficient live exploration of a dynamic ring with mobile robots.

[BibT_eX]

[DOI]

Subhrangsu Mandal

Theor. Comput. Sci., November, 2023

Distributed MIS in O(log log n) Awake Complexity.

[BibT_eX]

[DOI]

Fabien Dufoulon

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022

Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds.

[BibT_eX]

[DOI]

CoRR, 2022

Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity.

[BibT_eX]

[DOI]

Fabien Dufoulon

CoRR, 2022

An Almost Singularly Optimal Asynchronous Distributed MST Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Dispersion of Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation.

[BibT_eX]

[DOI]

Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

2021

Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Deterministic protocols in the SINR model without knowledge of coordinates.

[BibT_eX]

[DOI]

Shailesh Vaya

J. Comput. Syst. Sci., 2021

Singularly Near Optimal Leader Election in Asynchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Efficient Deterministic Leader Election for Programmable Matter.

[BibT_eX]

[DOI]

Fabien Dufoulon

Shay Kutten

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Byzantine Dispersion on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

2020

Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots.

[BibT_eX]

[DOI]

CoRR, 2020

Singularly Optimal Randomized Leader Election.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2020

Live Exploration with Mobile Robots in a Dynamic Ring, Revisited.

[BibT_eX]

[DOI]

Subhrangsu Mandal

Proceedings of the Algorithms for Sensor Systems, 2020

2019

Dispersion of Mobile Robots: The Power of Randomness.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

Deterministic Leader Election in Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

Deterministic Dispersion of Mobile Robots in Dynamic Rings.

[BibT_eX]

[DOI]

Arvind Krishna Sridhar

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

Achieving Dilution without Knowledge of Coordinates in the SINR Model.

[BibT_eX]

[DOI]

Shailesh Vaya

CoRR, 2017

Deterministic Backbone Creation in an SINR Network without Knowledge of Location.

[BibT_eX]

[DOI]

Dariusz R. Kowalski

Shailesh Vaya

CoRR, 2017

2016

Balanced Allocation: Patience is not a Virtue.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2011

Rational Secret Sharing with Honest Players over an Asynchronous Channel.

[BibT_eX]

[DOI]

C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2011

Rational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security

[BibT_eX]

[DOI]