The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Massimo Lauria" ( http://dblp.L3S.de/Authors/Massimo_Lauria )

URL (Homepage):  https://orcid.org/0000-0003-4003-3168  Author page on DBLP  Author page in RDF  Community of Massimo Lauria in ASPL-2

Publication years (Num. hits)
2005-2010 (16) 2011-2013 (16) 2014-2016 (17) 2017-2019 (11)
Publication types (Num. hits)
article(38) inproceedings(22)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 61 publication records. Showing 60 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Albert Atserias, Massimo Lauria Circular (Yet Sound) Proofs. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Massimo Lauria A note about k-DNF resolution. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Massimo Lauria Cliques enumeration and tree-like resolution proofs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Neil Thapen On semantic cutting planes with very small coefficients. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Massimo Lauria Circular (Yet Sound) Proofs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Massimo Lauria Algorithm Analysis Through Proof Complexity. Search on Bibsonomy CiE The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov Clique is hard on average for regular resolution. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Jakob Nordström Tight Size-Degree Bounds for Sums-of-Squares Proofs. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen The complexity of proving that a graph is Ramsey. Search on Bibsonomy Combinatorica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals CNFgen: A Generator of Crafted Benchmarks. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Jakob Nordström Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Massimo Lauria, Jakob Nordström Narrow Proofs May Be Maximally Long. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Lorenzo Carlucci, Nicola Galesi, Massimo Lauria On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2016 DBLP  BibTeX  RDF
1Massimo Lauria A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. Search on Bibsonomy TOCT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Yuval Filmus, Pavel Hrubes, Massimo Lauria Semantic Versus Syntactic Cutting Planes. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals From Small Space to Small Width in Resolution. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Jakob Nordström Tight Size-Degree Bounds for Sums-of-Squares Proofs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Massimo Lauria, Jakob Nordström Tight Size-Degree Bounds for Sums-of-Squares Proofs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen Space Complexity in Polynomial Calculus. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals Hardness of Approximation in PSPACE and Separation Results for Pebble Games. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Jakob Nordström Tight Size-Degree Bounds for Sums-of-Squares Proofs. Search on Bibsonomy Conference on Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals From Small Space to Small Width in Resolution. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Albert Atserias, Massimo Lauria, Jakob Nordström Narrow Proofs May Be Maximally Long. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals From Small Space to Small Width in Resolution. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Albert Atserias, Massimo Lauria, Jakob Nordström Narrow Proofs May Be Maximally Long. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals From Small Space to Small Width in Resolution. Search on Bibsonomy STACS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Massimo Lauria, Jakob Nordström Narrow Proofs May Be Maximally Long. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria A characterization of tree-like Resolution size. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria Parameterized Complexity of DPLL Search Procedures. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen The complexity of proving that a graph is Ramsey. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Massimo Lauria Short $\mathsf{Res}^*(\mathsf{polylog})$ refutations if and only if narrow $\mathsf{Res}$ refutations. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen The complexity of proving that a graph is Ramsey Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). Search on Bibsonomy ICALP (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen The Complexity of Proving That a Graph Is Ramsey. Search on Bibsonomy ICALP (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Massimo Lauria A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. Search on Bibsonomy SAT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen Space Complexity in Polynomial Calculus. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria A Characterization of Tree-Like Resolution Size. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Massimo Lauria A rank lower bound for cutting planes proofs of Ramsey Theorem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov Parameterized Bounded-Depth Frege Is not Optimal. Search on Bibsonomy TOCT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi Space Complexity in Polynomial Calculus. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov Parameterized Bounded-Depth Frege Is Not Optimal. Search on Bibsonomy ICALP (1) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria Parameterized Complexity of DPLL Search Procedures. Search on Bibsonomy SAT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lorenzo Carlucci, Nicola Galesi, Massimo Lauria Paris-Harrington Tautologies. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicola Galesi, Massimo Lauria Optimality of size-degree tradeoffs for polynomial calculus. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov Parameterized Bounded-Depth Frege is Not Optimal. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Lorenzo Carlucci, Nicola Galesi, Massimo Lauria Paris-Harrington tautologies. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria Hardness of Parameterized Resolution. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Nicola Galesi, Massimo Lauria On the Automatizability of Polynomial Calculus. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria Hardness of Parameterized Resolution. Search on Bibsonomy Circuits, Logic, and Games The full citation details ... 2010 DBLP  BibTeX  RDF
1Massimo Lauria Random CNFs require spacious Polynomial Calculus refutations. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Nicola Galesi, Massimo Lauria On the Automatizability of Polynomial Calculus. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri Minimum-Energy Broadcast and disk cover in grid wireless networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri On the bounded-hop MST problem on random Euclidean instances. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  BibTeX  RDF
1Nicola Galesi, Massimo Lauria Extending Polynomial Calculus to $k$-DNF Resolution. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. Search on Bibsonomy ADHOC-NOW The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. Search on Bibsonomy SIROCCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. Search on Bibsonomy SIROCCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #60 of 60 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license