Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Peter Robinson 0002
Augusta University, GA, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 103 matches
- 2024
- Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. ITCS 2024: 41:1-41:26 - Minming Li, Peter Robinson, Xianbin Zhu:
Dynamic Maximal Matching in Clique Networks. ITCS 2024: 73:1-73:21 - Shay Kutten, Peter Robinson, Ming Ming Tan:
Tight Bounds on the Message Complexity of Distributed Tree Verification. CoRR abs/2401.11991 (2024) - Minming Li, Peter Robinson, Xianbin Zhu:
Dynamic Maximal Matching in Clique Networks. CoRR abs/2401.15550 (2024) - 2023
- Seth Gilbert, Peter Robinson, Suman Sourav:
Leader Election in Well-Connected Graphs. Algorithmica 85(4): 1029-1066 (2023) - Shay Kutten, Peter Robinson, Ming Ming Tan:
Tight Bounds on the Message Complexity of Distributed Tree Verification. OPODIS 2023: 26:1-26:22 - Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu:
Improved Tradeoffs for Leader Election. PODC 2023: 355-365 - Peter Robinson:
Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? PODC 2023: 168-171 - Peter Robinson:
Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems. DISC 2023: 32:1-32:21 - Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu:
Improved Tradeoffs for Leader Election. CoRR abs/2301.08235 (2023) - Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. CoRR abs/2311.14811 (2023) - 2022
- John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav:
Latency, capacity, and distributed minimum spanning trees. J. Comput. Syst. Sci. 126: 1-20 (2022) - Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
Byzantine-Resilient Counting in Networks. ICDCS 2022: 12-22 - Khalid Hourani, Gopal Pandurangan, Peter Robinson:
Awake-Efficient Distributed Algorithms for Maximal Independent Set. ICDCS 2022: 1338-1339 - Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
Byzantine-Resilient Counting in Networks. CoRR abs/2204.11951 (2022) - Peter Robinson:
What Can We Compute in a Single Round of the Congested Clique? CoRR abs/2210.02638 (2022) - 2021
- Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
On the Distributed Complexity of Large-Scale Graph Computations. ACM Trans. Parallel Comput. 8(2): 7:1-7:28 (2021) - Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
Can We Break Symmetry with o(m) Communication? PODC 2021: 247-257 - Peter Robinson:
Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. SODA 2021: 2105-2120 - Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
Network Size Estimation in Small-World Networks under Byzantine Faults. CoRR abs/2102.09197 (2021) - Christian Konrad, Peter Robinson, Viktor Zamaraev:
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. CoRR abs/2103.07027 (2021) - Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
The Complexity of Symmetry Breaking in Massive Graphs. CoRR abs/2105.01833 (2021) - Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
Can We Break Symmetry with o(m) Communication? CoRR abs/2105.08917 (2021) - 2020
- Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
The complexity of leader election in diameter-two networks. Distributed Comput. 33(2): 189-205 (2020) - Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. ACM Trans. Algorithms 16(1): 13:1-13:27 (2020) - John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav:
Latency, Capacity, and Distributed Minimum Spanning Tree†. ICDCS 2020: 157-167 - Seth Gilbert, Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. PODC 2020: 438-447 - Peter Robinson:
Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. CoRR abs/2003.09895 (2020) - 2019
- Suman Sourav, Peter Robinson, Seth Gilbert:
Slow Links, Fast Links, and the Cost of Gossip. IEEE Trans. Parallel Distributed Syst. 30(9): 2130-2147 (2019) - Martin Biely, Peter Robinson:
On the hardness of the strongly dependent decision problem. ICDCN 2019: 120-123
skipping 73 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-13 18:52 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint