Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (OPODIS, 2009)

Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (DISC, 2009)

Brief Announcement: Regional Consecutive Leader Election in Mobile Ad-Hoc Networks. - Hyun Chul Chung; Peter Robinson 002; Jennifer L. Welch (ALGOSENSORS, 2010)

Regional consecutive leader election in mobile ad-hoc networks. - Hyun Chul Chung; Peter Robinson 002; Jennifer L. Welch (DIALM-PODC, 2010)

Optimal regional consecutive leader election in mobile ad-hoc networks. - Hyun Chul Chung; Peter Robinson 002; Jennifer L. Welch (FOMC, 2011)

Solving k-Set Agreement with Stable Skeleton Graphs. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (IPDPS Workshops, 2011)

Easy impossibility proofs for k-set agreement in message passing systems. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (PODC, 2011)

The Asynchronous Bounded-Cycle model. - Peter Robinson 002; Ulrich Schmid 001 (Theor. Comput. Sci., 2011)

Agreement in Directed Dynamic Networks. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (SIROCCO, 2012)

Towards robust and efficient computation in dynamic peer-to-peer networks. - John Augustine; Gopal Pandurangan; Peter Robinson 002; Eli Upfal (SODA, 2012)

Self-healing Deterministic Expanders - Gopal Pandurangan; Peter Robinson 002; Amitabh Trehan (CoRR, 2012)

Efficient Computation of Balanced Structures. - David G. Harris 001; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Aravind Srinivasan (ICALP (2), 2013)

Fast byzantine agreement in dynamic networks. - John Augustine; Gopal Pandurangan; Peter Robinson 002 (PODC, 2013)

Storage and search in dynamic peer-to-peer networks. - John Augustine; Anisur Rahaman Molla; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Eli Upfal (SPAA, 2013)

Robust Leader Election in a Fast-Changing World. - John Augustine; Tejas Kulkarni; Paresh Nakhe; Peter Robinson 002 (FOMC, 2013)

The Distributed Complexity of Large-scale Graph Processing. - Hartmut Klauck; Danupon Nanongkai; Gopal Pandurangan; Peter Robinson 002 (CoRR, 2013)

Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures. - Manfred Schwarz; Kyrill Winkler; Ulrich Schmid 001; Martin Biely; Peter Robinson 002 (PODC, 2014)

Distributed Symmetry Breaking in Hypergraphs. - Shay Kutten; Danupon Nanongkai; Gopal Pandurangan; Peter Robinson 002 (DISC, 2014)

The Generalized Loneliness Detector and Weak System Models for k-Set Agreement. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (IEEE Trans. Parallel Distributed Syst., 2014)

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. - John Augustine; Gopal Pandurangan; Peter Robinson 002; Scott T. Roche; Eli Upfal (FOCS, 2015)

Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001; Manfred Schwarz; Kyrill Winkler (NETYS, 2015)

Distributed Computation of Large-scale Graph Problems. - Hartmut Klauck; Danupon Nanongkai; Gopal Pandurangan; Peter Robinson 002 (SODA, 2015)

Fast Byzantine Leader Election in Dynamic Networks. - John Augustine; Gopal Pandurangan; Peter Robinson 002 (DISC, 2015)

Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (CoRR, 2015)

On the Complexity of Universal Leader Election. - Shay Kutten; Gopal Pandurangan; David Peleg; Peter Robinson 002; Amitabh Trehan (J. ACM, 2015)

Distributed agreement in dynamic peer-to-peer networks. - John Augustine; Gopal Pandurangan; Peter Robinson 002; Eli Upfal (J. Comput. Syst. Sci., 2015)

Sublinear bounds for randomized leader election. - Shay Kutten; Gopal Pandurangan; David Peleg; Peter Robinson 002; Amitabh Trehan (Theor. Comput. Sci., 2015)

Gossiping with Latencies. - Seth Gilbert; Peter Robinson 002; Suman Sourav (CoRR, 2016)

Tight Bounds for Distributed Graph Computations. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (CoRR, 2016)

DEX: self-healing expanders. - Gopal Pandurangan; Peter Robinson 002; Amitabh Trehan (Distributed Comput., 2016)

Efficient computation of sparse structures. - David G. Harris 001; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Aravind Srinivasan (Random Struct. Algorithms, 2016)

Distributed Algorithmic Foundations of Dynamic Networks. - John Augustine; Gopal Pandurangan; Peter Robinson 002 (SIGACT News, 2016)

Brief Announcement: Gossiping with Latencies. - Seth Gilbert; Peter Robinson 002; Suman Sourav (PODC, 2017)

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. - Shreyas Pai; Gopal Pandurangan; Sriram V. Pemmaraju; Talal Riaz; Peter Robinson 002 (PODC, 2017)

Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. - Shreyas Pai; Gopal Pandurangan; Sriram V. Pemmaraju; Talal Riaz; Peter Robinson 002 (DISC, 2017)

The Complexity of Leader Election: A Chasm at Diameter Two. - Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson 002 (ICDCN, 2018)

Session details: Session 1D: Graph Algorithms. - Peter Robinson 002 (PODC, 2018)

Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. - Peter Robinson 002; Christian Scheideler; Alexander Setzer (SPAA, 2018)

Fault-Tolerant Consensus with an Abstract MAC Layer. - Calvin Newport; Peter Robinson 002 (DISC, 2018)

Breaking the Ω̃(√n) Barrier: Fast Consensus under a Late Adversary. - Peter Robinson 002; Christian Scheideler; Alexander Setzer (CoRR, 2018)

The Distributed Minimum Spanning Tree Problem. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (Bull. EATCS, 2018)

Gracefully degrading consensus and k-set agreement in directed dynamic networks. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001; Manfred Schwarz; Kyrill Winkler (Theor. Comput. Sci., 2018)

Special Issue of ICDCN 2016 (Distributed Computing Track). - Gopal Pandurangan; Peter Robinson 002 (Theor. Comput. Sci., 2018)

Fast Distributed Algorithms for Connectivity and MST in Large Graphs. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (ACM Trans. Parallel Comput., 2018)

On the hardness of the strongly dependent decision problem. - Martin Biely; Peter Robinson 002 (ICDCN, 2019)

Network Size Estimation in Small-World Networks Under Byzantine Faults. - Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson 002 (IPDPS, 2019)

The Complexity of Symmetry Breaking in Massive Graphs. - Christian Konrad 001; Sriram V. Pemmaraju; Talal Riaz; Peter Robinson 002 (DISC, 2019)

Latency, Capacity, and Distributed MST. - John Augustine; Seth Gilbert; Fabian Kuhn; Peter Robinson 002; Suman Sourav (CoRR, 2019)

Slow Links, Fast Links, and the Cost of Gossip. - Suman Sourav; Peter Robinson 002; Seth Gilbert (IEEE Trans. Parallel Distributed Syst., 2019)

Latency, Capacity, and Distributed Minimum Spanning Tree†. - John Augustine; Seth Gilbert; Fabian Kuhn; Peter Robinson 002; Suman Sourav (ICDCS, 2020)

DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. - Seth Gilbert; Gopal Pandurangan; Peter Robinson 002; Amitabh Trehan (PODC, 2020)

The complexity of leader election in diameter-two networks. - Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson 002 (Distributed Comput., 2020)

A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (ACM Trans. Algorithms, 2020)

Can We Break Symmetry with o(m) Communication? - Shreyas Pai; Gopal Pandurangan; Sriram V. Pemmaraju; Peter Robinson 002 (PODC, 2021)

Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. - Peter Robinson 002 (SODA, 2021)

Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. - Christian Konrad 001; Peter Robinson 002; Viktor Zamaraev (CoRR, 2021)

On the Distributed Complexity of Large-Scale Graph Computations. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (ACM Trans. Parallel Comput., 2021)

Byzantine-Resilient Counting in Networks. - Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson 002 (ICDCS, 2022)

Awake-Efficient Distributed Algorithms for Maximal Independent Set. - Khalid Hourani; Gopal Pandurangan; Peter Robinson 002 (ICDCS, 2022)

What Can We Compute in a Single Round of the Congested Clique? - Peter Robinson 002 (CoRR, 2022)

Latency, capacity, and distributed minimum spanning trees. - John Augustine; Seth Gilbert; Fabian Kuhn; Peter Robinson 002; Suman Sourav (J. Comput. Syst. Sci., 2022)

Improved Tradeoffs for Leader Election. - Shay Kutten; Peter Robinson 002; Ming Ming Tan; Xianbin Zhu 002 (PODC, 2023)

Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? - Peter Robinson 002 (PODC, 2023)

Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems. - Peter Robinson 002 (DISC, 2023)

Leader Election in Well-Connected Graphs. - Seth Gilbert; Peter Robinson 002; Suman Sourav (Algorithmica, 2023)

The Message Complexity of Distributed Graph Optimization. - Fabien Dufoulon; Shreyas Pai; Gopal Pandurangan; Sriram V. Pemmaraju; Peter Robinson 002 (ITCS, 2024)

Dynamic Maximal Matching in Clique Networks. - Minming Li; Peter Robinson 002; Xianbin Zhu 002 (ITCS, 2024)

The Singular Optimality of Distributed Computation in LOCAL. - Fabien Dufoulon; Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (OPODIS, 2024)

Sparse Spanners with Small Distance and Congestion Stretches. - Costas Busch; Dariusz R. Kowalski; Peter Robinson 002 (SPAA, 2024)

Rise and Shine Efficiently! The Complexity of Adversarial Wake-up in Asynchronous Networks. - Peter Robinson 002; Ming Ming Tan (CoRR, 2024)

Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up. - Peter Robinson 002; Ming Ming Tan (PODC, 2025)

Message Optimality and Message-Time Trade-offs for APSP and Beyond. - Fabien Dufoulon; Shreyas Pai; Gopal Pandurangan; Sriram V. Pemmaraju; Peter Robinson 002 (PODC, 2025)

Brief Announcement: Towards Energy-Efficient Distributed Agreement. - Hugo Mirault; Peter Robinson 002 (PODC, 2025)

Brief Announcement: Perfect Matching with Few Link Activations. - Hugo Mirault; Peter Robinson 002; Ming Ming Tan; Xianbin Zhu 002 (SIROCCO, 2025)

Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model. - Peter Robinson 002; Xianbin Zhu 002 (CoRR, 2025)

Perfect Matching with Few Link Activations. - Hugo Mirault; Peter Robinson 002; Ming Ming Tan; Xianbin Zhu 002 (CoRR, 2025)

Towards Energy-Efficient Distributed Agreement. - Hugo Mirault; Peter Robinson 002 (CoRR, 2025)

Tight bounds on the message complexity of distributed tree verification. - Shay Kutten; Peter Robinson 002; Ming Ming Tan (Distributed Comput., 2025)

Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model. - Peter Robinson 002; Ming Ming Tan (CoRR, 2025)