default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Jeavons 0001
Peter G. Jeavons
Person information
- affiliation: University of Oxford, UK
Other persons with the same name
- Peter Jeavons 0002 (aka: Peter J. Jeavons) — National Institute of Standards and Technology, Boulder, CO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j45]Artem Kaznatcheev
, David A. Cohen, Peter Jeavons:
Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search. J. Artif. Intell. Res. 69: 1077-1102 (2020)- [c51]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Galois Connections for Patterns: An Algebra of Labelled Graphs. GKR 2020: 125-150
2010 – 2019
- 2019
- [j44]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binary constraint satisfaction problems defined by excluded topological minors. Inf. Comput. 264: 12-31 (2019) - [c50]Artem Kaznatcheev, David A. Cohen, Peter G. Jeavons:
Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search. CP 2019: 300-316 - [i12]Artem Kaznatcheev, David A. Cohen, Peter G. Jeavons:
Representing fitness landscapes by valued constraints to understand the complexity of local search. CoRR abs/1907.01218 (2019) - 2017
- [j43]David A. Cohen, Peter G. Jeavons:
The power of propagation: when GAC is enough. Constraints An Int. J. 22(1): 3-23 (2017) - [j42]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný:
Binarisation for Valued Constraint Satisfaction Problems. SIAM J. Discret. Math. 31(4): 2279-2300 (2017) - [c49]Wenting Zhao, Mark H. Liffiton, Peter Jeavons, Dan Roberts:
Finding Graph Decompositions via SAT. ICTAI 2017: 131-138 - 2016
- [j41]Peter Jeavons, Alex Scott, Lei Xu:
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring. Distributed Comput. 29(5): 377-393 (2016) - [c48]Peter G. Jeavons, Andrius Vaicenavicius, Stanislav Zivný:
Minimal Weighted Clones with Boolean Support. ISMVL 2016: 90-95 - [i11]Peter Jeavons, Alex D. Scott, Lei Xu:
Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring. CoRR abs/1601.04306 (2016) - [i10]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný:
Binarisation for Valued Constraint Satisfaction Problems. CoRR abs/1608.01628 (2016) - [i9]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors. CoRR abs/1608.05358 (2016) - 2015
- [j40]Lei Xu, Peter Jeavons:
Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies. Int. J. Neural Syst. 25(7): 1550025:1-1550025:19 (2015) - [j39]Lei Xu, Peter Jeavons:
Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge. Inf. Sci. 316: 550-566 (2015) - [j38]Daniel Nichol, Peter Jeavons, Alexander G. Fletcher, Robert A. Bonomo, Philip K. Maini, Jerome L. Paul, Robert A. Gatenby, Alexander R. A. Anderson, Jacob G. Scott:
Steering Evolution with Sequential Therapy to Prevent the Emergence of Bacterial Antibiotic Resistance. PLoS Comput. Biol. 11(9) (2015) - [c47]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binarisation via Dualisation for Valued Constraints. AAAI 2015: 3731-3737 - [c46]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. IJCAI 2015: 1945-1951 - 2014
- [j37]Peter Jeavons, Andrei A. Krokhin, Stanislav Zivný:
The Complexity of Valued Constraint Satisfaction. Bull. EATCS 113 (2014) - [c45]Lei Xu, Peter Jeavons:
Led by nature: Distributed leader election in anonymous networks. ICNC 2014: 445-450 - [p1]Peter G. Jeavons, Stanislav Zivný:
Tractable Valued Constraints. Tractability 2014: 105-140 - [i8]Peter Jeavons, Justyna Petke:
Local Consistency and SAT-Solvers. CoRR abs/1401.4613 (2014) - 2013
- [j36]Christopher Jefferson, Peter Jeavons, Martin James Green, Marc R. C. van Dongen:
Representing and solving finite-domain constraint problems using systems of polynomials. Ann. Math. Artif. Intell. 67(3-4): 359-382 (2013) - [j35]Lei Xu, Xiangxiang Zeng, Peter Jeavons:
A Polynomial-Time Solution to Constraint Satisfaction Problems by Neural-like P Systems. Int. J. Unconv. Comput. 9(5-6): 465-481 (2013) - [j34]Lei Xu, Peter G. Jeavons:
Simple Neural-Like P Systems for Maximal Independent Set Selection. Neural Comput. 25(6): 1642-1659 (2013) - [j33]David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Discrete Optimization. SIAM J. Comput. 42(5): 1915-1939 (2013) - [c44]David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný:
Tractable Combinations of Global Constraints. CP 2013: 230-246 - [c43]Alex Scott, Peter Jeavons, Lei Xu:
Feedback from nature: an optimal distributed algorithm for maximal independent set selection. PODC 2013: 147-156 - [i7]David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný:
Tractable Combinations of Global Constraints. CoRR abs/1307.2867 (2013) - 2012
- [j32]Peter Jeavons, Justyna Petke:
Local Consistency and SAT-Solvers. J. Artif. Intell. Res. 43: 329-351 (2012) - [i6]David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Discrete Optimisation. CoRR abs/1207.6692 (2012) - [i5]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 Zivný:
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 - [i4]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 Zivný, Peter G. Jeavons:
Classes of submodular constraints expressible by graph cuts. Constraints An Int. J. 15(3): 430-452 (2010) - [c37]Justyna Petke, Peter Jeavons:
Local Consistency and SAT-Solvers. CP 2010: 398-413
2000 – 2009
- 2009
- [j29]Stanislav Zivný, David A. Cohen, Peter G. Jeavons:
The expressive power of binary submodular functions. Discret. Appl. Math. 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]Stanislav Zivný, Peter G. Jeavons:
The Complexity of Valued Constraint Models. CP 2009: 833-841 - [c35]Peter Jeavons:
Presenting Constraints. FTP 2009 - [c34]Stanislav Zivný, David A. Cohen, Peter G. Jeavons:
The Expressive Power of Binary Submodular Functions. MFCS 2009: 744-757 - [c33]Peter Jeavons:
Presenting Constraints. TABLEAUX 2009: 1-15 - 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 Zivný:
The expressive power of valued constraints: Hierarchies and collapses. Theor. Comput. Sci. 409(1): 137-153 (2008) - [c32]Stanislav Zivný, Peter Jeavons:
Classes of Submodular Constraints Expressible by Graph Cuts. CP 2008: 112-127 - [c31]András Z. Salamon, Peter G. Jeavons:
Perfect Constraints Are Tractable. CP 2008: 524-528 - [c30]Martin C. Cooper, Peter G. Jeavons, András Z. Salamon:
Hybrid tractable CSPs which generalize tree structure. ECAI 2008: 530-534 - [i3]Stanislav Zivný, David A. Cohen, Peter G. Jeavons:
The Expressive Power of Binary Submodular Functions. CoRR abs/0811.1885 (2008) - 2007
- [c29]Gaofeng Huang, Peter Jeavons, Dominic Kwiatkowski:
Exact and Heuristic Approaches for Identifying Disease-Associated SNP Motifs. APBC 2007: 175-184 - [c28]Gaofeng Huang, Peter Jeavons:
A Geometrical Model for the SNP Motif Identification Problem. BIBE 2007: 395-402 - [c27]David A. Cohen, Peter Jeavons, Stanislav Zivný:
The Expressive Power of Valued Constraints: Hierarchies and Collapses. CP 2007: 798-805 - [c26]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 An Int. J. 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. J. Comput. Biol. 13(4): 929-945 (2006) - [c25]David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith:
Constraint Symmetry and Solution Symmetry. AAAI 2006: 1589-1592 - [c24]David A. Cohen, Martin C. Cooper, Peter Jeavons:
An Algebraic Characterisation of Complexity for Valued Constraint. CP 2006: 107-121 - [r1]David A. Cohen, Peter Jeavons:
The Complexity of Constraint Languages. Handbook of Constraint Programming 2006: 245-280 - [i2]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. Discret. Appl. Math. 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 An Int. J. 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. 22: 1-22 (2004) - [j17]Andrei A. Krokhin, Peter Jeavons, Peter Jonsson:
Constraint Satisfaction Problems on Intervals and Length. SIAM J. Discret. 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 An Int. J. 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-354 - 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, Maria Grazia Turri, A. Nicod, S. R. Datta, Peter Jeavons, Richard Mott, Jonathan Flint:
Automatic analysis of agarose gel images. Bioinform. 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. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j12]David A. Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis:
Building tractable disjunctive constraints. J. ACM 47(5): 826-853 (2000) - [c10]David A. Cohen, Peter Jeavons, Richard Gault:
New Tractable Classes from Old. CP 2000: 160-171 - [c9]Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons:
Constraint Satisfaction Problems and Finite Algebras. ICALP 2000: 272-282
1990 – 1999
- 1999
- [j11]Peter Jeavons, David A. Cohen, Marc Gyssens:
How to Determine the Expressive Power of Constraints. Constraints An Int. J. 4(2): 113-131 (1999) - [c8]Víctor Dalmau, Peter Jeavons:
Learnability of Quantified Formulas. EuroCOLT 1999: 63-78 - 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]Peter Jeavons:
Constructing Constraints. CP 1998: 2-16 - 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]Peter Jeavons, David A. Cohen, Marc Gyssens:
A test for Tractability. CP 1996: 267-281 - 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 Trans. Inf. 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. Discret. Appl. Math. 47(1): 33-46 (1993)
Coauthor Index
[j45] [c51] [j44] [c50] [i12] [j43] [j42] [i10] [i9] [c47] [c46] [j33] [c44] [i7] [i6] [c40] [i4] [j29] [c34] [j27] [j26] [j25] [i3] [c27] [j24] [j23] [c25] [c24] [r1] [i2] [j21] [c23] [c22] [j18] [c20] [c19] [j16] [c17] [c15] [j12] [c10] [j11] [j10] [j9] [j7] [c6] [c5] [c4] [c3] [c2] [j5] [j4] [j2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
