| 2024 | SODA | The Minority Dynamics and the Power of Synchronicity. | Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi |
| 2024 | SODA | New SDP Roundings and Certifiable Approximation for Cubic Optimization. | Jun-Ting Hsieh, Pravesh K. Kothari, Lucas Pesenti, Luca Trevisan |
| 2023 | IJCAI | On the Role of Memory in Robust Opinion Dynamics. | Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus |
| 2022 | AISTATS | Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models. | Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan |
| 2022 | LATIN | Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). | Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi |
| 2022 | SODA | Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification. | Antares Chen, Jonathan Shi, Luca Trevisan |
| 2021 | ICDCS | Expansion and Flooding in Dynamic Random Networks with Node Churn. | Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi |
| 2020 | ETFA | An IIoT System to Monitor 3D-Printed Artifacts via LoRaWAN Embedded Sensors. | Luca Trevisan, Stefano Vitturi, Federico Tramarin, Alberto Morato |
| 2020 | FOCS | Subexponential LPs Approximate Max-Cut. | Samuel B. Hopkins, Tselil Schramm, Luca Trevisan |
| 2020 | LATIN | Lower Bounds for Max-Cut via Semidefinite Programming. | Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan |
| 2020 | SODA | Finding a Bounded-Degree Expander Inside a Dense One. | Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan |
| 2020 | SODA | A New Algorithm for the Robust Semi-random Independent Set Problem. | Theo McKenzie, Hermish Mehta, Luca Trevisan |
| 2019 | FOCS | New Notions and Constructions of Sparsification for Graphs and Hypergraphs. | Nikhil Bansal, Ola Svensson, Luca Trevisan |
| 2019 | SODA | Optimal Lower Bounds for Sketching Graph Cuts. | Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan |
| 2018 | ESA | Average Whenever You Meet: Opportunistic Protocols for Community Detection. | Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan |
| 2018 | SODA | An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification. | Nikhil Srivastava, Luca Trevisan |
| 2017 | FOCS | From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. | Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan |
| 2017 | SODA | Find Your Place: Simple Distributed Algorithms for Community Detection. | Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan |
| 2017 | SODA | An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. | Michele Borassi, Pierluigi Crescenzi, Luca Trevisan |
| 2016 | SODA | Stabilizing Consensus with Many Opinions. | Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan |
| 2016 | SODA | Approximation of non-boolean 2CSP. | Guy Kindler, Alexandra Kolla, Luca Trevisan |
| 2014 | SODA | Partitioning into Expanders. | Shayan Oveis Gharan, Luca Trevisan |
| 2014 | SPAA | Simple dynamics for plurality consensus. | Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan |
| 2013 | STOC | Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gap. | Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Shayan Oveis Gharan, Luca Trevisan |
| 2012 | FOCS | Approximating the Expansion Profile and Almost Optimal Local Graph Clustering. | Shayan Oveis Gharan, Luca Trevisan |
| 2012 | FOCS | Better Pseudorandom Generators from Milder Pseudorandom Restrictions. | Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan |
| 2012 | PODC | Information spreading in dynamic graphs. | Andrea Clementi, Riccardo Silvestri, Luca Trevisan |
| 2012 | STOC | Multi-way spectral partitioning and higher-order cheeger inequalities. | James R. Lee, Shayan Oveis Gharan, Luca Trevisan |
| 2011 | TCC | Dense Model Theorems and Their Applications. | Luca Trevisan |
| 2010 | CRYPTO | Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. | Anindya De, Luca Trevisan, Madhur Tulsiani |
| 2009 | STOC | Max cut and the smallest eigenvalue. | Luca Trevisan |
| 2009 | TCC | Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. | James Cook, Omid Etesami, Rachel Miller, Luca Trevisan |
| 2008 | FOCS | Dense Subsets of Pseudorandom Sets. | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
| 2008 | FOCS | Average-case Complexity. | Luca Trevisan |
| 2007 | CRYPTO | Amplifying Collision Resistance: A Complexity-Theoretic Treatment. | Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee |
| 2007 | FUN | Fun with Sub-linear Time Algorithms. | Luca Trevisan |
| 2007 | STOC | Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani |
| 2006 | STOC | Pseudorandom walks on regular digraphs and the RL vs. L problem. | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
| 2006 | STOC | Gowers uniformity, influence of variables, and PCPs. | Alex Samorodnitsky, Luca Trevisan |
| 2005 | FOCS | Approximation Algorithms for Unique Games. | Luca Trevisan |
| 2005 | STOC | Hierarchies for semantic classes. | Lance Fortnow, Rahul Santhanam, Luca Trevisan |
| 2005 | STOC | On uniform amplification of hardness in NP. | Luca Trevisan |
| 2005 | TCC | On Hardness Amplification of One-Way Functions. | Henry C. Lin, Luca Trevisan, Hoeteck Wee |
| 2004 | TCC | List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. | Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan |
| 2004 | TCC | Notions of Reducibility between Cryptographic Primitives. | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
| 2003 | CIAC | Error-Correcting Codes in Complexity Theory. | Luca Trevisan |
| 2003 | FOCS | On Worst-Case to Average-Case Reductions for NP Problems. | Andrej Bogdanov, Luca Trevisan |
| 2003 | FOCS | On e-Biased Generators in NC0. | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
| 2003 | FOCS | List-Decoding Using The XOR Lemma. | Luca Trevisan |
| 2002 | FOCS | A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. | Andrej Bogdanov, Kenji Obata, Luca Trevisan |
| 2001 | FOCS | Three Theorems Regarding Testing Graph Properties. | Oded Goldreich, Luca Trevisan |
| 2001 | ICALP | Approximating the Minimum Spanning Tree Weight in Sublinear Time. | Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan |
| 2001 | STOC | Non-approximability results for optimization problems on bounded degree instances. | Luca Trevisan |
| 2000 | FOCS | Lower Bounds on the Efficiency of Generic Cryptographic Constructions. | Rosario Gennaro, Luca Trevisan |
| 2000 | FOCS | Extracting Randomness from Samplable Distributions. | Luca Trevisan, Salil P. Vadhan |
| 2000 | STOC | On the efficiency of local decoding procedures for error-correcting codes. | Jonathan Katz, Luca Trevisan |
| 2000 | STOC | A PCP characterization of NP with optimal amortized query complexity. | Alex Samorodnitsky, Luca Trevisan |
| 1999 | STOC | Pseudorandom Generators Without the XOR Lemma (Extended Abstract). | Madhu Sudan, Luca Trevisan, Salil P. Vadhan |
| 1999 | STOC | Construction of Extractors Using Pseudo-Random Generators (Extended Abstract). | Luca Trevisan |
| 1998 | FOCS | A Tight Characterization of NP with 3 Query PCPs. | Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan |
| 1998 | FOCS | Probabilistically Checkable Proofs with Low Amortized Query Complexity. | Madhu Sudan, Luca Trevisan |
| 1998 | STOC | Recycling Queries in PCPs and in Linearity Tests (Extended Abstract). | Luca Trevisan |
| 1998 | STACS | The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming. | Maria J. Serna, Luca Trevisan, Fatos Xhafa |
| 1997 | ESA | Approximating Satisfiable Satisfiability Problems (Extended Abstract). | Luca Trevisan |
| 1997 | FOCS | Weak Random Sources, Hitting Sets, and BPP Simulations. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim, Luca Trevisan |
| 1997 | STOC | When Hamming Meets Euclid: The Approximability of Geometric TSP and MST (Extended Abstract). | Luca Trevisan |
| 1996 | COCOON | Improved Non-approximability Results for Vertex Cover with Density Constraints. | Andrea E. F. Clementi, Luca Trevisan |
| 1996 | ESA | Positive Linear Programming, Parallel Approximation and PCP's. | Luca Trevisan |
| 1996 | FOCS | Gadgets, Approximation, and Linear Programming (extended abstract). | Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson |
| 1996 | MFCS | Bisimilarity Problems Requiring Exponential Time. | Michele Boreale, Luca Trevisan |
| 1995 | COCOON | Structure in Approximation Classes (Extended Abstract). | Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan |
| 1994 | WG | Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). | Pierluigi Crescenzi, Luca Trevisan |