| Space complexity in polynomial calculus Y Filmus, M Lauria, J Nordstrom, N Ron-Zewi, N Thapen SIAM Journal on Computing 44 (4), 1119-1153, 2015 | 58 | 2015 |
| Narrow proofs may be maximally long A Atserias, M Lauria, J Nordström ACM Transactions on Computational Logic (TOCL) 17 (3), 1-30, 2016 | 52 | 2016 |
| Optimality of size-degree tradeoffs for polynomial calculus N Galesi, M Lauria ACM Transactions on Computational Logic (TOCL) 12 (1), 4, 2010 | 42 | 2010 |
| A characterization of tree-like resolution size O Beyersdorff, N Galesi, M Lauria Information Processing Letters 113 (18), 666-671, 2013 | 35 | 2013 |
| CNFgen: A generator of crafted benchmarks M Lauria, J Elffers, J Nordström, M Vinyals International Conference on Theory and Applications of Satisfiability …, 2017 | 29 | 2017 |
| Parameterized complexity of DPLL search procedures O Beyersdorff, N Galesi, M Lauria ACM Transactions on Computational Logic (TOCL) 14 (3), 1-21, 2013 | 29 | 2013 |
| Towards an understanding of polynomial calculus: New separations and lower bounds Y Filmus, M Lauria, M Mikša, J Nordström, M Vinyals International Colloquium on Automata, Languages, and Programming, 437-448, 2013 | 29 | 2013 |
| A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games O Beyersdorff, N Galesi, M Lauria Information Processing Letters 110 (23), 1074-1077, 2010 | 29 | 2010 |
| From small space to small width in resolution Y Filmus, M Lauria, M Mikša, J Nordström, M Vinyals ACM Transactions on Computational Logic (TOCL) 16 (4), 1-15, 2015 | 25 | 2015 |
| On the automatizability of polynomial calculus N Galesi, M Lauria Theory of Computing Systems 47 (2), 491-506, 2010 | 23 | 2010 |
| Clique is hard on average for regular resolution A Atserias, I Bonacina, SF De Rezende, M Lauria, J Nordström, ... Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 21 | 2018 |
| Hardness of approximation in PSPACE and separation results for pebble games SM Chan, M Lauria, J Nordstrom, M Vinyals 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 466-485, 2015 | 21 | 2015 |
| Parameterized bounded-depth Frege is not optimal O Beyersdorff, N Galesi, M Lauria, AA Razborov ACM Transactions on Computation Theory (TOCT) 4 (3), 1-16, 2012 | 21 | 2012 |
| Semantic versus syntactic cutting planes Y Filmus, P Hrubeš, M Lauria LIPIcs-Leibniz International Proceedings in Informatics 47, 2016 | 18 | 2016 |
| The complexity of proving that a graph is Ramsey M Lauria, P Pudlák, V Rödl, N Thapen Combinatorica 37 (2), 253-268, 2017 | 14 | 2017 |
| Minimum-energy broadcast and disk cover in grid wireless networks T Calamoneri, AEF Clementi, M Di Ianni, M Lauria, A Monti, R Silvestri Theoretical Computer Science 399 (1-2), 38-53, 2008 | 14 | 2008 |
| Trade-offs between time and memory in a tighter model of CDCL SAT solvers J Elffers, J Johannsen, M Lauria, T Magnard, J Nordström, M Vinyals International Conference on Theory and Applications of Satisfiability …, 2016 | 13 | 2016 |
| Parameterized complexity of DPLL search procedures O Beyersdorff, N Galesi, M Lauria Theory and Applications of Satisfiability Testing-SAT 2011, 5-18, 2011 | 13 | 2011 |
| Tight size-degree bounds for sums-of-squares proofs M Lauria, J Nordström computational complexity 26 (4), 911-948, 2017 | 12 | 2017 |
| Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases M Lauria, J Nordström 32nd Computational Complexity Conference (CCC 2017), 2017 | 10 | 2017 |
Jakob NordströmUniversity of Copenhagen and Lund UniversityZweryfikowany adres z di.ku.dk
