Staff profile

• Graph Algorithms
• Communications Networks
• Randomised Algorithms
• Distributed Algorithms
• Probabilistic Method
• Parallel Algorithms

• 2000: PODC 2023 Programme Committee Member:
• 2000: Invited Speaker at AMG Workshop (DISC 2022):
• 2000: Invited Speaker at ADGA Workshop (DISC 2021):
• 2000: PODC 2021 Programme Committee Member:
• 2000: ICDCS 2021 Programme Committee Member:
• 2000: ALGOSENSORS 2022 Programme Committee Member:

Conference Paper

• On the Locality of the Lovász Local Lemma
  
  Davies-Peck, P. (2025). On the Locality of the Lovász Local Lemma. In STOC ’25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 1271-1282). https://doi.org/10.1145/3717823.37181
• Parallel Derandomization for Coloring
  
  Coy, S., Czumaj, A., Davies-Peck, P., & Mishra, G. (2024). Parallel Derandomization for Coloring. In 2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE. https://doi.org/10.1109/IPDPS57955.2024.00098
• Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
  
  Davies, P. (2023, June). Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. Presented at PODC 2023: ACM Symposium on Principles of Distributed Computing, Orlando, Florida. https://doi.org/10.1145/3583668.3594595
• Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring
  
  Davies, P. (2023). Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 4273-4295). ACM-SIAM. https://doi.org/10.1137/1.9781611977554.ch163
• Optimal Message-Passing with Noisy Beeps
  
  Davies, P. (2023). Optimal Message-Passing with Noisy Beeps. Presented at PODC 2023: ACM Symposium on Principles of Distributed Computing, Orlando, Florida. https://doi.org/10.1145/3583668.3594594
• Optimal (degree+1)-Coloring in Congested Clique
  
  Coy, S., Czumaj, A., Davies, P., & Mishra, G. (2023). Optimal (degree+1)-Coloring in Congested Clique. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (pp. 99:1-99:20). Schloss Dgastuhl. https://doi.org/10.4230/LIPIcs.ICALP.2023.46
• Asynchronous Decentralized SGD with Quantized and Local Updates
  
  Nadiradze, G., Sabour, A., Davies, P., Li, S., & Alistarh, D. (2021). Asynchronous Decentralized SGD with Quantized and Local Updates. In Advances in Neural Information Processing Systems 34 (NeurIPS 2021).
• New Bounds For Distributed Mean Estimation and Variance Reduction
  
  Davies, P., Gurunathan, V., Moshrefi, N., Ashkboos, S., & Alistarh, D. (2021). New Bounds For Distributed Mean Estimation and Variance Reduction. In ICLR 2021 - The Ninth International Conference on Learning Representations.

Journal Article

• Optimal Message-Passing with Noisy Beeps
  
  Davies-Peck, P. (2025). Optimal Message-Passing with Noisy Beeps. Distributed Computing. Advance online publication.
• Component stability in low-space massively parallel computation
  
  Czumaj, A., Davies-Peck, P., & Parter, M. (2024). Component stability in low-space massively parallel computation. Distributed Computing, 37(1), 35-64. https://doi.org/10.1007/s00446-024-00461-9
• Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
  
  Czumaj, A., & Davies, P. (2021). Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. Journal of the ACM, 68(2), Article 13. https://doi.org/10.1145/3446383
• Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
  
  Czumaj, A., Davies, P., & Parter, M. (2021). Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Transactions on Algorithms, 17(2), 1-27. https://doi.org/10.1145/3451992
• Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
  
  Czumaj, A., Davies, P., & Parter, M. (2021). Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM Journal on Computing, 50(5), 1603-1626. https://doi.org/10.1137/20m1366502