Theoretical Computer Science
Meta user
Network profile
2,482
reputation
16
21

Michael Blondin

Assistant professor of computer science at the Université de Sherbrooke (Canada).

My research lies at the intersection of formal methods and theoretical computer science. My interests include formal verification, model checking of concurrent and distributed systems, computational complexity theory, automata theory, logic and verification tools.

18
answers
0
questions
~52k
people reached

Communities (7)

Top network posts

Top tags (32)

Score 108
Posts 8
Posts % 44
Score 50
Posts 2
Score 40
Posts 2
Score 37
Posts 2
Score 31
Posts 3
Score 31
Posts 3
View all tags →

Top posts (18) All Questions Answers | Votes Newest

25 Why do we consider log-space as a model of efficient computation (instead of polylog-space) ? Dec 1 '10
25 Treewidth and the NL vs L Problem Mar 2 '12
24 What are the recent TCS books whose drafts are available online? Dec 5 '10
24 Are there languages that are not in RE nor CO-RE? Nov 19 '10
16 (0,1)-vector XOR problem Feb 26 '12
15 DFA intersection in subquadratic space? Oct 2 '10
13 Universities for Quantum Computing / Information? Oct 20 '10
11 Complexity of permutation related problems Sep 23 '14
10 Presburger arithmetic: is it known to be in $EXPSPACE \setminus EXP$? Jan 4 '18
10 Complexity of Membership-Testing for finite abelian groups Nov 19 '11
View all questions and answers →

Badges (37)

Gold

—

Silver

16

Rarest

Bronze

21

Rarest

View all badges →