default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Davies-Peck
Person information
- affiliation: Durham University, Department of Computer Science, Durham, UK
- affiliation (former, PhD 2018): University of Warwick, Coventry, UK
- affiliation (former): Institute of Science and Technology Austria, Klosterneuburg, Austria
Other persons with the same name
- Peter Davies — disambiguation page
- Peter Davies 0002 — Texas A&M University, Health Science Center, Houston, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j10]Peter Davies-Peck
:
Optimal message-passing with noisy beeps. Distributed Comput. 38(3): 247-260 (2025)- [c24]Peter Davies-Peck:
On the Locality of the Lovász Local Lemma. STOC 2025: 1271-1282 - [i21]Peter Davies-Peck:
On the Locality of the Lovász Local Lemma. CoRR abs/2502.11690 (2025) - 2024
- [j9]Artur Czumaj, Peter Davies-Peck, Merav Parter:
Component stability in low-space massively parallel computation. Distributed Comput. 37(1): 35-64 (2024) - [c23]Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra:
Parallel Derandomization for Coloring (Abstract). HOPC@SPAA 2024 - [c22]Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra:
Parallel Derandomization for Coloring. IPDPS 2024: 1058-1069 - 2023
- [c21]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Optimal (Degree+1)-Coloring in Congested Clique. ICALP 2023: 46:1-46:20 - [c20]Peter Davies:
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. PODC 2023: 290-299 - [c19]Peter Davies:
Optimal Message-Passing with Noisy Beeps. PODC 2023: 300-309 - [c18]Peter Davies:
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring. SODA 2023: 4273-4295 - [i20]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Fast Parallel Degree+1 List Coloring. CoRR abs/2302.04378 (2023) - [i19]Peter Davies:
Optimal Message-Passing with Noisy Beeps. CoRR abs/2303.15346 (2023) - [i18]Peter Davies:
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. CoRR abs/2303.16832 (2023) - [i17]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Optimal (degree+1)-Coloring in Congested Clique. CoRR abs/2306.12071 (2023) - 2022
- [i16]Peter Davies:
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring. CoRR abs/2208.08701 (2022) - 2021
- [j8]Artur Czumaj, Peter Davies:
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. J. ACM 68(2): 13:1-13:22 (2021) - [j7]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM J. Comput. 50(5): 1603-1626 (2021) - [j6]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Trans. Algorithms 17(2): 16:1-16:27 (2021) - [c17]Peter Davies, Vijaykrishna Gurunanthan, Niusha Moshrefi, Saleh Ashkboos, Dan Alistarh:
New Bounds For Distributed Mean Estimation and Variance Reduction. ICLR 2021 - [c16]Foivos Alimisis, Peter Davies, Dan Alistarh:
Communication-Efficient Distributed Optimization with Quantized Preconditioners. ICML 2021: 196-206 - [c15]Foivos Alimisis, Peter Davies, Bart Vandereycken, Dan Alistarh:
Distributed Principal Component Analysis with Limited Communication. NeurIPS 2021: 2823-2834 - [c14]Giorgi Nadiradze, Amirmojtaba Sabour, Peter Davies, Shigang Li, Dan Alistarh:
Asynchronous Decentralized SGD with Quantized and Local Updates. NeurIPS 2021: 6829-6842 - [c13]Artur Czumaj, Peter Davies, Merav Parter:
Improved Deterministic (Δ+1) Coloring in Low-Space MPC. PODC 2021: 469-479 - [c12]Artur Czumaj, Peter Davies, Merav Parter:
Component Stability in Low-Space Massively Parallel Computation. PODC 2021: 481-491 - [c11]Dan Alistarh, Peter Davies:
Collecting Coupons is Faster with Friends. SIROCCO 2021: 3-12 - [i15]Foivos Alimisis, Peter Davies, Dan Alistarh:
Communication-Efficient Distributed Optimization with Quantized Preconditioners. CoRR abs/2102.07214 (2021) - [i14]Artur Czumaj, Peter Davies, Merav Parter:
Component Stability in Low-Space Massively Parallel Computation. CoRR abs/2106.01880 (2021) - [i13]Foivos Alimisis, Peter Davies, Bart Vandereycken, Dan Alistarh:
Distributed Principal Component Analysis with Limited Communication. CoRR abs/2110.14391 (2021) - [i12]Dan Alistarh, Peter Davies:
Collecting Coupons is Faster with Friends. CoRR abs/2112.05830 (2021) - [i11]Artur Czumaj, Peter Davies, Merav Parter:
Improved Deterministic (Δ+1)-Coloring in Low-Space MPC. CoRR abs/2112.05831 (2021) - 2020
- [j5]Mirza Ahad Baig, Alkida Balliu, Peter Davies, Michal Dory:
PODC 2020 Review. SIGACT News 51(4): 75-81 (2020) - [c10]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. PODC 2020: 309-318 - [c9]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. SPAA 2020: 175-185 - [i10]Dan Alistarh, Saleh Ashkboos, Peter Davies:
Distributed Mean Estimation with Optimal Error Bounds. CoRR abs/2002.09268 (2020) - [i9]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. CoRR abs/2009.06043 (2020)
2010 – 2019
- 2019
- [j4]Artur Czumaj, Peter Davies:
Communicating with beeps. J. Parallel Distributed Comput. 130: 98-109 (2019) - [j3]Artur Czumaj, Peter Davies:
Leader election in multi-hop radio networks. Theor. Comput. Sci. 792: 2-11 (2019) - [c8]Mihai Cucuringu, Peter Davies, Aldo Glielmo, Hemant Tyagi:
SPONGE: A generalized eigenproblem for clustering signed networks. AISTATS 2019: 1088-1098 - [c7]Joffroy Beauquier, Janna Burman, Peter Davies, Fabien Dufoulon:
Optimal Multi-broadcast with Beeps Using Group Testing. SIROCCO 2019: 66-80 - [i8]Mihai Cucuringu, Peter Davies, Aldo Glielmo, Hemant Tyagi:
SPONGE: A generalized eigenproblem for clustering signed networks. CoRR abs/1904.08575 (2019) - [i7]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. CoRR abs/1912.05390 (2019) - 2018
- [j2]Artur Czumaj, Peter Davies:
Deterministic Communication in Radio Networks. SIAM J. Comput. 47(1): 218-240 (2018) - [c6]Artur Czumaj, Peter Davies:
Deterministic Blind Radio Networks. DISC 2018: 15:1-15:17 - [c5]Artur Czumaj, Peter Davies:
Brief Announcement: Randomized Blind Radio Networks. DISC 2018: 43:1-43:3 - [i6]Artur Czumaj, Peter Davies:
Deterministic Blind Radio Networks. CoRR abs/1805.04838 (2018) - [i5]Artur Czumaj, Peter Davies:
Randomized Communication Without Network Knowledge. CoRR abs/1805.04842 (2018) - 2017
- [j1]Peter Davies:
PODC 2017 Review. SIGACT News 48(4): 91-93 (2017) - [c4]Artur Czumaj, Peter Davies:
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. PODC 2017: 3-12 - [i4]Artur Czumaj, Peter Davies:
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. CoRR abs/1703.01859 (2017) - 2016
- [c3]Artur Czumaj, Peter Davies:
Faster Deterministic Communication in Radio Networks. ICALP 2016: 139:1-139:14 - [c2]Artur Czumaj, Peter Davies:
Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks. PODC 2016: 47-49 - 2015
- [c1]Artur Czumaj, Peter Davies:
Communicating with Beeps. OPODIS 2015: 30:1-30:16 - [i3]Artur Czumaj, Peter Davies:
Communicating with Beeps. CoRR abs/1505.06107 (2015) - [i2]Artur Czumaj, Peter Davies:
Optimal leader election in multi-hop radio networks. CoRR abs/1505.06149 (2015) - [i1]Artur Czumaj, Peter Davies:
Almost Optimal Deterministic Broadcast in Radio Networks. CoRR abs/1506.00853 (2015)
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 2025-11-04 00:46 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:
