2026 Dexter Kozen: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	61	3004	2915	1472	1416	312	21756

Research.com Recognitions

2016 - W. Wallace McDowell Award, IEEE Computer Society For groundbreaking contributions to topics ranging from computational complexity, to the analysis of algebraic computations, to logics of programs and verification.
2015 - European Association for Theoretical Computer Science (EATCS) Fellow For pioneering and seminal work in fields as diverse as complexity theory, logics of programs, algebra, computer algebra and probabilistic semantics
2008 - Fellow of the American Association for the Advancement of Science (AAAS)
2003 - ACM Fellow For contributions to theoretical computer science.
1991 - Fellow of John Simon Guggenheim Memorial Foundation

Overview

Dexter Kozen is affiliated with Cornell University in the United States and has a research focus primarily within the field of Computer Science. Their work spans multiple subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Hardware and Architecture, and General Health Professions.

Kozen's research topics cover various areas such as Logic, programming, and type systems, Formal Methods in Verification, Logic, Reasoning, and Knowledge, Advanced Algebra and Logic, Network Packet Processing and Optimization, Semantic Web and Ontologies, and Software Testing and Debugging Techniques.

The scientist has published extensively, with notable recent papers including:

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness (2021) in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Formal Abstractions for Packet Scheduling (2023) in Proceedings of the ACM on Programming Languages
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity (2023) in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Formalizing Moessner's theorem and generalizations in Nuprl (2021) in Journal of Logical and Algebraic Methods in Programming
A Demonic Outcome Logic for Randomized Nondeterminism (2025) in Proceedings of the ACM on Programming Languages

Frequent co-authors collaborating with Kozen include:

Alexandra Silva
Tobias Kappé
Nate Foster
Prakash Panangaden
Jana Wagemaker

The venues where Kozen's work has been frequently published include:

arXiv (Cornell University)
Proceedings of the ACM on Programming Languages
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Journal of Logical and Algebraic Methods in Programming
Lecture notes in computer science

In addition to journal and conference papers, Kozen has authored a book titled "Automata and Computability," published in 2020 by the European Organization for Nuclear Research.

Throughout their career, Kozen has been recognized by several professional organizations, receiving:

W. Wallace McDowell Award, IEEE Computer Society (2016) for contributions spanning computational complexity, algebraic computation analysis, and program logics and verification
European Association for Theoretical Computer Science (EATCS) Fellow (2015) for seminal work in complexity theory, program logics, algebra, and probabilistic semantics
Fellow of the American Association for the Advancement of Science (AAAS) (2008)
ACM Fellow (2003) for contributions to theoretical computer science
Fellow of John Simon Guggenheim Memorial Foundation (1991)

Best Publications

Results on the propositional μ-calculus

Dexter Kozen

3122
Citations
Dynamic Logic

David Harel;Dexter Kozen;Jerzy Tiuryn

2185
Citations
Semantics of probabilistic programs

Dexter Kozen

1375
Citations
A completeness theorem for Kleene algebras and the algebra of regular events

D. Kozen

946
Citations
The complexity of elementary algebra and geometry

Michael Ben-Or;Dexter Kozen;John Reif

736
Citations
Automata and Computability

Dexter C. Kozen

720
Citations
Kleene algebra with tests

Dexter Kozen

700
Citations
A probabilistic PDL

Dexter Kozen

626
Citations
Lower bounds for natural proof systems

Dexter Kozen

586
Citations
The design and analysis of algorithms

Dexter C. Kozen

570
Citations
Limits for automatic verification of finite-state concurrent systems

K R Apt;D C Kozen

563
Citations
NetKAT: semantic foundations for networks

Carolyn Jane Anderson;Nate Foster;Arjun Guha;Jean-Baptiste Jeannin

491
Citations
Logics of Programs.

Dexter Kozen;Jerzy Tiuryn

461
Citations
Results on the Propositional µ-Calculus

Dexter Kozen

393
Citations
On the power of the compass (or, why mazes are easier to search than graphs)

Manuel Blum;Dexter Kozen

316
Citations
Process logic: Expressiveness, decidability, completeness

David Harel;Dexter Kozen;Rohit Parikh;Rohit Parikh

261
Citations
On Kleene algebras and closed semirings

Dexter Kozen

252
Citations
Complexity of finitely presented algebras

Dexter Kozen

249
Citations
An elementary proof of the completeness of PDL

Dexter Kozen;Rohit Parikh;Rohit Parikh

245
Citations
On Hoare logic and Kleene algebra with tests

Dexter Kozen

235
Citations
Design and Analysis of Algorithms

Guy Even;Dror Rawitz

5
Citations

Frequent Co-Authors

David Harel Weizmann Institute of Science

Nate Foster Cornell University

Michael I. Schwartzbach Aarhus University

Jens Palsberg University of California, Los Angeles

Prakash Panangaden McGill University

Michael Ben-Or Hebrew University of Jerusalem

Alex Aiken Stanford University

John H. Reif Duke University

Jin-Yi Cai University of Wisconsin–Madison

Umesh Vazirani University of California, Berkeley

External Links

Wikipedia of Dexter Kozen Personal website of Dexter Kozen Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

The field of computer science is closely connected to other dynamic STEM disciplines with growing online education options. If you’re interested in accelerating your career, you might consider an accelerated cs degree—a flexible way to fast-track your studies and enter the workforce sooner.

For those drawn to the intersection of technology and environmental impact, an environmental engineering bachelor's degree online can open doors in sustainability, consulting, and project management.

Another pathway, especially for students interested in design and problem solving, is to pursue online mechanical engineering degrees. These programs blend theory with practical skills for careers in manufacturing, robotics, and aeronautics.

Curious about the foundations of technology and scientific discovery? Many ask, can you get a physics degree online? The answer is yes—allowing you to study theoretical concepts and advance toward research or teaching careers, fully online.

Each of these related online degrees offers unique advantages, preparing students for diverse and high-demand career pathways both within and beyond computer science.