Massimo Lauria
Orcid: 0000-0003-4003-3168Affiliations:
- Sapienza University of Rome, Italy
According to our database1,
Massimo Lauria
authored at least 42 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
1
3
2
3
1
2
1
2
4
1
5
2
1
2
1
1
1
1
2
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024
2023
Comput. Complex., December, 2023
Inf. Process. Lett., March, 2023
2021
Proceedings of the 36th Computational Complexity Conference, 2021
2019
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019
2018
Proceedings of the Sailing Routes in the World of Computation, 2018
2017
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
ACM Trans. Comput. Theory, 2016
ACM Trans. Comput. Log., 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016
2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
Electron. Colloquium Comput. Complex., 2014
2013
Electron. Colloquium Comput. Complex., 2013
Short $\mathsf{Res}^*(\mathsf{polylog})$ refutations if and only if narrow $\mathsf{Res}$ refutations.
CoRR, 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
Electron. Colloquium Comput. Complex., 2012
2010
ACM Trans. Comput. Log., 2010
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games.
Inf. Process. Lett., 2010
Electron. Colloquium Comput. Complex., 2010
2009
Electron. Colloquium Comput. Complex., 2009
Electron. Colloquium Comput. Complex., 2009
2008
Theor. Comput. Sci., 2008
2007
On the bounded-hop MST problem on random Euclidean instances.
Theor. Comput. Sci., 2007
Electron. Colloquium Comput. Complex., 2007
2006
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