Peter Robinson

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 59

Top Venues

Publications

Costas Busch, Dariusz R. Kowalski, Peter Robinson
Sparse Spanners with Small Distance and Congestion Stretches. SPAA (2024)
Minming Li, Peter Robinson, Xianbin Zhu
Dynamic Maximal Matching in Clique Networks. ITCS (2024)
Shay Kutten, Peter Robinson, Ming Ming Tan
Tight Bounds on the Message Complexity of Distributed Tree Verification. CoRR (2024)
Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
The Message Complexity of Distributed Graph Optimization. ITCS (2024)
Minming Li, Peter Robinson, Xianbin Zhu
Dynamic Maximal Matching in Clique Networks. CoRR (2024)
Seth Gilbert, Peter Robinson, Suman Sourav
Leader Election in Well-Connected Graphs. Algorithmica 85 (4) (2023)
Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu
Improved Tradeoffs for Leader Election. CoRR (2023)
Shay Kutten, Peter Robinson, Ming Ming Tan
Tight Bounds on the Message Complexity of Distributed Tree Verification. OPODIS (2023)
Peter Robinson
Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? PODC (2023)
Peter Robinson
Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems. DISC (2023)
Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
The Message Complexity of Distributed Graph Optimization. CoRR (2023)
Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu
Improved Tradeoffs for Leader Election. PODC (2023)
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
Byzantine-Resilient Counting in Networks. ICDCS (2022)
Khalid Hourani, Gopal Pandurangan, Peter Robinson
Awake-Efficient Distributed Algorithms for Maximal Independent Set. ICDCS (2022)
John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav
Latency, capacity, and distributed minimum spanning trees. J. Comput. Syst. Sci. 126 (2022)
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
Byzantine-Resilient Counting in Networks. CoRR (2022)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
On the Distributed Complexity of Large-Scale Graph Computations. ACM Trans. Parallel Comput. 8 (2) (2021)
Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
Can We Break Symmetry with o(m) Communication? PODC (2021)
Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson
Can We Break Symmetry with o(m) Communication? CoRR (2021)
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
Network Size Estimation in Small-World Networks under Byzantine Faults. CoRR (2021)
Christian Konrad, Peter Robinson, Viktor Zamaraev
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. CoRR (2021)
Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
The Complexity of Symmetry Breaking in Massive Graphs. CoRR (2021)
Seth Gilbert, Gopal Pandurangan, Peter Robinson, Amitabh Trehan
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. PODC (2020)
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
The complexity of leader election in diameter-two networks. Distributed Comput. 33 (2) (2020)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. ACM Trans. Algorithms 16 (1) (2020)
John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav
Latency, Capacity, and Distributed Minimum Spanning Tree†. ICDCS (2020)
Seth Gilbert, Peter Robinson, Suman Sourav
Leader Election in Well-Connected Graphs. CoRR (2019)
Suman Sourav, Peter Robinson, Seth Gilbert
Slow Links, Fast Links, and the Cost of Gossip. IEEE Trans. Parallel Distributed Syst. 30 (9) (2019)
Martin Biely, Peter Robinson
On the hardness of the strongly dependent decision problem. ICDCN (2019)
John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav
Latency, Capacity, and Distributed MST. CoRR (2019)
Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
The Complexity of Symmetry Breaking in Massive Graphs. DISC (2019)
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
Network Size Estimation in Small-World Networks Under Byzantine Faults. IPDPS (2019)
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
The Complexity of Leader Election: A Chasm at Diameter Two. ICDCN (2018)
Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
-set agreement in directed dynamic networks. Theor. Comput. Sci. 726 (2018)
Calvin Newport, Peter Robinson
Fault-Tolerant Consensus with an Abstract MAC Layer. DISC (2018)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
On the Distributed Complexity of Large-Scale Graph Computations. SPAA (2018)
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
The Complexity of Leader Election: A Chasm at Diameter Two. CoRR (2018)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. ACM Trans. Parallel Comput. 5 (1) (2018)
Suman Sourav, Peter Robinson, Seth Gilbert
Slow Links, Fast Links, and the Cost of Gossip. ICDCS (2018)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
The Distributed Minimum Spanning Tree Problem. Bull. EATCS 125 (2018)
Martin Biely, Peter Robinson
On the Hardness of the Strongly Dependent Decision Problem. CoRR (2018)
Peter Robinson, Christian Scheideler, Alexander Setzer
Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. SPAA (2018)
Calvin C. Newport, Peter Robinson
Fault-Tolerant Consensus with an Abstract MAC Layer. CoRR (2018)
Gopal Pandurangan, Peter Robinson
Special Issue of ICDCN 2016 (Distributed Computing Track). Theor. Comput. Sci. 709 (2018)
Peter Robinson
Session details: Session 1D: Graph Algorithms. PODC (2018)
Peter Robinson, Christian Scheideler, Alexander Setzer
Breaking the Ω̃(√n) Barrier: Fast Consensus under a Late Adversary. CoRR (2018)
Seth Gilbert, Peter Robinson, Suman Sourav
Leader Election in Well-Connected Graphs. PODC (2018)
Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. CoRR (2017)
Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. DISC (2017)
Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. PODC (2017)
Seth Gilbert, Peter Robinson, Suman Sourav
Brief Announcement: Gossiping with Latencies. PODC (2017)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
A time- and message-optimal distributed algorithm for minimum spanning trees. STOC (2017)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. SPAA (2016)
David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
Efficient computation of sparse structures. Random Struct. Algorithms 49 (2) (2016)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. CoRR (2016)
John Augustine, Gopal Pandurangan, Peter Robinson
Distributed Algorithmic Foundations of Dynamic Networks. SIGACT News 47 (1) (2016)
Gopal Pandurangan, Peter Robinson, Amitabh Trehan
DEX: self-healing expanders. Distributed Comput. 29 (3) (2016)
Seth Gilbert, Peter Robinson, Suman Sourav
Gossiping with Latencies. CoRR (2016)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Tight Bounds for Distributed Graph Computations. CoRR (2016)
Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. CoRR (2015)
Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. NETYS (2015)
John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, Eli Upfal
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. FOCS (2015)
John Augustine, Gopal Pandurangan, Peter Robinson
Fast Byzantine Leader Election in Dynamic Networks. DISC (2015)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRR (2015)
Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
Sublinear bounds for randomized leader election. Theor. Comput. Sci. 561 (2015)
Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
On the Complexity of Universal Leader Election. J. ACM 62 (1) (2015)
Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
Distributed Computation of Large-scale Graph Problems. SODA (2015)
John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
Distributed agreement in dynamic peer-to-peer networks. J. Comput. Syst. Sci. 81 (7) (2015)
Manfred Schwarz, Kyrill Winkler, Ulrich Schmid, Martin Biely, Peter Robinson
Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures. PODC (2014)
Gopal Pandurangan, Peter Robinson, Amitabh Trehan
DEX: Self-Healing Expanders. IPDPS (2014)
Martin Biely, Peter Robinson, Ulrich Schmid
The Generalized Loneliness Detector and Weak System Models for k-Set Agreement. IEEE Trans. Parallel Distributed Syst. 25 (4) (2014)
Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
Distributed Symmetry Breaking in Hypergraphs. DISC (2014)
Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
Distributed Symmetry Breaking in Hypergraphs. CoRR (2014)
John Augustine, Tejas Kulkarni, Paresh Nakhe, Peter Robinson
Robust Leader Election in a Fast-Changing World. FOMC (2013)
David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
Efficient Computation of Balanced Structures. ICALP (2) (2013)
Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
On the complexity of universal leader election. PODC (2013)
John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
Storage and Search in Dynamic Peer-to-Peer Networks CoRR (2013)
John Augustine, Gopal Pandurangan, Peter Robinson
Fast byzantine agreement in dynamic networks. PODC (2013)
Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
Sublinear Bounds for Randomized Leader Election. ICDCN (2013)
Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
The Distributed Complexity of Large-scale Graph Processing. CoRR (2013)
John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
Storage and search in dynamic peer-to-peer networks. SPAA (2013)
Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
Sublinear Bounds for Randomized Leader Election CoRR (2012)
Martin Biely, Peter Robinson, Ulrich Schmid
Agreement in Directed Dynamic Networks. SIROCCO (2012)
Gopal Pandurangan, Peter Robinson, Amitabh Trehan
Self-healing Deterministic Expanders CoRR (2012)
John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
Towards robust and efficient computation in dynamic peer-to-peer networks. SODA (2012)
Martin Biely, Peter Robinson, Ulrich Schmid
Agreement in Directed Dynamic Networks CoRR (2012)
Martin Biely, Peter Robinson, Ulrich Schmid
Easy impossibility proofs for k-set agreement in message passing systems. PODC (2011)
Martin Biely, Peter Robinson, Ulrich Schmid
Solving k-Set Agreement with Stable Skeleton Graphs. IPDPS Workshops (2011)
Martin Biely, Peter Robinson, Ulrich Schmid
Solving k-Set Agreement with Stable Skeleton Graphs CoRR (2011)
Martin Biely, Peter Robinson, Ulrich Schmid
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems CoRR (2011)
Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
Optimal regional consecutive leader election in mobile ad-hoc networks. FOMC (2011)
Martin Biely, Peter Robinson, Ulrich Schmid
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. OPODIS (2011)
John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks CoRR (2011)
Peter Robinson, Ulrich Schmid
The Asynchronous Bounded-Cycle model. Theor. Comput. Sci. 412 (40) (2011)
Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
Regional consecutive leader election in mobile ad-hoc networks. DIALM-PODC (2010)
Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
Brief Announcement: Regional Consecutive Leader Election in Mobile Ad-Hoc Networks. ALGOSENSORS (2010)
Martin Biely, Peter Robinson, Ulrich Schmid
-)Set Agreement. OPODIS (2009)
Martin Biely, Peter Robinson, Ulrich Schmid
-)Set Agreement. DISC (2009)
Peter Robinson, Ulrich Schmid
The asynchronous bounded-cycle model. PODC (2008)
Peter Robinson, Ulrich Schmid
The Asynchronous Bounded-Cycle Model. SSS (2008)

Peter Robinson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Robinson