Olivier Bournez

	2009
43		Olivier Bournez, Igor Potapov: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings Springer 2009
42		Olivier Bournez, Johanne Cohen: Learning Equilibria in Games by Stochastic Distributed Algorithms CoRR abs/0907.1916: (2009)
41		Olivier Bournez, Manuel Lameiras Campagnolo: A Survey on Continuous Time Computations CoRR abs/0907.3117: (2009)
40		Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler: On the Convergence of Population Protocols When Population Goes to Infinity CoRR abs/0907.3118: (2009)
39		Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner: Verification of Timed Automata Using Rewrite Rules and Strategies CoRR abs/0907.3123: (2009)
38		Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler: Population Protocols that Correspond to Symmetric Games CoRR abs/0907.3126: (2009)
37		Dominique Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton: Distributed Learning of Equilibria in a Routing Game. Parallel Processing Letters 19(2): 189-204 (2009)
	2008
36		Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler: Playing With Population Protocols CSP 2008: 3-15
35		Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen: Distributed Learning of Wardrop Equilibria. UC 2008: 19-32
	2007
34		Olivier Bournez, Emmanuel Hainry: On the Computational Capabilities of Several Models. MCU 2007: 12-23
33		Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry: Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complexity 23(3): 317-335 (2007)
	2006
32		Olivier Bournez, Florent Garnier: Proving Positive Almost Sure Termination Under Strategies. RTA 2006: 357-371
31		Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry: The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC 2006: 631-643
30		Olivier Bournez: How much can analog and hybrid systems be proved (super-)Turing. Applied Mathematics and Computation 178(1): 58-71 (2006)
29		Olivier Bournez, Liliana Ibanescu, Hélène Kirchner: From Chemical Rules to Term Rewriting. Electr. Notes Theor. Comput. Sci. 147(1): 113-134 (2006)
28		Olivier Bournez, Emmanuel Hainry: Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundam. Inform. 74(4): 409-433 (2006)
27		Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204(2): 210-230 (2006)
	2005
26		Olivier Bournez, Florent Garnier: Proving Positive Almost-Sure Termination. RTA 2005: 323-337
25		Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. J. Log. Comput. 15(1): 41-58 (2005)
24		Olivier Bournez, Emmanuel Hainry: Elementarily computable functions over the real numbers and R-sub-recursive functions. Theor. Comput. Sci. 348(2-3): 130-147 (2005)
	2004
23		Olivier Bournez, Emmanuel Hainry: An Analog Characterization of Elementarily Computable Functions over the Real Numbers. ICALP 2004: 269-280
22		Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. IFIP TCS 2004: 409-422
21		Olivier Bournez, Emmanuel Hainry: Real Recursive Functions and Real Extensions of Recursive Functions. MCU 2004: 116-127
	2003
20		Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS 2003: 185-199
19		Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu: Automated Generation of Kinetic Chemical Mechanisms Using Rewriting. International Conference on Computational Science 2003: 367-376
18		Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu: A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms. RTA 2003: 30-45
17		Olivier Bournez, Mathieu Hoyrup: Rewriting Logic and Probabilities. RTA 2003: 61-75
16		Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electr. Notes Theor. Comput. Sci. 90(1): (2003)
	2002
15		Olivier Bournez: A Generalization of Equational Proof Theory? PAPM-PROBMIV 2002: 207-208
14		Olivier Bournez, Claude Kirchner: Probabilistic Rewrite Strategies. Applications to ELAN. RTA 2002: 252-266
13		Olivier Bournez, Michael S. Branicky: The Mortality Problem for Matrices of Low Dimensions. Theory Comput. Syst. 35(4): 433-448 (2002)
	2001
12		Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner: Verification of Timed Automata Using Rewrite Rules and Strategies CoRR cs.PL/0109024: (2001)
11		Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis: The Stability of Saturated Linear Dynamical Systems Is Undecidable. J. Comput. Syst. Sci. 62(3): 442-462 (2001)
10		Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis: Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. 255(1-2): 687-696 (2001)
	2000
9		Eugene Asarin, Thao Dang, Oded Maler, Olivier Bournez: Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems. HSCC 2000: 20-31
8		Olivier Bournez, Oded Maler: On the Representation of Timed Polyhedra. ICALP 2000: 793-807
7		Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis: The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS 2000: 479-490
	1999
6		Olivier Bournez, Oded Maler, Amir Pnueli: Orthogonal Polyhedra: Representation and Computation. HSCC 1999: 46-60
5		Olivier Bournez: Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy. Theor. Comput. Sci. 210(1): 21-71 (1999)
4		Olivier Bournez: Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. Theory Comput. Syst. 32(1): 35-67 (1999)
	1998
3		Patrick Gros, Olivier Bournez, Edmond Boyer: Using Local Planar Geometric Invariants to Match and Model Images of Line Segments. Computer Vision and Image Understanding 69(2): 135-155 (1998)
	1997
2		Olivier Bournez: Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). ICALP 1997: 143-153
	1996
1		Olivier Bournez, Michel Cosnard: On the Computational Power of Dynamical Systems and Hybrid Systems. Theor. Comput. Sci. 168(2): 417-459 (1996)

Coauthor Index

1	Eugene Asarin	[9]
2	Dominique Barth	[35] [37]
3	Emmanuel Beffara	[12] [39]
4	Vincent D. Blondel	[7] [10] [11]
5	Octave Boussaton	[35] [37]
6	Edmond Boyer	[3]
7	Michael S. Branicky	[13]
8	Manuel Lameiras Campagnolo	[31] [33] [41]
9	Jérémie Chalopin	[36] [38]
10	Philippe Chassaing	[40]
11	Johanne Cohen	[35] [36] [37] [38] [40] [42]
12	Guy-Marie Côme	[18] [19]
13	Valérie Conraud	[18] [19]
14	Michel Cosnard	[1]
15	Felipe Cucker	[16] [20] [22] [25] [27]
16	Thao Dang	[9]
17	Florent Garnier	[26] [32]
18	Lucas Gerin	[40]
19	Daniel S. Graça	[31] [33]
20	Patrick Gros	[3]
21	Emmanuel Hainry	[21] [23] [24] [28] [31] [33] [34]
22	Mathieu Hoyrup	[17]
23	Liliana Ibanescu	[18] [19] [29]
24	Hassen Kacem	[12] [39]
25	Claude Kirchner	[12] [14] [39]
26	Hélène Kirchner	[18] [19] [29]
27	Xavier Koegler	[36] [38] [40]
28	Pascal Koiran	[7] [10] [11]
29	Oded Maler	[6] [8] [9]
30	Jean-Yves Marion	[16] [20] [22] [25] [27]
31	Paulin Jacobé de Naurois	[16] [20] [22] [25] [27]
32	Christos H. Papadimitriou	[10]
33	Amir Pnueli	[6]
34	Igor Potapov	[43]
35	John N. Tsitsiklis	[7] [10] [11]

Colors in the list of coauthors