default search action
Peter Robinson 0002
Person information
- affiliation: Augusta University, GA, USA
Other persons with the same name
- Peter Robinson 0001
— University of Cambridge, UK
- Peter Robinson 0003 — University of Saskatchewan (and 2 more)
- Peter Robinson 0004 — NASA
- Peter Robinson 0005
- Peter Robinson 0006 — GCS, London, UK
- Peter Robinson 0007
- Peter Robinson 0008 — University of Hull, Department of Computer Science, UK
- Peter Robinson 0009 — Lawrence Liveremore National Laboratory, USA
- Peter Robinson 0011 — University of Alabama, School of Medicine, Birmingham, AB, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c53]Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. ITCS 2024: 41:1-41:26 - [c52]Minming Li, Peter Robinson, Xianbin Zhu:
Dynamic Maximal Matching in Clique Networks. ITCS 2024: 73:1-73:21 - [c51]Costas Busch
Sparse Spanners with Small Distance and Congestion Stretches. SPAA 2024: 383-393 - [i33]Shay Kutten, Peter Robinson, Ming Ming Tan:
Tight Bounds on the Message Complexity of Distributed Tree Verification. CoRR abs/2401.11991 (2024) - [i32]Minming Li, Peter Robinson, Xianbin Zhu:
Dynamic Maximal Matching in Clique Networks. CoRR abs/2401.15550 (2024) - [i31]Peter Robinson, Ming Ming Tan:
Rise and Shine Efficiently! The Complexity of Adversarial Wake-up in Asynchronous Networks. CoRR abs/2410.09980 (2024) - 2023
- [j18]Seth Gilbert
Leader Election in Well-Connected Graphs. Algorithmica 85(4): 1029-1066 (2023) - [c50]Shay Kutten, Peter Robinson, Ming Ming Tan:
Tight Bounds on the Message Complexity of Distributed Tree Verification. OPODIS 2023: 26:1-26:22 - [c49]Peter Robinson
Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? PODC 2023: 168-171 - [c48]Shay Kutten
Improved Tradeoffs for Leader Election. PODC 2023: 355-365 - [c47]Peter Robinson:
Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems. DISC 2023: 32:1-32:21 - [i30]Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu:
Improved Tradeoffs for Leader Election. CoRR abs/2301.08235 (2023) - [i29]Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. CoRR abs/2311.14811 (2023) - 2022
- [j17]John Augustine, Seth Gilbert
Latency, capacity, and distributed minimum spanning trees. J. Comput. Syst. Sci. 126: 1-20 (2022) - [c46]Soumyottam Chatterjee
Byzantine-Resilient Counting in Networks. ICDCS 2022: 12-22 - [c45]Khalid Hourani
Awake-Efficient Distributed Algorithms for Maximal Independent Set. ICDCS 2022: 1338-1339 - [i28]Soumyottam Chatterjee
Byzantine-Resilient Counting in Networks. CoRR abs/2204.11951 (2022) - [i27]Peter Robinson:
What Can We Compute in a Single Round of the Congested Clique? CoRR abs/2210.02638 (2022) - 2021
- [j16]Gopal Pandurangan
On the Distributed Complexity of Large-Scale Graph Computations. ACM Trans. Parallel Comput. 8(2): 7:1-7:28 (2021) - [c44]Shreyas Pai
Can We Break Symmetry with o(m) Communication? PODC 2021: 247-257 - [c43]Peter Robinson:
Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. SODA 2021: 2105-2120 - [i26]Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
Network Size Estimation in Small-World Networks under Byzantine Faults. CoRR abs/2102.09197 (2021) - [i25]Christian Konrad, Peter Robinson, Viktor Zamaraev:
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. CoRR abs/2103.07027 (2021) - [i24]Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
The Complexity of Symmetry Breaking in Massive Graphs. CoRR abs/2105.01833 (2021) - [i23]Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
Can We Break Symmetry with o(m) Communication? CoRR abs/2105.08917 (2021) - 2020
- [j15]Soumyottam Chatterjee
The complexity of leader election in diameter-two networks. Distributed Comput. 33(2): 189-205 (2020) - [j14]Gopal Pandurangan
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. ACM Trans. Algorithms 16(1): 13:1-13:27 (2020) - [c42]John Augustine, Seth Gilbert
Latency, Capacity, and Distributed Minimum Spanning Tree†. ICDCS 2020: 157-167 - [c41]Seth Gilbert
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. PODC 2020: 438-447 - [i22]Peter Robinson:
Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. CoRR abs/2003.09895 (2020)
2010 – 2019
- 2019
- [j13]Suman Sourav
Slow Links, Fast Links, and the Cost of Gossip. IEEE Trans. Parallel Distributed Syst. 30(9): 2130-2147 (2019) - [c40]Martin Biely, Peter Robinson:
On the hardness of the strongly dependent decision problem. ICDCN 2019: 120-123 - [c39]Soumyottam Chatterjee
Network Size Estimation in Small-World Networks Under Byzantine Faults. IPDPS 2019: 855-865 - [c38]Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
The Complexity of Symmetry Breaking in Massive Graphs. DISC 2019: 26:1-26:18 - [e1]Peter Robinson, Faith Ellen:
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. ACM 2019, ISBN 978-1-4503-6217-7 [contents] - [i21]Seth Gilbert, Peter Robinson, Suman Sourav:
Leader Election in Well-Connected Graphs. CoRR abs/1901.00342 (2019) - [i20]John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav:
Latency, Capacity, and Distributed MST. CoRR abs/1902.08979 (2019) - 2018
- [j12]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
The Distributed Minimum Spanning Tree Problem. Bull. EATCS 125 (2018) - [j11]Gopal Pandurangan
Special Issue of ICDCN 2016 (Distributed Computing Track). Theor. Comput. Sci. 709: 1 (2018) - [j10]Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
Gracefully degrading consensus and k-set agreement in directed dynamic networks. Theor. Comput. Sci. 726: 41-77 (2018) - [j9]Gopal Pandurangan
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. ACM Trans. Parallel Comput. 5(1): 4:1-4:22 (2018) - [c37]Soumyottam Chatterjee
The Complexity of Leader Election: A Chasm at Diameter Two. ICDCN 2018: 13:1-13:10 - [c36]Suman Sourav, Peter Robinson, Seth Gilbert
Slow Links, Fast Links, and the Cost of Gossip. ICDCS 2018: 786-796 - [c35]Seth Gilbert
Leader Election in Well-Connected Graphs. PODC 2018: 227-236 - [c34]Peter Robinson:
Session details: Session 1D: Graph Algorithms. PODC 2018 - [c33]Peter Robinson, Christian Scheideler, Alexander Setzer:
Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. SPAA 2018: 173-182 - [c32]Gopal Pandurangan
On the Distributed Complexity of Large-Scale Graph Computations. SPAA 2018: 405-414 - [c31]Calvin Newport, Peter Robinson:
Fault-Tolerant Consensus with an Abstract MAC Layer. DISC 2018: 38:1-38:20 - [i19]Peter Robinson, Christian Scheideler, Alexander Setzer:
Breaking the Ω̃(√n) Barrier: Fast Consensus under a Late Adversary. CoRR abs/1805.00774 (2018) - [i18]Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
The Complexity of Leader Election: A Chasm at Diameter Two. CoRR abs/1809.00273 (2018) - [i17]Martin Biely, Peter Robinson:
On the Hardness of the Strongly Dependent Decision Problem. CoRR abs/1809.11060 (2018) - [i16]Calvin C. Newport, Peter Robinson:
Fault-Tolerant Consensus with an Abstract MAC Layer. CoRR abs/1810.02848 (2018) - 2017
- [c30]Shreyas Pai
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. PODC 2017: 207-209 - [c29]Seth Gilbert
Brief Announcement: Gossiping with Latencies. PODC 2017: 255-257 - [c28]Gopal Pandurangan
A time- and message-optimal distributed algorithm for minimum spanning trees. STOC 2017: 743-756 - [c27]Shreyas Pai
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. DISC 2017: 38:1-38:16 - [i15]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 abs/1705.07861 (2017) - 2016
- [j8]Gopal Pandurangan
DEX: self-healing expanders. Distributed Comput. 29(3): 163-185 (2016) - [j7]David G. Harris, Ehab Morsy, Gopal Pandurangan
Efficient computation of sparse structures. Random Struct. Algorithms 49(2): 322-344 (2016) - [j6]John Augustine, Gopal Pandurangan, Peter Robinson:
Distributed Algorithmic Foundations of Dynamic Networks. SIGACT News 47(1): 69-98 (2016) - [c26]Gopal Pandurangan
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. SPAA 2016: 429-438 - [i14]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Tight Bounds for Distributed Graph Computations. CoRR abs/1602.08481 (2016) - [i13]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. CoRR abs/1607.06883 (2016) - [i12]Seth Gilbert, Peter Robinson, Suman Sourav:
Gossiping with Latencies. CoRR abs/1611.06343 (2016) - 2015
- [j5]Shay Kutten, Gopal Pandurangan
On the Complexity of Universal Leader Election. J. ACM 62(1): 7:1-7:27 (2015) - [j4]John Augustine, Gopal Pandurangan
Distributed agreement in dynamic peer-to-peer networks. J. Comput. Syst. Sci. 81(7): 1088-1109 (2015) - [j3]Shay Kutten, Gopal Pandurangan
Sublinear bounds for randomized leader election. Theor. Comput. Sci. 561: 134-143 (2015) - [c25]John Augustine, Gopal Pandurangan
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. FOCS 2015: 350-369 - [c24]Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. NETYS 2015: 109-124 - [c23]Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan
Distributed Computation of Large-scale Graph Problems. SODA 2015: 391-410 - [c22]John Augustine, Gopal Pandurangan
Fast Byzantine Leader Election in Dynamic Networks. DISC 2015: 276-291 - [i11]Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler:
Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. CoRR abs/1501.02716 (2015) - [i10]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRR abs/1503.02353 (2015) - 2014
- [j2]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): 1078-1088 (2014) - [c21]Gopal Pandurangan
DEX: Self-Healing Expanders. IPDPS 2014: 702-711 - [c20]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: 341-343 - [c19]Shay Kutten, Danupon Nanongkai, Gopal Pandurangan
Distributed Symmetry Breaking in Hypergraphs. DISC 2014: 469-483 - [i9]Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Symmetry Breaking in Hypergraphs. CoRR abs/1405.1649 (2014) - 2013
- [c18]David G. Harris, Ehab Morsy, Gopal Pandurangan
Efficient Computation of Balanced Structures. ICALP (2) 2013: 581-593 - [c17]Shay Kutten, Gopal Pandurangan
Sublinear Bounds for Randomized Leader Election. ICDCN 2013: 348-362 - [c16]John Augustine, Gopal Pandurangan
Fast byzantine agreement in dynamic networks. PODC 2013: 74-83 - [c15]Shay Kutten, Gopal Pandurangan
On the complexity of universal leader election. PODC 2013: 100-109 - [c14]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan
Storage and search in dynamic peer-to-peer networks. SPAA 2013: 53-62 - [c13]John Augustine, Tejas Kulkarni, Paresh Nakhe, Peter Robinson:
Robust Leader Election in a Fast-Changing World. FOMC 2013: 38-49 - [i8]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Storage and Search in Dynamic Peer-to-Peer Networks. CoRR abs/1305.1121 (2013) - [i7]Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
The Distributed Complexity of Large-scale Graph Processing. CoRR abs/1311.6209 (2013) - 2012
- [c12]Martin Biely
Agreement in Directed Dynamic Networks. SIROCCO 2012: 73-84 - [c11]John Augustine, Gopal Pandurangan
Towards robust and efficient computation in dynamic peer-to-peer networks. SODA 2012: 551-569 - [i6]Martin Biely, Peter Robinson, Ulrich Schmid:
Agreement in Directed Dynamic Networks. CoRR abs/1204.0641 (2012) - [i5]Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
Self-healing Deterministic Expanders. CoRR abs/1206.1522 (2012) - [i4]Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
Sublinear Bounds for Randomized Leader Election. CoRR abs/1210.4822 (2012) - 2011
- [j1]Peter Robinson, Ulrich Schmid:
The Asynchronous Bounded-Cycle model. Theor. Comput. Sci. 412(40): 5580-5601 (2011) - [c10]Hyun Chul Chung, Peter Robinson, Jennifer L. Welch:
Optimal regional consecutive leader election in mobile ad-hoc networks. FOMC 2011: 52-61 - [c9]Martin Biely
Solving k-Set Agreement with Stable Skeleton Graphs. IPDPS Workshops 2011: 1488-1495 - [c8]Martin Biely, Peter Robinson, Ulrich Schmid:
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. OPODIS 2011: 299-312 - [c7]Martin Biely
Easy impossibility proofs for k-set agreement in message passing systems. PODC 2011: 227-228 - [i3]Martin Biely, Peter Robinson, Ulrich Schmid:
Solving k-Set Agreement with Stable Skeleton Graphs. CoRR abs/1102.4423 (2011) - [i2]Martin Biely, Peter Robinson, Ulrich Schmid:
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. CoRR abs/1103.3671 (2011) - [i1]John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks. CoRR abs/1108.0809 (2011) - 2010
- [c6]Hyun Chul Chung, Peter Robinson, Jennifer L. Welch:
Brief Announcement: Regional Consecutive Leader Election in Mobile Ad-Hoc Networks. ALGOSENSORS 2010: 89-91 - [c5]Hyun Chul Chung, Peter Robinson, Jennifer L. Welch:
Regional consecutive leader election in mobile ad-hoc networks. DIALM-PODC 2010: 81-90
2000 – 2009
- 2009
- [c4]Martin Biely, Peter Robinson, Ulrich Schmid:
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. OPODIS 2009: 285-299 - [c3]Martin Biely, Peter Robinson, Ulrich Schmid:
Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. DISC 2009: 360-361 - 2008
- [c2]Peter Robinson, Ulrich Schmid:
The asynchronous bounded-cycle model. PODC 2008: 423 - [c1]Peter Robinson, Ulrich Schmid:
The Asynchronous Bounded-Cycle Model. SSS 2008: 246-262
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: