| Lower bounds for cutting planes proofs with small coefficients M Bonet, T Pitassi, R Raz Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 204 | 1995 |
| SAT-based MaxSAT algorithms C Ansótegui, ML Bonet, J Levy Artificial Intelligence 196, 77-105, 2013 | 201 | 2013 |
| Solving (weighted) partial MaxSAT through satisfiability testing C Ansótegui, ML Bonet, J Levy International conference on theory and applications of satisfiability …, 2009 | 197 | 2009 |
| Resolution for max-sat ML Bonet, J Levy, F Manyà Artificial Intelligence 171 (8-9), 606-618, 2007 | 162 | 2007 |
| On interpolation and automatization for Frege systems ML Bonet, T Pitassi, R Raz SIAM Journal on Computing 29 (6), 1939-1967, 2000 | 138 | 2000 |
| On the relative complexity of resolution refinements and cutting planes proof systems ML Bonet, JL Esteban, N Galesi, J Johannsen SIAM Journal on Computing 30 (5), 1462-1484, 2000 | 117 | 2000 |
| Optimality of size-width tradeoffs for resolution ML Bonet, N Galesi computational complexity 10, 261-276, 2001 | 100 | 2001 |
| A new algorithm for weighted partial MaxSAT C Ansótegui, ML Bonet, J Levy Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 3-8, 2010 | 90 | 2010 |
| Random SAT instances à la carte C Ansótegui, ML Bonet, J Levy Artificial Intelligence Research and Development, 109-117, 2008 | 79 | 2008 |
| On the structure of industrial SAT instances C Ansótegui, ML Bonet, J Levy International Conference on Principles and Practice of Constraint …, 2009 | 78 | 2009 |
| Measuring the Hardness of SAT Instances. C Ansótegui, ML Bonet, J Levy, F Manya AAAI 8, 222-228, 2008 | 75 | 2008 |
| A study of proof search algorithms for resolution and polynomial calculus ML Bonet, N Galesi 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999 | 74 | 1999 |
| Improving SAT-based weighted MaxSAT solvers C Ansótegui, ML Bonet, J Gabas, J Levy International conference on principles and practice of constraint …, 2012 | 71 | 2012 |
| On the automatizability of resolution and related propositional proof systems A Atserias, ML Bonet Information and Computation 189 (2), 182-201, 2004 | 69 | 2004 |
| Size-depth tradeoffs for Boolean formulae ML Bonet, SR Buss Information Processing Letters 49 (3), 151-155, 1994 | 68 | 1994 |
| A complete calculus for Max-SAT ML Bonet, J Levy, F Manyà Theory and Applications of Satisfiability Testing-SAT 2006: 9th …, 2006 | 64 | 2006 |
| Are there hard examples for Frege systems? ML Bonet, SR Buss, T Pitassi Feasible Mathematics II, 30-56, 1995 | 64 | 1995 |
| Approximating subtree distances between phylogenies ML Bonet, KS John, R Mahindru, N Amenta Journal of Computational Biology 13 (8), 1419-1434, 2006 | 59 | 2006 |
| Non-automatizability of bounded-depth Frege proofs ML Bonet, C Domingo, R Gavalda, A Maciel, T Pitassi computational complexity 13, 47-68, 2004 | 57 | 2004 |
| Lower bounds for the weak pigeonhole principle and random formulas beyond resolution A Atserias, ML Bonet, JL Esteban Information and Computation 176 (2), 136-152, 2002 | 54 | 2002 |
Jordi LevyResearch Scientist, IIIA-CSICVerified email at iiia.csic.es
