Portrait

Davide Mazzali

PhD student in Computer Science @ EPFL, Switzerland

davide [dot] mazzali [at] epfl [dot] ch

Bio

I am a PhD student at EPFL, where I am fortunate to be advised by Michael Kapralov and Ola Svensson.

My research interests lie in theoretical computer science, more specifically in algorithms and complexity theory, with an emphasis on spectral graph theory, constraint satisfaction problems, convex programming hierarchies, and beyond-worst-case analysis.

Before starting my PhD in February 2023, I obtained an MSc in Computer Science from EPFL in December 2022 and a BSc in Computer Science from the University of Trento in July 2020.

Publications

  • Spectral Clustering with Side Information [arXiv]
    with H. Fichtenberger, M. Kapralov, E. Kochetkova, S. Lattanzi, W. Wrzos-Kaminska.
    to appear in SODA 2026
  • Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT [arXiv]
    with A. Anand, E. Lee, A. Sharma.
    APPROX 2025
  • On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models [arXiv]
    with A. Bhaskara, A. Jha, M. Kapralov, N. Manoj, W. Wrzos-Kaminska.
    NeurIPS 2024
  • On the Streaming Complexity of Expander Decomposition [arXiv]
    with Y. Chen, M. Kapralov, M. Makarov.
    ICALP 2024

Teaching

  • CS-250 Algorithms I (EPFL): Spring 2024, Spring 2025.
  • CS-450 Algorithms II (EPFL): Fall 2023, Fall 2024, Fall 2025.
  • Virgilian Code (Scratch workshops at elementary and middle schools): 2016-2018.