Christian Michaux

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:53/4201 · DBLP profile ↗

← Back

11ranked-venue papers

5as first author

0since 2021 · last 2009

0000-0002-3783-2658ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 5 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Automata and formal languages · 67% Computational complexity · 33%

Topics — the 2 heaviest of 3, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Automata and formal languages › infinite words cobham's theorem	0.0	1	1993	Cobham's Ttheorem seen through Büchi's Theorem · ICALP 1993
Computational complexity descriptive complexity	0.0	1	1993	Cobham's Ttheorem seen through Büchi's Theorem · ICALP 1993

Year	Publication	Venue	Position
2009	Cell decomposition and dimension function in the theory of closed ordered differential fields Thomas Brihaye, Christian Michaux, Cédric Rivière	Ann. Pure Appl. Log.	2
2006	Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478] Thomas Brihaye, Christian Michaux	J. Complex.	2
2005	On the expressiveness and decidability of o-minimal hybrid systems Thomas Brihaye, Christian Michaux	J. Complex.	2
2001	Preface Catherine Finet, Christian Michaux	Ann. Pure Appl. Log.	2
2000	A Note on Non-complete Problems in NPImage Shai Ben-David, Klaus Meer, Christian Michaux	J. Complex.	3
2000	Isomorphism theorem for BSS recursively enumerable sets over real closed fields Christian Michaux, Christophe Troestler	Theor. Comput. Sci.	1
1998	Isomorphism Theorem for BSS Recursiveley Enumerable Sets over Real Closed Fields Christian Michaux, Christophe Troestler	MCU (1)	1
1996	Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems Christian Michaux, Roger Villemaire	Ann. Pure Appl. Log.	1
1994	P != NP over the Nonstandard Reals Implies P != NP over R Christian Michaux	Theor. Comput. Sci.	1
1993	Cobham's Ttheorem seen through Büchi's Theorem Christian Michaux, Roger Villemaire	ICALP	1
1991	Stochastic Automata and Length Distributions of Rational Languages Georges Hansel, Daniel Krob, Christian Michaux	MFCS	3