Peter G. Jeavons
List of publications from the DBLP Bibliography Server - FAQ| 2012 | ||
|---|---|---|
| j32 | Peter Jeavons, Justyna Petke: Local Consistency and SAT-Solvers. J. Artif. Intell. Res. (JAIR) 43: 329-351 (2012) | |
| i5 | David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivny: An Algebraic Theory of Complexity for Discrete Optimisation. CoRR abs/1207.6692 (2012) | |
| i4 | Alex Scott, Peter Jeavons, Lei Xu: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. CoRR abs/1211.0235 (2012) | |
| 2011 | ||
| c42 | Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen: Optimization Methods for the Partner Units Problem. CPAIOR 2011: 4-19 | |
| c41 | Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen: Tackling the Partner Units Configuration Problem. IJCAI 2011: 497-503 | |
| c40 | David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivny: An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. MFCS 2011: 231-242 | |
| c39 | Justyna Petke, Peter Jeavons: The Order Encoding: From Tractable CSP to Tractable SAT. SAT 2011: 371-372 | |
| c38 | Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen: Structural Decomposition Methods and What They are Good For. STACS 2011: 12-28 | |
| i3 | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: A Maximal Tractable Class of Soft Constraints. CoRR abs/1107.0043 (2011) | |
| 2010 | ||
| j31 | Martin C. Cooper, Peter G. Jeavons, András Z. Salamon: Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. Artif. Intell. 174(9-10): 570-584 (2010) | |
| j30 | Stanislav Zivny, Peter G. Jeavons: Classes of submodular constraints expressible by graph cuts. Constraints 15(3): 430-452 (2010) | |
| c37 | ||
| 2009 | ||
| j29 | Stanislav Zivny, David A. Cohen, Peter G. Jeavons: The expressive power of binary submodular functions. Discrete Applied Mathematics 157(15): 3347-3358 (2009) | |
| j28 | Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, Andrei A. Krokhin: The complexity of constraint satisfaction games and QCSP. Inf. Comput. 207(9): 923-944 (2009) | |
| c36 | ||
| c35 | Stanislav Zivny, David A. Cohen, Peter G. Jeavons: The Expressive Power of Binary Submodular Functions. MFCS 2009: 744-757 | |
| c34 | ||
| 2008 | ||
| j27 | David A. Cohen, Peter Jeavons, Marc Gyssens: A unified theory of structural tractability for constraint satisfaction problems. J. Comput. Syst. Sci. 74(5): 721-743 (2008) | |
| j26 | David A. Cohen, Martin C. Cooper, Peter Jeavons: Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theor. Comput. Sci. 401(1-3): 36-51 (2008) | |
| j25 | David A. Cohen, Peter G. Jeavons, Stanislav Zivny: The expressive power of valued constraints: Hierarchies and collapses. Theor. Comput. Sci. 409(1): 137-153 (2008) | |
| c33 | Stanislav Zivny, Peter Jeavons: Classes of Submodular Constraints Expressible by Graph Cuts. CP 2008: 112-127 | |
| c32 | ||
| c31 | Martin C. Cooper, Peter G. Jeavons, András Z. Salamon: Hybrid tractable CSPs which generalize tree structure. ECAI 2008: 530-534 | |
| i2 | Stanislav Zivny, David A. Cohen, Peter G. Jeavons: The Expressive Power of Binary Submodular Functions. CoRR abs/0811.1885 (2008) | |
| 2007 | ||
| c30 | Gaofeng Huang, Peter Jeavons, Dominic Kwiatkowski: Exact and Heuristic Approaches for Identifying Disease-Associated SNP Motifs. APBC 2007: 175-184 | |
| c29 | Gaofeng Huang, Peter Jeavons: A Geometrical Model for the SNP Motif Identification Problem. BIBE 2007: 395-402 | |
| c28 | David A. Cohen, Peter Jeavons, Stanislav Zivny: The Expressive Power of Valued Constraints: Hierarchies and Collapses. CP 2007: 798-805 | |
| c27 | Louis W. G. Barton, Peter Jeavons, John A. Caldwell, Koon Shan Barry Ng: First class objects and indexes for chant manuscripts. JCDL 2007: 415-416 | |
| 2006 | ||
| j24 | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: The complexity of soft constraint satisfaction. Artif. Intell. 170(11): 983-1016 (2006) | |
| j23 | David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith: Symmetry Definitions for Constraint Satisfaction Problems. Constraints 11(2-3): 115-137 (2006) | |
| j22 | Sumedha Gunewardena, Peter Jeavons, Zhaolei Zhang: Enhancing the Prediction of Transcription Factor Binding Sites by Incorporating Structural Properties and Nucleotide Covariations. Journal of Computational Biology 13(4): 929-945 (2006) | |
| c26 | David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith: Constraint Symmetry and Solution Symmetry. AAAI 2006: 1589-1592 | |
| c25 | David A. Cohen, Martin C. Cooper, Peter Jeavons: An Algebraic Characterisation of Complexity for Valued Constraint. CP 2006: 107-121 | |
| c24 | David A. Cohen, Marc Gyssens, Peter Jeavons: A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems. Complexity of Constraints 2006 | |
| 2005 | ||
| j21 | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: Supermodular functions and the complexity of MAX CSP. Discrete Applied Mathematics 149(1-3): 53-72 (2005) | |
| j20 | Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin: Classifying the Complexity of Constraints Using Finite Algebras. SIAM J. Comput. 34(3): 720-742 (2005) | |
| c23 | David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith: Symmetry Definitions for Constraint Satisfaction Problems. CP 2005: 17-31 | |
| c22 | David A. Cohen, Peter Jeavons, Marc Gyssens: A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition. IJCAI 2005: 72-77 | |
| c21 | Louis W. G. Barton, John A. Caldwell, Peter Jeavons: E-library of medieval chant manuscript transcriptions. JCDL 2005: 320-329 | |
| 2004 | ||
| j19 | Richard Gault, Peter Jeavons: Implementing a Test for Tractability. Constraints 9(2): 139-160 (2004) | |
| j18 | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: A Maximal Tractable Class of Soft Constraints. J. Artif. Intell. Res. (JAIR) 22: 1-22 (2004) | |
| j17 | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: Constraint Satisfaction Problems on Intervals and Length. SIAM J. Discrete Math. 17(3): 453-477 (2004) | |
| c20 | David A. Cohen, Martin C. Cooper, Peter Jeavons: A Complete Characterization of Complexity for Boolean Constraint Optimization Problems. CP 2004: 212-226 | |
| c19 | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: Identifying Efficiently Solvable Cases of Max CSP. STACS 2004: 152-163 | |
| 2003 | ||
| j16 | David A. Cohen, Peter Jeavons, Richard Gault: New Tractable Classes From Old. Constraints 8(3): 263-282 (2003) | |
| j15 | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. J. ACM 50(5): 591-640 (2003) | |
| j14 | Víctor Dalmau, Peter Jeavons: Learnability of quantified formulas. Theor. Comput. Sci. 306(1-3): 485-511 (2003) | |
| c18 | Andrei A. Bulatov, Peter Jeavons: An Algebraic Approach to Multi-sorted Constraints. CP 2003: 183-198 | |
| c17 | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: Soft Constraints: Complexity and Multimorphisms. CP 2003: 244-258 | |
| c16 | Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin: Quantified Constraints: Algorithms and Complexity. CSL 2003: 58-70 | |
| c15 | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: A Maximal Tractable Class of Soft Constraints. IJCAI 2003: 209-214 | |
| c14 | Andrei A. Krokhin, Andrei A. Bulatov, Peter Jeavons: Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. ISMVL 2003: 343- | |
| 2002 | ||
| c13 | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: The Complexity of Constraints on Intervals and Lengths. STACS 2002: 443-454 | |
| 2001 | ||
| j13 | P. S. Umesh Adiga, A. Bhomra, M. G. Turri, A. Nicod, S. R. Datta, Peter Jeavons, Richard Mott, Jonathan Flint: Automatic analysis of agarose gel images. Bioinformatics 17(11): 1084-1089 (2001) | |
| c12 | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. IJCAI 2001: 83-88 | |
| c11 | Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons: The complexity of maximal constraint languages. STOC 2001: 667-674 | |
| i1 | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: The complexity of constraints on intervals and lengths. Electronic Colloquium on Computational Complexity (ECCC)(077) (2001) | |
| 2000 | ||
| j12 | David A. Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis: Building tractable disjunctive constraints. J. ACM 47(5): 826-853 (2000) | |
| c10 | ||
| c9 | Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons: Constraint Satisfaction Problems and Finite Algebras. ICALP 2000: 272-282 | |
| 1999 | ||
| j11 | Peter Jeavons, David A. Cohen, Marc Gyssens: How to Determine the Expressive Power of Constraints. Constraints 4(2): 113-131 (1999) | |
| c8 | ||
| 1998 | ||
| j10 | Peter Jeavons, David A. Cohen, Martin C. Cooper: Constraints, Consistency and Closure. Artif. Intell. 101(1-2): 251-265 (1998) | |
| j9 | Peter Jeavons, David A. Cohen, Justin Pearson: Constraints and Universal Algebra. Ann. Math. Artif. Intell. 24(1-4): 51-67 (1998) | |
| j8 | Peter Jeavons: On the Algebraic Structure of Combinatorial Problems. Theor. Comput. Sci. 200(1-2): 185-204 (1998) | |
| c7 | ||
| 1997 | ||
| j7 | Peter Jeavons, David A. Cohen, Marc Gyssens: Closure properties of constraints. J. ACM 44(4): 527-548 (1997) | |
| c6 | David A. Cohen, Peter Jeavons, Manolis Koubarakis: Tractable Disjunctive Constraints. CP 1997: 478-490 | |
| 1996 | ||
| c5 | David A. Cohen, Marc Gyssens, Peter Jeavons: Derivation of Constraints and Database Relations. CP 1996: 134-148 | |
| c4 | ||
| 1995 | ||
| j6 | Peter Jeavons, Martin C. Cooper: Tractable Constraints on Ordered Domains. Artif. Intell. 79(2): 327-339 (1995) | |
| c3 | Peter Jeavons, David A. Cohen: An Algebraic Characterization of Tractable Constraints. COCOON 1995: 633-642 | |
| c2 | Peter Jeavons, David A. Cohen, Marc Gyssens: A Unifying Framework for Tractable Constraints. CP 1995: 276-291 | |
| 1994 | ||
| j5 | Martin C. Cooper, David A. Cohen, Peter Jeavons: Characterising Tractable Constraints. Artif. Intell. 65(2): 347-361 (1994) | |
| j4 | Marc Gyssens, Peter Jeavons, David A. Cohen: Decomposing Constraint Satisfaction Problems Using Database Techniques. Artif. Intell. 66(1): 57-89 (1994) | |
| j3 | Peter Jeavons: Recovering a Relation from a Decomposition Using Constraint Satisfaction. Inf. Sci. 78(3-4): 229-256 (1994) | |
| j2 | Peter Jeavons, David A. Cohen, John Shawe-Taylor: Generating binary sequences for stochastic computing. IEEE Transactions on Information Theory 40(3): 716-720 (1994) | |
| c1 | Peter Jeavons, David A. Cohen, Martin C. Cooper: A Substitution Operation for Constraints. PPCP 1994: 1-9 | |
| 1993 | ||
| j1 | Peter Jeavons: Counting Representable Sets on Simple Graphs. Discrete Applied Mathematics 47(1): 33-46 (1993) | |
Colors in the list of coauthors
Last update Mon May 20 20:22:05 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page