Massimo Lauria

According to our database1, Massimo Lauria authored at least 38 papers between 2005 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
On semantic cutting planes with very small coefficients.
Inf. Process. Lett., 2018

A note about k-DNF resolution.
Inf. Process. Lett., 2018

Cliques enumeration and tree-like resolution proofs.
Inf. Process. Lett., 2018

Clique is hard on average for regular resolution.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Algorithm Analysis Through Proof Complexity.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
CNFgen: A Generator of Crafted Benchmarks.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases.
Proceedings of the 32nd Computational Complexity Conference, 2017

2016
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies.
ACM Trans. Comput. Log., 2016

Semantic Versus Syntactic Cutting Planes.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015
Space Complexity in Polynomial Calculus.
SIAM J. Comput., 2015

Hardness of Approximation in PSPACE and Separation Results for Pebble Games.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Tight Size-Degree Bounds for Sums-of-Squares Proofs.
Proceedings of the 30th Conference on Computational Complexity, 2015

2014
From Small Space to Small Width in Resolution.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Narrow Proofs May Be Maximally Long.
Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013
A characterization of tree-like Resolution size.
Inf. Process. Lett., 2013

A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

The Complexity of Proving That a Graph Is Ramsey.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
A rank lower bound for cutting planes proofs of Ramsey Theorem.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Space Complexity in Polynomial Calculus.
Electronic Colloquium on Computational Complexity (ECCC), 2012

A Characterization of Tree-Like Resolution Size.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Space Complexity in Polynomial Calculus.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
Parameterized Complexity of DPLL Search Procedures.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Parameterized Bounded-Depth Frege Is Not Optimal.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Paris-Harrington Tautologies.
Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

2010
Optimality of size-degree tradeoffs for polynomial calculus.
ACM Trans. Comput. Log., 2010

On the Automatizability of Polynomial Calculus.
Theory Comput. Syst., 2010

A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games.
Inf. Process. Lett., 2010

A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Hardness of Parameterized Resolution.
Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

2009
Random CNFs require spacious Polynomial Calculus refutations.
Electronic Colloquium on Computational Complexity (ECCC), 2009

On the Automatizability of Polynomial Calculus.
Electronic Colloquium on Computational Complexity (ECCC), 2009

2007
On the bounded-hop MST problem on random Euclidean instances.
Theor. Comput. Sci., 2007

Extending Polynomial Calculus to $k$-DNF Resolution.
Electronic Colloquium on Computational Complexity (ECCC), 2007

2006
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks.
Proceedings of the Structural Information and Communication Complexity, 2006

A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006

2005
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
Proceedings of the Structural Information and Communication Complexity, 2005


  Loading...