| 2008 |
|---|
| 37 | | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
Measuring the Hardness of SAT Instances.
AAAI 2008: 222-228 |
| 36 | EE | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy:
Random SAT Instances à la Carte.
CCIA 2008: 109-117 |
| 2007 |
|---|
| 35 | | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
Inference Rules for High-Order Consistency in Weighted CSP.
AAAI 2007: 167-172 |
| 34 | | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
What Is a Real-World SAT Instance?
CCIA 2007: 19-28 |
| 33 | EE | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
The Logic Behind Weighted CSP.
IJCAI 2007: 32-37 |
| 32 | EE | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
A Complete Resolution Calculus for Signed Max-SAT.
ISMVL 2007: 22 |
| 31 | EE | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
Mapping CSP into Many-Valued SAT.
SAT 2007: 10-15 |
| 30 | EE | Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
Resolution for Max-SAT.
Artif. Intell. 171(8-9): 606-618 (2007) |
| 2006 |
|---|
| 29 | EE | Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
A Complete Calculus for Max-SAT.
SAT 2006: 240-251 |
| 28 | EE | Maria Luisa Bonet,
Katherine St. John,
Ruchi Mahindru,
Nina Amenta:
Approximating Subtree Distances Between Phylogenies.
Journal of Computational Biology 13(8): 1419-1434 (2006) |
| 2004 |
|---|
| 27 | EE | Maria Luisa Bonet,
Carlos Domingo,
Ricard Gavaldà,
Alexis Maciel,
Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs.
Computational Complexity 13(1-2): 47-68 (2004) |
| 26 | EE | Albert Atserias,
Maria Luisa Bonet:
On the automatizability of resolution and related propositional proof systems.
Inf. Comput. 189(2): 182-201 (2004) |
| 2003 |
|---|
| 25 | EE | Maria Luisa Bonet,
Nicola Galesi:
Degree complexity for a modified pigeonhole principle.
Arch. Math. Log. 42(5): 403-414 (2003) |
| 24 | EE | Albert Atserias,
Maria Luisa Bonet,
Jordi Levy:
On Chvatal Rank and Cutting Planes Proofs
Electronic Colloquium on Computational Complexity (ECCC)(041): (2003) |
| 2002 |
|---|
| 23 | EE | Albert Atserias,
Maria Luisa Bonet:
On the Automatizability of Resolution and Related Propositional Proof Systems.
CSL 2002: 569-583 |
| 22 | EE | Albert Atserias,
Maria Luisa Bonet:
On the Automatizability of Resolution and Related Propositional Proof Systems
Electronic Colloquium on Computational Complexity (ECCC)(010): (2002) |
| 21 | EE | Albert Atserias,
Maria Luisa Bonet,
Juan Luis Esteban:
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution.
Inf. Comput. 176(2): 136-152 (2002) |
| 2001 |
|---|
| 20 | EE | Albert Atserias,
Maria Luisa Bonet,
Juan Luis Esteban:
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.
ICALP 2001: 1005-1016 |
| 19 | EE | Maria Luisa Bonet,
Nicola Galesi:
Optimality of size-width tradeoffs for resolution.
Computational Complexity 10(4): 261-276 (2001) |
| 2000 |
|---|
| 18 | | Maria Luisa Bonet,
Toniann Pitassi,
Ran Raz:
On Interpolation and Automatization for Frege Systems.
SIAM J. Comput. 29(6): 1939-1967 (2000) |
| 17 | EE | Maria Luisa Bonet,
Juan Luis Esteban,
Nicola Galesi,
Jan Johannsen:
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems.
SIAM J. Comput. 30(5): 1462-1484 (2000) |
| 1999 |
|---|
| 16 | EE | Maria Luisa Bonet,
Nicola Galesi:
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus.
FOCS 1999: 422-432 |
| 15 | EE | Maria Luisa Bonet,
Carlos Domingo,
Ricard Gavaldà,
Alexis Maciel,
Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs.
IEEE Conference on Computational Complexity 1999: 15-23 |
| 14 | | Maria Luisa Bonet,
Cynthia A. Phillips,
Tandy Warnow,
Shibu Yooseph:
Constructing Evolutionary Trees in the Presence of Polymorphic Characters.
SIAM J. Comput. 29(1): 103-131 (1999) |
| 1998 |
|---|
| 13 | EE | Maria Luisa Bonet,
Juan Luis Esteban,
Nicola Galesi,
Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems.
FOCS 1998: 638-647 |
| 12 | EE | Maria Luisa Bonet,
Mike A. Steel,
Tandy Warnow,
Shibu Yooseph:
Better methods for solving parsimony and compatibility.
RECOMB 1998: 40-49 |
| 11 | EE | Maria Luisa Bonet,
Juan Luis Esteban,
Nicola Galesi,
Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
Electronic Colloquium on Computational Complexity (ECCC) 5(35): (1998) |
| 10 | | Maria Luisa Bonet,
Mike A. Steel,
Tandy Warnow,
Shibu Yooseph:
Better Methods for Solving Parsimony and Compatibility.
Journal of Computational Biology 5(3): 391-408 (1998) |
| 1997 |
|---|
| 9 | | Maria Luisa Bonet,
Nicola Galesi:
Linear Lower Bounds and Simulations in Frege Systems with Substitutions.
CSL 1997: 115-128 |
| 8 | EE | Maria Luisa Bonet,
Toniann Pitassi,
Ran Raz:
No Feasible Interpolation for TC0-Frege Proofs.
FOCS 1997: 254-263 |
| 7 | | Maria Luisa Bonet,
Toniann Pitassi,
Ran Raz:
Lower Bounds for Cutting Planes Proofs with Small Coefficients.
J. Symb. Log. 62(3): 708-728 (1997) |
| 1996 |
|---|
| 6 | EE | Maria Luisa Bonet,
Cynthia A. Phillips,
Tandy Warnow,
Shibu Yooseph:
Constructing Evolutionary Trees in the Presence of Polymorphic Characters.
STOC 1996: 220-229 |
| 1995 |
|---|
| 5 | EE | Maria Luisa Bonet,
Toniann Pitassi,
Ran Raz:
Lower bounds for cutting planes proofs with small coefficients.
STOC 1995: 575-584 |
| 4 | | Maria Luisa Bonet,
Samuel R. Buss:
The Serial Transitive Closure Problem for Trees.
SIAM J. Comput. 24(1): 109-122 (1995) |
| 1994 |
|---|
| 3 | | Maria Luisa Bonet,
Samuel R. Buss:
Size-Depth Tradeoffs for Boolean Fomulae.
Inf. Process. Lett. 49(3): 151-155 (1994) |
| 1993 |
|---|
| 2 | | Maria Luisa Bonet,
Samuel R. Buss:
The Deduction Rule and Linear and Near-Linear Proof Simulations.
J. Symb. Log. 58(2): 688-709 (1993) |
| 1991 |
|---|
| 1 | | Maria Luisa Bonet,
Samuel R. Buss:
On the Deduction Rule and the Number of Proof Lines
LICS 1991: 286-297 |
