default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Michaux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[e1]Javier Esparza, Christian Michaux, Charles Steinhorn:
Finite and Algorithmic Model Theory. London Mathematical Society Lecture Note Series 379, Cambridge University Press 2011, ISBN 978-0-521-71820-2 [contents]
2000 – 2009
- 2009
- [j8]Thomas Brihaye, Christian Michaux
, Cédric Rivière:
Cell decomposition and dimension function in the theory of closed ordered differential fields. Ann. Pure Appl. Log. 159(1-2): 111-128 (2009) - 2006
- [j7]Thomas Brihaye, Christian Michaux:
Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478]. J. Complex. 22(3): 431-434 (2006) - 2005
- [j6]Thomas Brihaye, Christian Michaux:
On the expressiveness and decidability of o-minimal hybrid systems. J. Complex. 21(4): 447-478 (2005) - 2004
- [c5]Thomas Brihaye, Christian Michaux, Cédric Rivière, Christophe Troestler:
On O-Minimal Hybrid Systems. HSCC 2004: 219-233 - 2001
- [j5]Catherine Finet, Christian Michaux:
Preface. Ann. Pure Appl. Log. 111(1-2): 1-2 (2001) - 2000
- [j4]Shai Ben-David, Klaus Meer, Christian Michaux:
A Note on Non-complete Problems in NPImage. J. Complex. 16(1): 324-332 (2000) - [j3]Christian Michaux, Christophe Troestler:
Isomorphism theorem for BSS recursively enumerable sets over real closed fields. Theor. Comput. Sci. 231(2): 253-273 (2000)
1990 – 1999
- 1998
- [c4]Christian Michaux, Christophe Troestler:
Isomorphism Theorem for BSS Recursiveley Enumerable Sets over Real Closed Fields. MCU (1) 1998: 116-139 - 1996
- [j2]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. Log. 77(3): 251-277 (1996) - 1994
- [j1]Christian Michaux:
P != NP over the Nonstandard Reals Implies P != NP over R. Theor. Comput. Sci. 133(1): 95-104 (1994) - 1993
- [c3]Christian Michaux, Roger Villemaire:
Cobham's Ttheorem seen through Büchi's Theorem. ICALP 1993: 325-334 - 1991
- [c2]Georges Hansel, Daniel Krob, Christian Michaux:
Stochastic Automata and Length Distributions of Rational Languages. MFCS 1991: 181-190
1980 – 1989
- 1983
- [c1]Irène Kowarski, Christian Michaux:
MIDOC: A Microcomputer System for the Management of Structured Documents. IFIP Congress 1983: 567-572
1970 – 1979
- 1973
- [b1]Christian Michaux:
Une information sur les matrices de covariance : la liaison-information. Joseph Fourier University, Grenoble, France, 1973
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
