Optimal leader election in multi-hop radio networks. - Artur Czumaj; Peter Davies 001 (CoRR, 2015)

Almost Optimal Deterministic Broadcast in Radio Networks. - Artur Czumaj; Peter Davies 001 (CoRR, 2015)

Faster Deterministic Communication in Radio Networks. - Artur Czumaj; Peter Davies 001 (ICALP, 2016)

Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks. - Artur Czumaj; Peter Davies 001 (PODC, 2016)

PODC 2017 Review. - Peter Davies 001 (SIGACT News, 2017)

Deterministic Blind Radio Networks. - Artur Czumaj; Peter Davies 001 (DISC, 2018)

Brief Announcement: Randomized Blind Radio Networks. - Artur Czumaj; Peter Davies 001 (DISC, 2018)

Randomized Communication Without Network Knowledge. - Artur Czumaj; Peter Davies 001 (CoRR, 2018)

Deterministic Communication in Radio Networks. - Artur Czumaj; Peter Davies 001 (SIAM J. Comput., 2018)

SPONGE: A generalized eigenproblem for clustering signed networks. - Mihai Cucuringu; Peter Davies 001; Aldo Glielmo; Hemant Tyagi (AISTATS, 2019)

Optimal Multi-broadcast with Beeps Using Group Testing. - Joffroy Beauquier; Janna Burman; Peter Davies 001; Fabien Dufoulon (SIROCCO, 2019)

Communicating with beeps. - Artur Czumaj; Peter Davies 001 (J. Parallel Distributed Comput., 2019)

Leader election in multi-hop radio networks. - Artur Czumaj; Peter Davies 001 (Theor. Comput. Sci., 2019)

Simple, Deterministic, Constant-Round Coloring in the Congested Clique. - Artur Czumaj; Peter Davies 001; Merav Parter (PODC, 2020)

Distributed Mean Estimation with Optimal Error Bounds. - Dan Alistarh; Saleh Ashkboos; Peter Davies 001 (CoRR, 2020)

PODC 2020 Review. - Mirza Ahad Baig; Alkida Balliu; Peter Davies 001; Michal Dory (SIGACT News, 2020)

New Bounds For Distributed Mean Estimation and Variance Reduction. - Peter Davies 001; Vijaykrishna Gurunanthan; Niusha Moshrefi; Saleh Ashkboos; Dan Alistarh (ICLR, 2021)

Communication-Efficient Distributed Optimization with Quantized Preconditioners. - Foivos Alimisis; Peter Davies 001; Dan Alistarh (ICML, 2021)

Distributed Principal Component Analysis with Limited Communication. - Foivos Alimisis; Peter Davies 001; Bart Vandereycken; Dan Alistarh (NeurIPS, 2021)

Asynchronous Decentralized SGD with Quantized and Local Updates. - Giorgi Nadiradze; Amirmojtaba Sabour; Peter Davies 001; Shigang Li 002; Dan Alistarh (NeurIPS, 2021)

Improved Deterministic (Δ+1) Coloring in Low-Space MPC. - Artur Czumaj; Peter Davies 001; Merav Parter (PODC, 2021)

Collecting Coupons is Faster with Friends. - Dan Alistarh; Peter Davies 001 (SIROCCO, 2021)

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. - Artur Czumaj; Peter Davies 001 (J. ACM, 2021)

Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. - Artur Czumaj; Peter Davies 001; Merav Parter (SIAM J. Comput., 2021)

Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. - Artur Czumaj; Peter Davies 001; Merav Parter (ACM Trans. Algorithms, 2021)

Optimal (Degree+1)-Coloring in Congested Clique. - Sam Coy; Artur Czumaj; Peter Davies 001; Gopinath Mishra (ICALP, 2023)

Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. - Peter Davies 001 (PODC, 2023)

Optimal Message-Passing with Noisy Beeps. - Peter Davies 001 (PODC, 2023)

Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring. - Peter Davies 001 (SODA, 2023)

Fast Parallel Degree+1 List Coloring. - Sam Coy; Artur Czumaj; Peter Davies 001; Gopinath Mishra (CoRR, 2023)

Parallel Derandomization for Coloring (Abstract). - Sam Coy; Artur Czumaj; Peter Davies-Peck; Gopinath Mishra (HOPC@SPAA, 2024)

Parallel Derandomization for Coloring. - Sam Coy; Artur Czumaj; Peter Davies-Peck; Gopinath Mishra (IPDPS, 2024)

Component stability in low-space massively parallel computation. - Artur Czumaj; Peter Davies-Peck; Merav Parter (Distributed Comput., 2024)

On the Locality of the Lovász Local Lemma. - Peter Davies-Peck (STOC, 2025)