- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j19 |      | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: SAT-based MaxSAT algorithms. Artif. Intell. 196: 77-105 (2013) |
| j18 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution procedures for multiple-valued optimization. Inf. Sci. 227: 43-59 (2013) |
| 2012 | ||
| j17 | | Maria Luisa Bonet, Simone Linz, Katherine St. John: The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. IEEE/ACM Trans. Comput. Biology Bioinform. 9(1): 273-285 (2012) |
| c28 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Chu Min Li: Analysis and Generation of Pseudo-Industrial MaxSAT Instances. CCIA 2012: 173-184 |
| c27 | | Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy: Improving SAT-Based Weighted MaxSAT Solvers. CP 2012: 86-101 |
| c26 | | Maria Luisa Bonet, Samuel R. Buss: An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning. SAT 2012: 44-57 |
| i6 | | Maria Luisa Bonet, Samuel R. Buss: An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning. CoRR abs/1202.2296 (2012) |
| i5 | | Maria Luisa Bonet, Sam Buss, Jan Johannsen: Improved Separations of Regular Resolution from Clause Learning Proof Systems. CoRR abs/1208.2469 (2012) |
| 2011 | ||
| i4 | | Maria Luisa Bonet, Simone Linz, Katherine St. John: The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. CoRR abs/1101.2170 (2011) |
| 2010 | ||
| j16 | | Maria Luisa Bonet, Katherine St. John: On the Complexity of uSPR Distance. IEEE/ACM Trans. Comput. Biology Bioinform. 7(3): 572-576 (2010) |
| c25 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: A New Algorithm for Weighted Partial MaxSAT. AAAI 2010 |
| 2009 | ||
| c24 | | |
| c23 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: On the Structure of Industrial SAT Instances. CP 2009: 127-141 |
| c22 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Towards Industrial-Like Random SAT Instances. IJCAI 2009: 387-392 |
| c21 | | Maria Luisa Bonet, Katherine St. John: Efficiently Calculating Evolutionary Tree Measures Using SAT. SAT 2009: 4-17 |
| c20 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Solving (Weighted) Partial MaxSAT through Satisfiability Testing. SAT 2009: 427-440 |
| 2008 | ||
| c19 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Measuring the Hardness of SAT Instances. AAAI 2008: 222-228 |
| c18 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Random SAT Instances à la Carte. CCIA 2008: 109-117 |
| 2007 | ||
| j15 | | Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution for Max-SAT. Artif. Intell. 171(8-9): 606-618 (2007) |
| c17 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172 |
| c16 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: What Is a Real-World SAT Instance? CCIA 2007: 19-28 |
| c15 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: The Logic Behind Weighted CSP. IJCAI 2007: 32-37 |
| c14 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22 |
| c13 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Mapping CSP into Many-Valued SAT. SAT 2007: 10-15 |
| 2006 | ||
| j14 | | Maria Luisa Bonet, Katherine St. John, Ruchi Mahindru, Nina Amenta: Approximating Subtree Distances Between Phylogenies. Journal of Computational Biology 13(8): 1419-1434 (2006) |
| c12 | | |
| 2004 | ||
| j13 | | 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) |
| j12 | | Albert Atserias, Maria Luisa Bonet: On the automatizability of resolution and related propositional proof systems. Inf. Comput. 189(2): 182-201 (2004) |
| 2003 | ||
| j11 | | Maria Luisa Bonet, Nicola Galesi: Degree complexity for a modified pigeonhole principle. Arch. Math. Log. 42(5): 403-414 (2003) |
| i3 | | Albert Atserias, Maria Luisa Bonet, Jordi Levy: On Chvatal Rank and Cutting Planes Proofs. Electronic Colloquium on Computational Complexity (ECCC)(041) (2003) |
| 2002 | ||
| j10 | | 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) |
| c11 | | Albert Atserias, Maria Luisa Bonet: On the Automatizability of Resolution and Related Propositional Proof Systems. CSL 2002: 569-583 |
| i2 | | Albert Atserias, Maria Luisa Bonet: On the Automatizability of Resolution and Related Propositional Proof Systems. Electronic Colloquium on Computational Complexity (ECCC)(010) (2002) |
| 2001 | ||
| j9 | | Maria Luisa Bonet, Nicola Galesi: Optimality of size-width tradeoffs for resolution. Computational Complexity 10(4): 261-276 (2001) |
| c10 | | Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban: Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. ICALP 2001: 1005-1016 |
| 2000 | ||
| j8 | | Maria Luisa Bonet, Toniann Pitassi, Ran Raz: On Interpolation and Automatization for Frege Systems. SIAM J. Comput. 29(6): 1939-1967 (2000) |
| j7 | | 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 | ||
| j6 | | 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) |
| c9 | | 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 |
| c8 | | Maria Luisa Bonet, Nicola Galesi: A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. FOCS 1999: 422-432 |
| 1998 | ||
| j5 | | Maria Luisa Bonet, Mike A. Steel, Tandy Warnow, Shibu Yooseph: Better Methods for Solving Parsimony and Compatibility. Journal of Computational Biology 5(3): 391-407 (1998) |
| c7 | | Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen: Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS 1998: 638-647 |
| c6 | | Maria Luisa Bonet, Mike A. Steel, Tandy Warnow, Shibu Yooseph: Better methods for solving parsimony and compatibility. RECOMB 1998: 40-49 |
| i1 | | 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) |
| 1997 | ||
| j4 | | Maria Luisa Bonet, Toniann Pitassi, Ran Raz: Lower Bounds for Cutting Planes Proofs with Small Coefficients. J. Symb. Log. 62(3): 708-728 (1997) |
| c5 | | Maria Luisa Bonet, Nicola Galesi: Linear Lower Bounds and Simulations in Frege Systems with Substitutions. CSL 1997: 115-128 |
| c4 | | Maria Luisa Bonet, Toniann Pitassi, Ran Raz: No Feasible Interpolation for TC0-Frege Proofs. FOCS 1997: 254-263 |
| 1996 | ||
| c3 | | Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warnow, Shibu Yooseph: Constructing Evolutionary Trees in the Presence of Polymorphic Characters. STOC 1996: 220-229 |
| 1995 | ||
| j3 | | Maria Luisa Bonet, Samuel R. Buss: The Serial Transitive Closure Problem for Trees. SIAM J. Comput. 24(1): 109-122 (1995) |
| c2 | | Maria Luisa Bonet, Toniann Pitassi, Ran Raz: Lower bounds for cutting planes proofs with small coefficients. STOC 1995: 575-584 |
| 1994 | ||
| j2 | | Maria Luisa Bonet, Samuel R. Buss: Size-Depth Tradeoffs for Boolean Fomulae. Inf. Process. Lett. 49(3): 151-155 (1994) |
| 1993 | ||
| j1 | | 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 | ||
| c1 | | Maria Luisa Bonet, Samuel R. Buss: On the Deduction Rule and the Number of Proof Lines. LICS 1991: 286-297 |
Colors in the list of coauthors
Last update Wed May 22 20:08:52 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page