| 2006 |
|---|
| 12 | EE | Thomas Brihaye,
Christian Michaux:
Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478].
J. Complexity 22(3): 431-434 (2006) |
| 2005 |
|---|
| 11 | EE | Thomas Brihaye,
Christian Michaux:
On the expressiveness and decidability of o-minimal hybrid systems.
J. Complexity 21(4): 447-478 (2005) |
| 2004 |
|---|
| 10 | EE | Thomas Brihaye,
Christian Michaux,
Cédric Rivière,
Christophe Troestler:
On O-Minimal Hybrid Systems.
HSCC 2004: 219-233 |
| 2001 |
|---|
| 9 | | Catherine Finet,
Christian Michaux:
Preface.
Ann. Pure Appl. Logic 111(1-2): 1-2 (2001) |
| 2000 |
|---|
| 8 | EE | Shai Ben-David,
Klaus Meer,
Christian Michaux:
A Note on Non-complete Problems in NPImage.
J. Complexity 16(1): 324-332 (2000) |
| 7 | EE | Christian Michaux,
Christophe Troestler:
Isomorphism theorem for BSS recursively enumerable sets over real closed fields.
Theor. Comput. Sci. 231(2): 253-273 (2000) |
| 1998 |
|---|
| 6 | | Christian Michaux,
Christophe Troestler:
Isomorphism Theorem for BSS Recursiveley Enumerable Sets over Real Closed Fields.
MCU (1) 1998: 116-139 |
| 1996 |
|---|
| 5 | | Christian Michaux,
Roger Villemaire:
Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems.
Ann. Pure Appl. Logic 77(3): 251-277 (1996) |
| 1994 |
|---|
| 4 | | Christian Michaux:
P != NP over the Nonstandard Reals Implies P != NP over R.
Theor. Comput. Sci. 133(1): 95-104 (1994) |
| 1993 |
|---|
| 3 | | Christian Michaux,
Roger Villemaire:
Cobham's Ttheorem seen through Büchi's Theorem.
ICALP 1993: 325-334 |
| 1991 |
|---|
| 2 | | Georges Hansel,
Daniel Krob,
Christian Michaux:
Stochastic Automata and Length Distributions of Rational Languages.
MFCS 1991: 181-190 |
| 1983 |
|---|
| 1 | | Irene Kowarski,
Christian Michaux:
MIDOC: A Microcomputer System for the Management of Structured Documents.
IFIP Congress 1983: 567-572 |
