Tom Kelsey

	2011
17		Tom Kelsey, Lars Kotthoff: Exact Closest String as a Constraint Satisfaction Problem. Procedia CS 4: 1062-1071 (2011)
	2010
16		Tom Kelsey, Lars Kotthoff: The Exact Closest String Problem as a Constraint Satisfaction Problem CoRR abs/1005.0089: (2010)
	2009
15		Andreas Distler, Tom Kelsey: The monoids of orders eight, nine & ten. Ann. Math. Artif. Intell. 56(1): 3-21 (2009)
	2008
14		Andreas Distler, Tom Kelsey: The Monoids of Order Eight and Nine. AISC/MKM/Calculemus 2008: 61-76
	2007
13		Ian P. Gent, Tom Kelsey, S. A. Linton, J. Pearson, Colva M. Roney-Dougal: Groupoids and Conditional Symmetry. CP 2007: 823-830
12		Ian P. Gent, Christopher Jefferson, Tom Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M. Smith, Armagan Tarim: Search in the patience game 'Black Hole'. AI Commun. 20(3): 211-226 (2007)
	2005
11		Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith: Conditional Symmetry Breaking. CP 2005: 256-270
10		Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal: Symmetry and Consistency. CP 2005: 271-285
9		Hanne Gottliebsen, Tom Kelsey, Ursula Martin: Hidden verification for computational mathematics. J. Symb. Comput. 39(5): 539-567 (2005)
	2004
8		Tom Kelsey, Steve Linton, Colva M. Roney-Dougal: New Developments in Symmetry Breaking in Search Using Computational Group Theory. AISC 2004: 199-210
7		Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton: Tractable Symmetry Breaking Using Restricted Search Trees. ECAI 2004: 211-215
6		Richard J. Boulton, Hanne Gottliebsen, Ruth Hardy, Tom Kelsey, Ursula Martin: Design Verification for Control Engineering. IFM 2004: 21-35
	2003
5		Ian P. Gent, Warwick Harvey, Tom Kelsey, Steve Linton: Generic SBDD Using Computational Group Theory. CP 2003: 333-347
	2002
4		Ian P. Gent, Warwick Harvey, Tom Kelsey: Groups and Constraints: Symmetry Breaking during Search. CP 2002: 415-430
	2001
3		Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom Kelsey, Ursula Martin, Sam Owre: Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS. TPHOLs 2001: 27-42
	1999
2		Martin Dunstan, Tom Kelsey, Ursula Martin, Steve Linton: Formal Methods for Extensions to CAS. World Congress on Formal Methods 1999: 1758-1777
	1998
1		Martin Dunstan, Tom Kelsey, Steve Linton, Ursula Martin: Lightweight Formal Methods for Computer Algebra Systems. ISSAC 1998: 80-87

Coauthor Index

1	Andrew Adams	[3]
2	Richard J. Boulton	[6]
3	Andreas Distler	[14] [15]
4	Martin Dunstan	[1] [2] [3]
5	Ian P. Gent	[4] [5] [7] [10] [11] [12] [13]
6	Hanne Gottliebsen	[3] [6] [9]
7	Ruth Hardy	[6]
8	Warwick Harvey	[4] [5]
9	Christopher Jefferson	[12]
10	Lars Kotthoff	[16] [17]
11	S. A. Linton	[13]
12	Steve Linton	[1] [2] [5] [7] [8] [10] [11]
13	Inês Lynce	[12]
14	Ursula Martin	[1] [2] [3] [6] [9]
15	Iain McDonald	[11]
16	Ian Miguel	[11] [12]
17	Peter Nightingale	[12]
18	Sam Owre	[3]
19	J. Pearson	[13]
20	Colva M. Roney-Dougal	[7] [8] [10] [13]
21	Barbara M. Smith	[11] [12]
22	Armagan Tarim (S. Armagan Tarim)	[12]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page