Denis Thérien

Computer Science · Physical Sciences

29h-index3.5kcitations120works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(89), Advanced Algebra and Logic(29), Logic, programming, and type systems(27), Computability, Logic, AI Algorithms(26), Complexity and Algorithms in Graphs(23)

Publications120 total

Societal Alignment Frameworks Can Improve LLM Alignment
arXiv (Cornell University)·2025Open Access
From Machine Learning to Robotics: Challenges and Opportunities for Embodied Intelligence
arXiv (Cornell University)·2021· 33 citedOpen Access
From Machine Learning to Robotics: Challenges and Opportunities for\n Embodied Intelligence
arXiv (Cornell University)·2021· 8 citedOpen Access
A deep learning framework for neuroscience
Nature Neuroscience·2019· 1.0k citedOpen Access
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
Theory of Computing Systems·2013· 1 citedOpen Access
The Power of Diversity
Lecture notes in computer science·2011· 2 cited
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
Lecture notes in computer science·2011· 1 cited
WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY
International Journal of Algebra and Computation·2010· 3 cited
10061 Executive Summary – Circuits, Logic, and Games
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2010Open Access
10061 Abstracts Collection – Circuits, Logic, and Games
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2010Open Access
An Algebraic Perspective on Boolean Function Learning
Lecture notes in computer science·2009· 8 cited
Algebraic Results on Quantum Automata
2008
Star-Free Open Languages and Aperiodic Loops
Lecture notes in computer science·2007· 5 cited
Languages with Bounded Multiparty Communication Complexity
Lecture notes in computer science·2007· 2 cited
Logic Meets Algebra: the Case of Regular Languages
Logical Methods in Computer Science·2007· 40 citedOpen Access
06451 Abstracts Collection – Circuits, Logic, and Games
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2007Open Access
06451 Executive Summary – Circuits, Logic, and Games
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2007Open Access
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games
2006· 21 cited
Finite automata and computational complexity
Lecture notes in computer science·2006· 2 cited
Bridges between Algebraic Automata Theory and Complexity Theory.
2006· 5 cited
page 1 of 6Next →

Frequent Co-authors

Howard Straubing(9), Pierre McKenzie(9), Pascal Tesson(7), David A. Mix Barrington(5), Thomas Wilke(3), Martin Beaudry(3), Clemens Lautemann(3), Heribert Vollmer(3), Blake A. Richards(2), Philippe Beaudoin(2), Yoshua Bengio(2), Patricia Bouyer(2), Antoine Petit(2), Thomas Schwentick(2), Hervé Caussinus(2), Wolfgang Thomas(2), Jean-Éric Pin(2), Alexis Maciel(2), Pierre Péladeau(2), Michal Koucký(2)