Skip to main content
Theoretical Computer Science
Michael Blondin's user avatar
Michael Blondin's user avatar
Michael Blondin's user avatar
Michael Blondin
  • Member for 14 years
  • Last seen more than a month ago
Profile Activity
Stats
2,592
reputation
63k
reached
18
answers
0
questions
Communities
View all
About

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

My research lies around the intersection of theoretical computer science and formal methods. My interests revolve around algorithmic verification, automata theory, concurrent and distributed systems, computational complexity theory and logic.

Badges
View all badges
This user doesn’t have any gold badges yet.
21
silver badges
22
bronze badges
Top tags
View all tags
113
Score
8
Posts
44
Posts %
51
Score
2
Posts
11
Posts %
42
Score
2
Posts
11
Posts %
37
Score
2
Posts
11
Posts %
32
Score
3
Posts
17
Posts %
32
Score
3
Posts
17
Posts %
Top posts
View all questions and answers
answer
27
Are there languages that are not in RE nor CO-RE?
Nov 19, 2010
answer
26
Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?
Dec 1, 2010
answer
25
Treewidth and the NL vs L Problem
Mar 2, 2012
answer
24
What are the recent TCS books whose drafts are available online?
Dec 5, 2010
answer
18
(0,1)-vector XOR problem
Feb 26, 2012
answer
17
DFA intersection in subquadratic space?
Oct 2, 2010
answer
13
Universities for Quantum Computing / Information?
Oct 20, 2010
answer
12
Complexity of permutation related problems
Sep 23, 2014
answer
10
Complexity of computing the order of a permutation group
May 10, 2015
answer
10
Presburger arithmetic: is it known to be in $EXPSPACE \setminus EXP$?
Jan 4, 2018
Top network posts
View all network posts
6
Solving formulas in parallel with z3