Travelled to:1 × Denmark
1 × Finland
1 × Germany
1 × Hungary
1 × New Zealand
1 × Portugal
1 × Switzerland
1 × The Netherlands
2 × Austria
3 × Italy
4 × USA
Collaborated with:P.Tesson D.A.M.Barrington P.McKenzie M.Beaudry F.Lemieux T.Schwentick H.Vollmer C.Lautemann A.Chattopadhyay T.Wilke ∅ B.Borchert K.Lange F.Stephan M.Koucký P.Pudlák A.Baziramwabo J.Raymond H.Straubing W.Thomas N.Immerman N.Schweikardt
Talks about:languag (4) automata (3) regular (3) complex (3) circuit (3) depth (3) two (3) correspond (2) hierarchi (2) quantifi (2)
Person: Denis Thérien
DBLP: Th=eacute=rien:Denis
Contributed to:
2006
2005
2005
2004200520032001
20012000199919981998199719891988198719871979Wrote 19 papers:
- CSL-2006-LautemannTT #algebra
- An Algebraic Point of View on the Crane Beach Property (CL, PT, DT), pp. 426–440.
- ICALP-2005-BeaudryLT #regular expression
- Groupoids That Recognize Only Regular Languages (MB, FL, DT), pp. 421–433.
- ICALP-2005-TessonT #communication #complexity #strict
- Restricted Two-Variable Sentences, Circuits and Communication Complexity (PT, DT), pp. 526–538.
- STOC-2005-KouckyPT #bound
- Bounded-depth circuits: separating wires from gates (MK, PP, DT), pp. 257–265.
- DLT-2004-BorchertLSTT #polynomial
- The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels (BB, KJL, FS, PT, DT), pp. 89–101.
- DLT-J-2004-BorchertLSTT05 #polynomial
- The dot-depth and the polynomial hierarchies correspond on the delta levels (BB, KJL, FS, PT, DT), pp. 625–644.
- ICALP-2003-ChattopadhyayT #category theory #commutative
- Locally Commutative Categories (AC, DT), pp. 984–995.
- DLT-2001-SchwentickTV #automaton
- Partially-Ordered Two-Way Automata: A New Characterization of DA (TS, DT, HV), pp. 239–250.
- LICS-2001-BarringtonILST
- The Crane Beach Conjecture (DAMB, NI, CL, NS, DT), pp. 187–196.
- ICALP-2000-McKenzieSTV
- The Many Faces of a Translation (PM, TS, DT, HV), pp. 890–901.
- LICS-1999-BaziramwaboMT #composition #logic
- Modular Temporal Logic (AB, PM, DT), pp. 344–351.
- ICALP-1998-RaymondTT #algebra #approach #communication #complexity
- An Algebraic Approach to Communication Complexity (JFR, PT, DT), pp. 29–40.
- STOC-1998-TherienW #quantifier #word
- Over Words, Two Variables Are as Powerful as One Quantifier Alternation (DT, TW), pp. 234–240.
- ICALP-1997-BeaudryLT #finite
- Finite Loops Recognize Exactly the Regular Open Languages (MB, FL, DT), pp. 110–120.
- ICALP-1989-McKenzieT #automaton #complexity
- Automata Theory Meets Circuit Complexity (PM, DT), pp. 589–602.
- ICALP-1988-StraubingTT #quantifier #regular expression
- regular Languages Defined with Generalized Quantifiers (HS, DT, WT), pp. 561–575.
- ICALP-1987-BarringtonT #automaton
- Non-Uniform Automata Over Groups (DAMB, DT), pp. 163–173.
- STOC-1987-BarringtonT #finite #monad
- Finite Monoids and the Fine Structure of NC¹ (DAMB, DT), pp. 101–109.
- ICALP-1979-Therien
- Languages of Nilpotent and Solvable Groups (DT), pp. 616–632.