SO Re Co Di

Papers

• George Giakkoupis, Volker Turau, Isabella Ziccardi
  Self-Stabilizing MIS Computation in the Beeping Model
  In Proc. of PODC 2024, arXiv:2405.04266

• Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, and Isabella Ziccardi
  The Minority Dynamics and the Power of Synchronicity
  In Proc. of SODA 2024, 4155-4176, arXiv:2310.13558

• Jun-Ting Hsieh, Pravesh K. Kothari, Lucas Pesenti, and Luca Trevisan
  New SDP Roundings and Certifiable Approximation for Cubic Optimization
  In Proc. of SODA 2024, arXiv:2310.00393
• Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu
  Sum-of-Squares Lower Bounds for Densest k-Subgraph
  In Proc. of STOC 2023: 84-95, arXiv:2303.17506

• George Giakkoupis, Isabella Ziccardi
  Distributed Self-Stabilizing MIS with Few States and Weak Communication
  In Proc. of PODC 2023: 310-320, arXiv:2301.05059

• Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus.
  On the Role of Memory in Robust Opinion Dynamics
  In Proc. of IJCAI 2023, arXiv:2302.08600
• Tommaso D'Orsi and Luca Trevisan
  A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs
  In Proc. of CCC 2023, pages 27:1-27:16, arXiv:2204.10881
• Fabrizio Pittorino, Antonio Ferraro, Gabriele Perugini, Christoph Feinauer, Carlo Baldassi, Riccardo Zecchina
  Deep Networks on Toroids: Removing Symmetries Reveals the Structure of Flat Regions in the Landscape Geometry
  Preprint, 2022, arXiv:2202.03038
• Lucas Pesenti and Adrian Vladu
  Discrepancy minimization via regularization
  In Proc. of SODA 2023
• Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi
  Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond
  In Proc. of ICALP 2022, pages 41:1-41:20, [open access paper]
• Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, and Luca Trevisan
  Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models
  In Proc. of AISTATS 2022, pages 10852-10880, arXiv:2108.04729
• Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, and Isabella Ziccardi
  Percolation and Epidemic Processes in One-Dimensional Small-World Networks
  In Proc. of LATIN 2022, arXiv:2103.16398
• Antares Chen, Jonathan Shi and Luca Trevisan
  Cut Sparsification of the Clique Beyond the Ramanujan Bound
  In Proc. of SODA 2022, arXiv:2008.05648
• Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan and Isabella Ziccardi
  Expansion and Flooding in Dynamic Random Networks with Node Churn
  In Proc. of ICDCS 2021, arXiv:2007.14681
• Sam Hopkins, Tselil Schramm and Luca Trevisan
  Subexponential LPs Approximate Max Cut
  In Proc. of FOCS 2020, arXiv:1911.10304
• Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca and Luca Trevisan
  Consensus vs Broadcast, with and w/o Noise
  In Proc. of ITCS 2020, arXiv:1807.05626
• Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, and Luca Trevisan
  Finding a Bounded-Degree Expander Inside a Dense One
  In Proc. of SODA 2020, arXiv:1811.10316
• Theo McKenzie, Hermish Mehta, and Luca Trevisan
  A New Algorithm for the Robust Semi-random Independent Set Problem
  In Proc. of SODA 2020, arXiv:1808.03633
• Nikhil Bansal, Ola Svensson and Luca Trevisan
  New Notions and Constructions of Sparsification for Graphs and Hypergraphs
  In Proc. of FOCS 2019, arXiv:1905.01495