Jean-Marc Talbot

	2009
27		Françoise Gire, Jean-Marc Talbot: Nested Sibling Tree Automata. ITA 43(2): 379-402 (2009)
	2008
26		Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Tree Automata with Global Constraints. Developments in Language Theory 2008: 314-326
	2007
25		Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Satisfiability of a Spatial Logic with Tree Variables. CSL 2007: 130-145
24		Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison: Polynomial time fragments of XPath with variables. PODS 2007: 205-214
	2006
23		Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison: Composing Monadic Queries in Trees. PLAN-X 2006: 61-70
	2005
22		Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison: N-Ary Queries by Tree Automata. DBPL 2005: 217-231
21		Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison: N-ary Queries by Tree Automata. Foundations of Semistructured Data 2005
20		Iovka Boneva, Jean-Marc Talbot, Sophie Tison: Expressiveness of a Spatial Logic for Trees. LICS 2005: 280-289
19		Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos: Monotone AC-Tree Automata. LPAR 2005: 337-351
18		Iovka Boneva, Jean-Marc Talbot: Automata and Logics for Unranked and Unordered Trees. RTA 2005: 500-515
17		Iovka Boneva, Jean-Marc Talbot: When ambients cannot be opened. Theor. Comput. Sci. 333(1-2): 127-169 (2005)
	2004
16		Iovka Boneva, Jean-Marc Talbot: On Complexity of Model-Checking for the TQL Logic. IFIP TCS 2004: 381-394
	2003
15		Iovka Boneva, Jean-Marc Talbot: When Ambients Cannot Be Opened. FoSSaCS 2003: 169-184
14		Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot: Model checking mobile ambients. Theor. Comput. Sci. 308(1-3): 277-331 (2003)
	2002
13		Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot: Finite-Control Mobile Ambients. ESOP 2002: 295-313
12		Witold Charatonik, Jean-Marc Talbot: Atomic Set Constraints with Projection. RTA 2002: 311-325
	2001
11		Witold Charatonik, Jean-Marc Talbot: The Decidability of Model Checking Mobile Ambients. CSL 2001: 339-354
10		Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot: The Complexity of Model Checking Mobile Ambients. FoSSaCS 2001: 152-167
	2000
9		Jean-Marc Talbot: On the Alternation-Free Horn Mu-calculus. LPAR 2000: 418-435
8		Witold Charatonik, Andreas Podelski, Jean-Marc Talbot: Paths vs. Trees in Set-Based Program Analysis. POPL 2000: 330-337
7		Jean-Marc Talbot, Philippe Devienne, Sophie Tison: Generalized Definite Set Constraints. Constraints 5(1/2): 161-202 (2000)
6		Jean-Marc Talbot: The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard. Inf. Process. Lett. 74(1-2): 27-33 (2000)
	1999
5		Joachim Niehren, Martin Müller, Jean-Marc Talbot: Entailment of Atomic Set Constraints is PSPACE-Complete. LICS 1999: 285-294
	1998
4		Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Co-definite Set Constraints with Membership Expressions. IJCSLP 1998: 25-39
	1997
3		Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Solving Classes of Set Constraints with Tree Automata. CP 1997: 62-76
2		Jean-Marc Talbot, Sophie Tison, Philippe Devienne: Set-Based Analysis for Logic Programming and Tree Automata. SAS 1997: 127-140
	1996
1		Nirina Andrianarivelo, Wadoud Bousdira, Jean-Marc Talbot: On Theorem-Proving in Horn Theories with Built-in Algebras. AISMC 1996: 320-338

Coauthor Index

1	Nirina Andrianarivelo	[1]
2	Iovka Boneva	[15] [16] [17] [18] [20]
3	Wadoud Bousdira	[1]
4	Witold Charatonik	[8] [10] [11] [12] [13] [14]
5	Silvano Dal-Zilio	[10] [14]
6	Philippe Devienne	[2] [3] [4] [7]
7	Emmanuel Filiot	[23] [24] [25] [26]
8	Françoise Gire	[27]
9	Andrew D. Gordon (Andy Gordon)	[10] [13] [14]
10	Supratik Mukhopadhyay	[10] [14]
11	Martin Müller	[5]
12	Joachim Niehren	[5] [21] [22] [23] [24]
13	Hitoshi Ohsaki	[19]
14	Laurent Planque	[21] [22]
15	Andreas Podelski	[8]
16	Yves Roos	[19]
17	Sophie Tison	[2] [3] [4] [7] [19] [20] [21] [22] [23] [24] [25] [26]

Colors in the list of coauthors