default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimo Lauria
Person information
- affiliation: Sapienza University of Rome, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c24]Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria:
MaxSAT Resolution with Inclusion Redundancy. SAT 2024: 7:1-7:15- [i27]Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria:
Redundancy for MaxSAT. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j23]Ilario Bonacina
, Nicola Galesi, Massimo Lauria:
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Comput. Complex. 32(2): 12 (2023) - [j22]Riccardo Aragona, Lorenzo Campioni, Roberto Civino, Massimo Lauria:
Verification and generation of unrefinable partitions. Inf. Process. Lett. 181: 106361 (2023) - [j21]Albert Atserias, Massimo Lauria:
Circular (Yet Sound) Proofs in Propositional Logic. ACM Trans. Comput. Log. 24(3): 20:1-20:26 (2023) - [i26]Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals:
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. CoRR abs/2305.19104 (2023) - [i25]Massimo Lauria, Jakob Nordström:
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. CoRR abs/2306.00125 (2023) - 2022
- [c23]Ilario Bonacina, Nicola Galesi, Massimo Lauria:
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. MFCS 2022: 23:1-23:15 - [i24]Ilario Bonacina, Nicola Galesi, Massimo Lauria:
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j20]Lorenzo Carlucci, Massimo Lauria:
Upper bounds on positional Paris-Harrington games. Discret. Math. 344(3): 112257 (2021) - [j19]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique Is Hard on Average for Regular Resolution. J. ACM 68(4): 23:1-23:26 (2021) - [c22]Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov:
The Power of Negative Reasoning. CCC 2021: 40:1-40:24 - [i23]Riccardo Aragona, Lorenzo Campioni, Roberto Civino, Massimo Lauria:
Verification and generation of unrefinable partitions. CoRR abs/2112.15096 (2021) - 2020
- [i22]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique Is Hard on Average for Regular Resolution. CoRR abs/2012.09476 (2020)
2010 – 2019
- 2019
- [c21]Albert Atserias, Massimo Lauria:
Circular (Yet Sound) Proofs. SAT 2019: 1-18 - 2018
- [j18]Massimo Lauria:
Cliques enumeration and tree-like resolution proofs. Inf. Process. Lett. 135: 62-67 (2018) - [j17]Massimo Lauria, Neil Thapen:
On semantic cutting planes with very small coefficients. Inf. Process. Lett. 136: 70-75 (2018) - [j16]Massimo Lauria:
A note about k-DNF resolution. Inf. Process. Lett. 137: 33-39 (2018) - [c20]Massimo Lauria:
Algorithm Analysis Through Proof Complexity. CiE 2018: 254-263 - [c19]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique is hard on average for regular resolution. STOC 2018: 866-877 - [i21]Albert Atserias, Massimo Lauria:
Circular (Yet Sound) Proofs. CoRR abs/1802.05266 (2018) - 2017
- [j15]Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. Comput. Complex. 26(4): 911-948 (2017) - [j14]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Comb. 37(2): 253-268 (2017) - [c18]Massimo Lauria, Jakob Nordström:
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. CCC 2017: 2:1-2:20 - [c17]Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals:
CNFgen: A Generator of Crafted Benchmarks. SAT 2017: 464-473 - 2016
- [j13]Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. ACM Trans. Comput. Log. 17(3): 19 (2016) - [j12]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. ACM Trans. Comput. Log. 17(4): 26 (2016) - [j11]Massimo Lauria:
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. ACM Trans. Comput. Theory 8(4): 17:1-17:13 (2016) - [c16]Jan 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. SAT 2016: 160-176 - [c15]Yuval Filmus, Pavel Hrubes, Massimo Lauria:
Semantic Versus Syntactic Cutting Planes. STACS 2016: 35:1-35:13 - 2015
- [j10]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. SIAM J. Comput. 44(4): 1119-1153 (2015) - [j9]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. ACM Trans. Comput. Log. 16(4): 28:1-28:15 (2015) - [c14]Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. CCC 2015: 448-466 - [c13]Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals:
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. FOCS 2015: 466-485 - [i20]Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. CoRR abs/1504.01656 (2015) - [i19]Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c12]Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. CCC 2014: 286-297 - [c11]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. STACS 2014: 300-311 - [i18]Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. CoRR abs/1409.2731 (2014) - [i17]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. CoRR abs/1409.2978 (2014) - [i16]Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. Electron. Colloquium Comput. Complex. TR14 (2014) - [i15]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j8]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A characterization of tree-like Resolution size. Inf. Process. Lett. 113(18): 666-671 (2013) - [j7]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Parameterized Complexity of DPLL Search Procedures. ACM Trans. Comput. Log. 14(3): 20:1-20:21 (2013) - [c10]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). ICALP (1) 2013: 437-448 - [c9]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The Complexity of Proving That a Graph Is Ramsey. ICALP (1) 2013: 684-695 - [c8]Massimo Lauria:
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. SAT 2013: 351-364 - [i14]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. CoRR abs/1303.3166 (2013) - [i13]Massimo Lauria:
Short $\mathsf{Res}^*(\mathsf{polylog})$ refutations if and only if narrow $\mathsf{Res}$ refutations. CoRR abs/1310.5714 (2013) - [i12]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j6]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege Is not Optimal. ACM Trans. Comput. Theory 4(3): 7:1-7:16 (2012) - [c7]Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi:
Space Complexity in Polynomial Calculus. CCC 2012: 334-344 - [i11]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A Characterization of Tree-Like Resolution Size. Electron. Colloquium Comput. Complex. TR12 (2012) - [i10]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. Electron. Colloquium Comput. Complex. TR12 (2012) - [i9]Massimo Lauria:
A rank lower bound for cutting planes proofs of Ramsey Theorem. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c6]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
Paris-Harrington Tautologies. CCC 2011: 93-103 - [c5]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege Is Not Optimal. ICALP (1) 2011: 630-641 - [c4]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Parameterized Complexity of DPLL Search Procedures. SAT 2011: 5-18 - 2010
- [j5]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Inf. Process. Lett. 110(23): 1074-1077 (2010) - [j4]Nicola Galesi, Massimo Lauria:
On the Automatizability of Polynomial Calculus. Theory Comput. Syst. 47(2): 491-506 (2010) - [j3]Nicola Galesi, Massimo Lauria:
Optimality of size-degree tradeoffs for polynomial calculus. ACM Trans. Comput. Log. 12(1): 4:1-4:22 (2010) - [i8]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Hardness of Parameterized Resolution. Circuits, Logic, and Games 2010 - [i7]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Hardness of Parameterized Resolution. Electron. Colloquium Comput. Complex. TR10 (2010) - [i6]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games. Electron. Colloquium Comput. Complex. TR10 (2010) - [i5]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege is Not Optimal. Electron. Colloquium Comput. Complex. TR10 (2010) - [i4]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
Paris-Harrington tautologies. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [i3]Nicola Galesi, Massimo Lauria:
On the Automatizability of Polynomial Calculus. Electron. Colloquium Comput. Complex. TR09 (2009) - [i2]Massimo Lauria:
Random CNFs require spacious Polynomial Calculus refutations. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j2]Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri:
Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. 399(1-2): 38-53 (2008) - 2007
- [j1]Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. 384(2-3): 161-167 (2007) - [i1]Nicola Galesi, Massimo Lauria:
Extending Polynomial Calculus to $k$-DNF Resolution. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c3]Andrea 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. ADHOC-NOW 2006: 60-72 - [c2]Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri:
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO 2006: 227-239 - 2005
- [c1]Andrea 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. SIROCCO 2005: 89-98
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
