Theoretical Computer Science
Michaël Cadilhac's user avatar
Michaël Cadilhac's user avatar
Michaël Cadilhac's user avatar
Michaël Cadilhac
  • Member for 13 years, 3 months
  • Last seen more than a week ago
Profile Activity
Stats
3,946
reputation
258k
reached
20
answers
20
questions
Communities
About

Assistant professor of computer science at DePaul University.

Theoretical computer sciencist. Main interests in language theory, circuit complexity, algebraic language theory, and descriptive complexity.

Badges
View all badges
This user doesn’t have any gold badges yet.
22
silver badges
39
bronze badges
Top tags
View all tags
54
Score
16
Posts
40
Posts %
53
Score
12
Posts
30
Posts %
52
Score
9
Posts
22
Posts %
37
Score
5
Posts
12
Posts %
34
Score
7
Posts
18
Posts %
19
Score
5
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
47
An NP-complete variant of factoring.
Feb 7, 2011
answer
30
What papers should everyone read?
Sep 12, 2010
answer
20
What videos should everybody watch?
Sep 12, 2010
question
19
To what extent MSO = WS1S, when adding relations?
Aug 16, 2010
question
17
Which $AC^0$ problems are not "truly feasible"?
Sep 1, 2010
question
17
Completeness and Context-Sensitive Languages.
Oct 3, 2010
question
16
Compared growth of the number of syntactic classes and Nerode classes.
Aug 17, 2010
answer
16
(False?) proof for computability of a function?
Oct 6, 2010
answer
15
Finding a finite model
Apr 13, 2011
answer
15
Regular language that discriminates between two deterministic CFGs
Dec 16, 2017

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.