The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Michaux: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  13. Cell decomposition and dimension function in the theory of closed ordered differential fields. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002