Peter Robinson

121 papers A* 22A 15B 12C 3Misc 4Journal 59Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	C	`ed.`	Stabilization, Safety, and Security of Distributed Systems - 27th International Symposium, SSS 2025, Kathmandu, Nepal, October 9-11, 2025, Proceedings SSS Silvia Bonomi, Partha Sarathi Mandal, Peter Robinson, Gokarna Sharma, Sébastien Tixeuil
2026	J	`jnl`	The Quantum Message Complexity of Distributed Wake-Up with Advice. CoRR Peter Robinson, Ming Ming Tan
2025	B	`conf`	Brief Announcement: Perfect Matching with Few Link Activations. SIROCCO Hugo Mirault, Peter Robinson, Ming Ming Tan, Xianbin Zhu
2025	A*	`conf`	Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up. PODC Peter Robinson, Ming Ming Tan
2025	A*	`conf`	Brief Announcement: Towards Energy-Efficient Distributed Agreement. PODC Hugo Mirault, Peter Robinson
2025	J	`jnl`	Deterministic Lower Bounds for CoRR Peter Robinson, Ming Ming Tan
2025	J	`jnl`	Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model. CoRR Peter Robinson, Xianbin Zhu
2025	A*	`conf`	Message Optimality and Message-Time Trade-offs for APSP and Beyond. PODC Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
2025	J	`jnl`	Message Optimality and Message-Time Trade-offs for APSP and Beyond. CoRR Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
2025	J	`jnl`	Perfect Matching with Few Link Activations. CoRR Hugo Mirault, Peter Robinson, Ming Ming Tan, Xianbin Zhu
2025	Misc	`ed.`	Proceedings of the 26th International Conference on Distributed Computing and Networking, ICDCN 2025, Hyderabad, India, January 4-7, 2025 ICDCN Amos Korman, Sandip Chakraborty, Sathya Peri, Chiara Boldrini, Peter Robinson
2025	J	`jnl`	Tight bounds on the message complexity of distributed tree verification. Distributed Comput. Shay Kutten, Peter Robinson, Ming Ming Tan
2025	B	`conf`	Time-Optimal and Energy-Efficient Deterministic Consensus. OPODIS Shachar Meir, Hugo Mirault, David Peleg, Peter Robinson
2025	J	`jnl`	Towards Energy-Efficient Distributed Agreement. CoRR Hugo Mirault, Peter Robinson
2024	A	`conf`	Dynamic Maximal Matching in Clique Networks. ITCS Minming Li, Peter Robinson, Xianbin Zhu
2024	J	`jnl`	Dynamic Maximal Matching in Clique Networks. CoRR Minming Li, Peter Robinson, Xianbin Zhu
2024	J	`jnl`	Rise and Shine Efficiently! The Complexity of Adversarial Wake-up in Asynchronous Networks. CoRR Peter Robinson, Ming Ming Tan
2024	B	`conf`	Sparse Spanners with Small Distance and Congestion Stretches. SPAA Costas Busch, Dariusz R. Kowalski, Peter Robinson
2024	A	`conf`	The Message Complexity of Distributed Graph Optimization. ITCS Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
2024	B	`conf`	The Singular Optimality of Distributed Computation in LOCAL. OPODIS Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2024	J	`jnl`	The Singular Optimality of Distributed Computation in LOCAL. CoRR Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2024	J	`jnl`	Tight Bounds on the Message Complexity of Distributed Tree Verification. CoRR Shay Kutten, Peter Robinson, Ming Ming Tan
2023	A*	`conf`	Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? PODC Peter Robinson
2023	A	`conf`	Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems. DISC Peter Robinson
2023	A*	`conf`	Improved Tradeoffs for Leader Election. PODC Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu
2023	J	`jnl`	Improved Tradeoffs for Leader Election. CoRR Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu
2023	J	`jnl`	Leader Election in Well-Connected Graphs. Algorithmica Seth Gilbert, Peter Robinson, Suman Sourav
2023	J	`jnl`	The Message Complexity of Distributed Graph Optimization. CoRR Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
2023	B	`conf`	Tight Bounds on the Message Complexity of Distributed Tree Verification. OPODIS Shay Kutten, Peter Robinson, Ming Ming Tan
2022	A	`conf`	Awake-Efficient Distributed Algorithms for Maximal Independent Set. ICDCS Khalid Hourani, Gopal Pandurangan, Peter Robinson
2022	A	`conf`	Byzantine-Resilient Counting in Networks. ICDCS Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
2022	J	`jnl`	Byzantine-Resilient Counting in Networks. CoRR Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
2022	J	`jnl`	Latency, capacity, and distributed minimum spanning trees. J. Comput. Syst. Sci. John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav
2022	J	`jnl`	What Can We Compute in a Single Round of the Congested Clique? CoRR Peter Robinson
2021	A*	`conf`	Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. SODA Peter Robinson
2021	A*	`conf`	Can We Break Symmetry with o(m) Communication? PODC Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
2021	J	`jnl`	Can We Break Symmetry with o(m) Communication? CoRR Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
2021	J	`jnl`	Network Size Estimation in Small-World Networks under Byzantine Faults. CoRR Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
2021	J	`jnl`	On the Distributed Complexity of Large-Scale Graph Computations. ACM Trans. Parallel Comput. Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2021	J	`jnl`	Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. CoRR Christian Konrad, Peter Robinson, Viktor Zamaraev
2021	J	`jnl`	The Complexity of Symmetry Breaking in Massive Graphs. CoRR Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
2020	J	`jnl`	A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. ACM Trans. Algorithms Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2020	J	`jnl`	Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. CoRR Peter Robinson
2020	A*	`conf`	DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. PODC Seth Gilbert, Gopal Pandurangan, Peter Robinson, Amitabh Trehan
2020	A	`conf`	Latency, Capacity, and Distributed Minimum Spanning Tree†. ICDCS John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav
2020	J	`jnl`	The complexity of leader election in diameter-two networks. Distributed Comput. Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
2019	J	`jnl`	Latency, Capacity, and Distributed MST. CoRR John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav
2019	J	`jnl`	Leader Election in Well-Connected Graphs. CoRR Seth Gilbert, Peter Robinson, Suman Sourav
2019	A	`conf`	Network Size Estimation in Small-World Networks Under Byzantine Faults. IPDPS Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
2019	Misc	`conf`	On the hardness of the strongly dependent decision problem. ICDCN Martin Biely, Peter Robinson
2019	A*	`ed.`	Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. PODC Peter Robinson, Faith Ellen
2019	J	`jnl`	Slow Links, Fast Links, and the Cost of Gossip. IEEE Trans. Parallel Distributed Syst. Suman Sourav, Peter Robinson, Seth Gilbert
2019	A	`conf`	The Complexity of Symmetry Breaking in Massive Graphs. DISC Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
2018	B	`conf`	Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. SPAA Peter Robinson, Christian Scheideler, Alexander Setzer
2018	J	`jnl`	Breaking the Ω̃(√n) Barrier: Fast Consensus under a Late Adversary. CoRR Peter Robinson, Christian Scheideler, Alexander Setzer
2018	J	`jnl`	Fast Distributed Algorithms for Connectivity and MST in Large Graphs. ACM Trans. Parallel Comput. Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2018	A	`conf`	Fault-Tolerant Consensus with an Abstract MAC Layer. DISC Calvin Newport, Peter Robinson
2018	J	`jnl`	Fault-Tolerant Consensus with an Abstract MAC Layer. CoRR Calvin C. Newport, Peter Robinson
2018	J	`jnl`	Gracefully degrading consensus and Theor. Comput. Sci. Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
2018	A*	`conf`	Leader Election in Well-Connected Graphs. PODC Seth Gilbert, Peter Robinson, Suman Sourav
2018	B	`conf`	On the Distributed Complexity of Large-Scale Graph Computations. SPAA Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2018	J	`jnl`	On the Hardness of the Strongly Dependent Decision Problem. CoRR Martin Biely, Peter Robinson
2018	A*	`conf`	Session details: Session 1D: Graph Algorithms. PODC Peter Robinson
2018	A	`conf`	Slow Links, Fast Links, and the Cost of Gossip. ICDCS Suman Sourav, Peter Robinson, Seth Gilbert
2018	J	`jnl`	Special Issue of ICDCN 2016 (Distributed Computing Track). Theor. Comput. Sci. Gopal Pandurangan, Peter Robinson
2018	Misc	`conf`	The Complexity of Leader Election: A Chasm at Diameter Two. ICDCN Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
2018	J	`jnl`	The Complexity of Leader Election: A Chasm at Diameter Two. CoRR Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
2018	J	`jnl`	The Distributed Minimum Spanning Tree Problem. Bull. EATCS Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2017	A*	`conf`	A time- and message-optimal distributed algorithm for minimum spanning trees. STOC Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2017	A*	`conf`	Brief Announcement: Gossiping with Latencies. PODC Seth Gilbert, Peter Robinson, Suman Sourav
2017	A*	`conf`	Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. PODC Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
2017	A	`conf`	Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. DISC Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
2017	J	`jnl`	Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. CoRR Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
2016	J	`jnl`	A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. CoRR Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2016	J	`jnl`	DEX: self-healing expanders. Distributed Comput. Gopal Pandurangan, Peter Robinson, Amitabh Trehan
2016	J	`jnl`	Distributed Algorithmic Foundations of Dynamic Networks. SIGACT News John Augustine, Gopal Pandurangan, Peter Robinson
2016	J	`jnl`	Efficient computation of sparse structures. Random Struct. Algorithms David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
2016	B	`conf`	Fast Distributed Algorithms for Connectivity and MST in Large Graphs. SPAA Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2016	J	`jnl`	Gossiping with Latencies. CoRR Seth Gilbert, Peter Robinson, Suman Sourav
2016	J	`jnl`	Tight Bounds for Distributed Graph Computations. CoRR Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2015	J	`jnl`	Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRR Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2015	A*	`conf`	Distributed Computation of Large-scale Graph Problems. SODA Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
2015	J	`jnl`	Distributed agreement in dynamic peer-to-peer networks. J. Comput. Syst. Sci. John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
2015	A*	`conf`	Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. FOCS John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, Eli Upfal
2015	A	`conf`	Fast Byzantine Leader Election in Dynamic Networks. DISC John Augustine, Gopal Pandurangan, Peter Robinson
2015	—	`conf`	Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. NETYS Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
2015	J	`jnl`	Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. CoRR Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
2015	J	`jnl`	On the Complexity of Universal Leader Election. J. ACM Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2015	J	`jnl`	Sublinear bounds for randomized leader election. Theor. Comput. Sci. Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2014	A*	`conf`	Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures. PODC Manfred Schwarz, Kyrill Winkler, Ulrich Schmid, Martin Biely, Peter Robinson
2014	A	`conf`	DEX: Self-Healing Expanders. IPDPS Gopal Pandurangan, Peter Robinson, Amitabh Trehan
2014	A	`conf`	Distributed Symmetry Breaking in Hypergraphs. DISC Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
2014	J	`jnl`	Distributed Symmetry Breaking in Hypergraphs. CoRR Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
2014	J	`jnl`	The Generalized Loneliness Detector and Weak System Models for k-Set Agreement. IEEE Trans. Parallel Distributed Syst. Martin Biely, Peter Robinson, Ulrich Schmid
2013	—	`conf`	Efficient Computation of Balanced Structures. ICALP (2) David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
2013	A*	`conf`	Fast byzantine agreement in dynamic networks. PODC John Augustine, Gopal Pandurangan, Peter Robinson
2013	A*	`conf`	On the complexity of universal leader election. PODC Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2013	—	`conf`	Robust Leader Election in a Fast-Changing World. FOMC John Augustine, Tejas Kulkarni, Paresh Nakhe, Peter Robinson
2013	J	`jnl`	Storage and Search in Dynamic Peer-to-Peer Networks CoRR John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
2013	B	`conf`	Storage and search in dynamic peer-to-peer networks. SPAA John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
2013	Misc	`conf`	Sublinear Bounds for Randomized Leader Election. ICDCN Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2013	J	`jnl`	The Distributed Complexity of Large-scale Graph Processing. CoRR Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
2012	J	`jnl`	Agreement in Directed Dynamic Networks CoRR Martin Biely, Peter Robinson, Ulrich Schmid
2012	B	`conf`	Agreement in Directed Dynamic Networks. SIROCCO Martin Biely, Peter Robinson, Ulrich Schmid
2012	J	`jnl`	Self-healing Deterministic Expanders CoRR Gopal Pandurangan, Peter Robinson, Amitabh Trehan
2012	J	`jnl`	Sublinear Bounds for Randomized Leader Election CoRR Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2012	A*	`conf`	Towards robust and efficient computation in dynamic peer-to-peer networks. SODA John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
2011	J	`jnl`	Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems CoRR Martin Biely, Peter Robinson, Ulrich Schmid
2011	B	`conf`	Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. OPODIS Martin Biely, Peter Robinson, Ulrich Schmid
2011	A*	`conf`	Easy impossibility proofs for k-set agreement in message passing systems. PODC Martin Biely, Peter Robinson, Ulrich Schmid
2011	—	`conf`	Optimal regional consecutive leader election in mobile ad-hoc networks. FOMC Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
2011	J	`jnl`	Solving k-Set Agreement with Stable Skeleton Graphs CoRR Martin Biely, Peter Robinson, Ulrich Schmid
2011	—	`conf`	Solving k-Set Agreement with Stable Skeleton Graphs. IPDPS Workshops Martin Biely, Peter Robinson, Ulrich Schmid
2011	J	`jnl`	The Asynchronous Bounded-Cycle model. Theor. Comput. Sci. Peter Robinson, Ulrich Schmid
2011	J	`jnl`	Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks CoRR John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
2010	C	`conf`	Brief Announcement: Regional Consecutive Leader Election in Mobile Ad-Hoc Networks. ALGOSENSORS Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
2010	—	`conf`	Regional consecutive leader election in mobile ad-hoc networks. DIALM-PODC Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
2009	A	`conf`	Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing ( DISC Martin Biely, Peter Robinson, Ulrich Schmid
2009	B	`conf`	Weak Synchrony Models and Failure Detectors for Message Passing ( OPODIS Martin Biely, Peter Robinson, Ulrich Schmid
2008	C	`conf`	The Asynchronous Bounded-Cycle Model. SSS Peter Robinson, Ulrich Schmid
2008	A*	`conf`	The asynchronous bounded-cycle model. PODC Peter Robinson, Ulrich Schmid