Massimo Lauria
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
19
Venues
8
Active years
2005–2026
Best venue rank
A*
Where they publish
Papers
19 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SAT | Conditional Autarkies: Hard Formulas Made Easy. | Ilario Bonacina, Maria Luisa Bonet, Antonina Kolokolova, Massimo Lauria |
| 2025 | SAT | Redundancy Rules for MaxSAT. | Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria |
| 2024 | SAT | MaxSAT Resolution with Inclusion Redundancy. | Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria |
| 2022 | MFCS | On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. | Ilario Bonacina, Nicola Galesi, Massimo Lauria |
| 2019 | SAT | Circular (Yet Sound) Proofs. | Albert Atserias, Massimo Lauria |
| 2018 | CiE | Algorithm Analysis Through Proof Complexity. | Massimo Lauria |
| 2018 | STOC | Clique is hard on average for regular resolution. | Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordstrm, Alexander A. Razborov |
| 2017 | SAT | CNFgen: A Generator of Crafted Benchmarks. | Massimo Lauria, Jan Elffers, Jakob Nordstrm, Marc Vinyals |
| 2016 | STACS | Semantic Versus Syntactic Cutting Planes. | Yuval Filmus, Pavel Hrubes, Massimo Lauria |
| 2016 | SAT | Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. | Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordstrm, Marc Vinyals |
| 2015 | FOCS | Hardness of Approximation in PSPACE and Separation Results for Pebble Games. | Siu Man Chan, Massimo Lauria, Jakob Nordstrm, Marc Vinyals |
| 2014 | STACS | From Small Space to Small Width in Resolution. | Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordstrm, Marc Vinyals |
| 2013 | ICALP | Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). | Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordstrm, Marc Vinyals |
| 2013 | ICALP | The Complexity of Proving That a Graph Is Ramsey. | Massimo Lauria, Pavel Pudlk, Vojtech Rdl, Neil Thapen |
| 2013 | SAT | A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. | Massimo Lauria |
| 2011 | ICALP | Parameterized Bounded-Depth Frege Is Not Optimal. | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov |
| 2011 | SAT | Parameterized Complexity of DPLL Search Procedures. | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
| 2006 | SIROCCO | Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. | Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri |
| 2005 | SIROCCO | Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. | Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri |