Dexter Kozen | Academic Influence

Dexter Kozen's AcademicInfluence.com Rankings

Dexter Kozen

Computer Science

#1115

World Rank

#1155

Historical Rank

#588

USA Rank

Theoretical Computer Science

#24

World Rank

#24

Historical Rank

#9

USA Rank

computer-science Degrees

Dexter Kozen

Mathematics

#2107

World Rank

#3305

Historical Rank

#842

USA Rank

Measure Theory

#442

World Rank

#633

Historical Rank

#188

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Dexter Kozen's Degrees

PhD Computer Science Stanford University

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Dexter Kozen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Dexter Campbell Kozen is an American theoretical computer scientist. He is Joseph Newton Pew, Jr. Professor in Engineering at Cornell University. He received his B.A. from Dartmouth College in 1974 and his PhD in computer science in 1977 from Cornell University, where he was advised by Juris Hartmanis. He advised numerous Ph.D. students.

(See a Problem?)

Dexter Kozen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Results on the Propositional mu-Calculus (1983) (1537)
Results on the Propositional µ-Calculus (1982) (1323)
Dynamic logic (2001) (871)
A completeness theorem for Kleene algebras and the algebra of regular events (1991) (730)
Semantics of probabilistic programs (1979) (572)
Kleene algebra with tests (1997) (540)
Logics of Programs (1991) (476)
Lower bounds for natural proof systems (1977) (470)
NetKAT: semantic foundations for networks (2014) (424)
Limits for Automatic Verification of Finite-State Concurrent Systems (1986) (418)
Automata and Computability (1997) (393)
A probabilistic PDL (1983) (371)
The complexity of elementary algebra and geometry (1984) (289)
The Design and Analysis of Algorithms (1991) (282)
On the power of the compass (or, why mazes are easier to search than graphs) (1978) (206)
On Kleene Algebras and Closed Semirings (1990) (193)
Process logic: Expressiveness, decidability, completeness (1980) (192)
On Hoare logic and Kleene algebra with tests (1999) (189)
Complexity of finitely presented algebras (1977) (179)
Definability with Bounded Number of Bound Variables (1989) (156)
Kleene Algebra with Tests: Completeness and Decidability (1996) (135)
An Elementary Proof of the Completness of PDL (1981) (124)
On parallelism in turing machines (1976) (116)
Polynomial Decomposition Algorithms (1989) (113)
Certification of Compiler Optimizations Using Kleene Algebra with Tests (2000) (111)
The Complexity of Set Constraints (1993) (104)
Efficient recursive subtyping (1992) (102)
A finite model theorem for the propositional μ-calculus (1988) (101)
A Coalgebraic Decision Procedure for NetKAT (2015) (96)
A Zero-One Law for Logic with a Fixed-Point Operator (1986) (82)
Language-Based Security (1999) (79)
A Decision Procedure for the Propositional µ-Calculus (1983) (77)
Decidability of Systems of Set Constraints with Negative Constraints (1994) (76)
Probabilistic NetKAT (2016) (76)
Automata on Guarded Strings and Applications (2001) (74)
A fast parallel algorithm for determining all roots of a polynomial with real roots (1986) (72)
Algebraic cell decomposition in NC (1985) (70)
On Action Algebras (1994) (67)
The Complexity of Kleene Algebra with Tests (1996) (67)
A Representation Theorem for Models of *-Free PDL (1980) (67)
Efficient inference of partial types (1992) (65)
Kleene Algebra with Tests and Program Schematology (2001) (64)
Efficient Code Certification (1998) (62)
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching (1985) (60)
Typed Kleene Algebra (1998) (60)
Practical coinduction (2016) (60)
Complexity of Boolean Algebras (1980) (59)
Theory of Computation (2006) (58)
A Theory of Interleavers (1997) (57)
Indexings of Subrecursive Classes (1980) (56)
On the Duality of Dynamic Algebras and Kripke Models (1979) (56)
On Induction vs. *-Continuity (1981) (55)
On the complexity of reasoning in Kleene algebra (1997) (50)
A Programming Language for the Inductive Sets, and Applications (1982) (47)
Tarskian set constraints (1996) (45)
On the Myhill-Nerode Theorem for Trees (1992) (45)
Communication: Positive First-Order Logic is NP-Complete (1981) (45)
Parikh's theorem in commutative Kleene algebra (1999) (42)
Theory of Computation (Texts in Computer Science) (2006) (42)
Interleaver design methods for turbo codes (1998) (41)
Computation with polynomial systems (1999) (41)
Collective Inference on Markov Models for Modeling Bird Migration (2007) (40)
Generalized fair termination (1984) (40)
Depth-First and Breadth-First Search (1992) (40)
Kleene Algebra with Tests and Commutativity Conditions (1996) (40)
Malicious code detection for open firmware (2002) (39)
Ecien t Inference of Partial Types (1994) (38)
Cantor meets Scott: semantic foundations for probabilistic networks (2016) (37)
Functional decomposition of polynomials (1987) (37)
KAT-ML: an interactive theorem prover for Kleene algebra with tests (2006) (37)
Set Constraints and Logic Programming (1994) (37)
On the completeness of propositional Hoare logic (2001) (36)
Semantics of higher-order probabilistic programs with conditioning (2019) (35)
Logical Aspects of Set Constraints (1993) (34)
Rabin measures and their applications to fairness and automata theory (1991) (34)
Automata and planar graphs (1979) (33)
Kleene Algebra with Tests and the Static Analysis of Programs (2003) (32)
Nominal Kleene Coalgebra (2015) (30)
Equational Verification of Cache Blocking in LU Decomposition using Kleene Algebra with Tests (2002) (29)
Stone Duality for Markov Processes (2013) (29)
A clique problem equivalent to graph isomorphism (1978) (29)
Supporting workflow in a course management system (2005) (29)
Optimal Bounds for the Change-Making Problem (1991) (29)
Computing with Capsules (2012) (25)
Nominal Automata with Name Binding (2016) (25)
Substructural logic and partial correctness (2003) (25)
Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time (2019) (24)
CoCaml: Functional Programming with Regular Coinductive Types (2017) (23)
Efficient algorithms for optimal video transmission (1998) (22)
On the Coalgebraic Theory of Kleene Algebra with Tests (2017) (22)
Decomposition of Algebraic Functions (1994) (22)
Nonlocal Flow of Control and Kleene Algebra with Tests (2008) (21)
On the Elimination of Hypotheses in Kleene Algebra with Tests (2002) (21)
Applications of Metric Coinduction (2007) (21)
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra (2001) (21)
The Böhm-Jacopini Theorem Is False, Propositionally (2008) (21)
On Regularity-Preserving Functions (1995) (20)
Kleene Algebra with Equations (2014) (20)
Partial Automata and Finitely Generated Congruences: An Extension of Nerode’s Theorem (1992) (19)
On Hoare Logic, Kleene Algebra, and Types (1999) (19)
Language Constructs for Non-Well-Founded Computation (2012) (19)
Automating Proofs in Category Theory (2006) (18)
Completeness and incompleteness in nominal Kleene algebra (2015) (18)
On the Complexity of the Horn Theory of REL (2003) (17)
Strong Completeness for Markovian Logics (2013) (16)
Parallel Resultant Computation (1990) (16)
ALEX an Alexical Programming Language (1987) (16)
Scalable verification of probabilistic networks (2019) (16)
Some results in dynamic model theory (2002) (16)
Coinductive Proof Principles for Stochastic Processes (2006) (15)
Indexing of subrecursive classes (1978) (15)
Kleene Algebra and Bytecode Verification (2005) (14)
The Planar Separator Theorem (1992) (14)
Boolean-Valued Semantics for the Stochastic λ-Calculus (2018) (13)
Left-Handed Completeness (2012) (13)
Two-Way Finite Automata (1977) (13)
CoCaml: Programming with Coinductive Types (2012) (12)
On Distance Coloring (2007) (11)
Rational Spaces and Set Constraints (1995) (11)
Efficient Resolution of Singularities of Plane Curves (1994) (11)
Relational Semantics for Higher-Order Programs (2006) (11)
NetKAT - A Formal System for the Verification of Networks (2014) (11)
Local variable scoping and Kleene algebra with tests (2006) (10)
NC Algorithms for Comparability Graphs, Interval Graphs, and Unique Perfect Matchings (1986) (10)
On the Myhill-Nerode theorem theorem for trees (1992) (10)
Efficient average-case algorithms for the modular group (1994) (10)
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness (2021) (10)
Semantics of Probabilistic Programming: A Gentle Introduction (2020) (10)
Eager Class Initialization for Java (2002) (10)
Realization of Coinductive Types (2011) (9)
On Moessner's Theorem (2011) (9)
On the Representation of Kleene Algebras with Tests (2006) (8)
Ecien t Recursive Subtyping (1995) (8)
Rabin Measures (1995) (8)
Unrestricted stone duality for Markov processes (2017) (7)
Infinitary Axiomatization of the Equational Theory of Context-Free Languages (2013) (7)
Logics of Programs: Workshop Carnegie Mellon University Pittsburgh, PA, June 6-8, 1983 (1984) (7)
Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes (2016) (7)
A note on the complexity of propositional Hoare logic (2000) (7)
Computing the Newtonian Graph (1997) (7)
Second-Order Abstract Interpretation via Kleene Algebra (2004) (7)
A Complete Gentzen-Style Axiomatization for Set Constraints (1996) (7)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs (1983) (6)
Language-Based Security for Malicious Mobile Code (2007) (6)
Finitely Presented Algebras and the Polynomial Time Hiercharchy (1977) (6)
Counting Problems and #P (1992) (6)
Publication/Citation: A Proof-Theoretic Approach to Mathematical Knowledge Management (2007) (6)
Capsules and Separation (2012) (5)
The Chomsky—Schützenberger Theorem (1977) (5)
Universal Semantics for the Stochastic λ-Calculus (2021) (5)
On two letters versus three (2002) (5)
Pebblings, edgings, and equational logic (1984) (5)
Intuitionistic linear logic and partial correctness (2001) (5)
Algebraic Cell Decomposition in NC (Preliminary Version) (1985) (5)
Fast parallel orthogonalization (1986) (5)
Well-founded coalgebras, revisited (2013) (5)
Indefinite Summation and the Kronecker Delta (2007) (5)
Kleene Algebra with Products and Iteration Theories (2013) (4)
Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming (2016) (4)
A Minimization Algorithm (1977) (4)
The horn theory of relational kleene algebra (2005) (4)
Lexicographic Flow (2009) (4)
Minimisation in Logical Form (2020) (4)
Toward the Automation of Category Theory (2004) (4)
Deciding Probabilistic Program Equivalence in NetKAT (2017) (4)
Efficient code certification for open firmware (2003) (3)
Optimal Coin Flipping (2014) (3)
Coalgebraic Tools for Randomness-Conserving Protocols (2018) (3)
Halting and Equivalence of Schemes over Recursive Theories (2002) (3)
Transcript of panel discussion (1982) (3)
Relational Semantics of Local Variable Scoping (2005) (3)
Learning prediction suffix trees with Winnow (2009) (3)
First Order Predicate Logic Without Negation is NP-Complete (1977) (3)
Deterministic Pushdown Automata (1977) (3)
Random Search Trees (1992) (2)
Propositional Dynamic Logic (2000) (2)
Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks (2022) (2)
Nondeterministic Finite Automata (1977) (2)
Formalizing Moessner's theorem and generalizations in Nuprl (2021) (2)
I. Fundamental Concepts (1959) (2)
Csanky’s Algorithm (1992) (1)
Context-Free Grammars and Languages (1977) (1)
Computational inductive definability (2004) (1)
III First-Order Dynamic Logic (2000) (1)
Universal Semantics for the Stochastic Lambda-Calculus (2020) (1)
Formalizing Moessner ’ s Theorem in N UPRL (2011) (1)
Pushdown Automata and Context-Free Languages (1977) (1)
Logics of programs : workshop, Yorktown Heights, New York, May 1981 (1982) (1)
The Cocke—Kasami—Younger Algorithm (1977) (1)
A Metrized Duality Theorem for Markov Processes (2014) (1)
Limitations of Finite Automata (1977) (1)
Formal Abstractions for Packet Scheduling (2022) (1)
Kleene Algebra and Regular Expressions (1997) (1)
Automata and Computability (1977) (1)
Luby’s Algorithm (1992) (1)
Some Notes on Rational Spaces (1996) (1)
Relational Semantics for Higher-Order Functional Programs (2006) (1)
Myhill—Nerode Relations (1977) (1)
Typed Kleene Algebra with Products and Iteration Theories (2013) (1)
Relationships with Static Logics (2000) (0)
Mathematics of program construction : 7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004 : proceedings (2004) (0)
Analysis of Luby’s Algorithm (1992) (0)
Audio System for Technical Readings All Rights Reserved Audio System for Technical Readings Biographical Sketch List of Tables List of Figures (1994) (0)
A Programming Language for the Inductive and Applications * (2005) (0)
Probabilistic Tests with Polynomials (1992) (0)
Computational inductive de nability (2004) (0)
Still More on Max Flow (1992) (0)
Applications of Tree Automata in Rewriting, Logic and Programming (Dagstuhl Seminar 9743) (2021) (0)
Chistov’s Algorithm (1992) (0)
Integer Arithmetic in NC (1992) (0)
Multisets and Distributions (2023) (0)
A Conversation with Dexter Kozen (2015) (0)
The Fast Fourier Transform (FFT) (1992) (0)
More NP-Complete Problems (1992) (0)
Logic of Programs, Workshop (1981) (0)
Citations for the test-of-time award from 1994 (2014) (0)
The λ-Calculus (1977) (0)
Hints for Selected Miscellaneous Exercises (1977) (0)
Natural Transformations as Rewrite Rules and Monad Composition (2004) (0)
Linear Equations and Polynomial GCDs (1992) (0)
Planar and Plane Graphs (1992) (0)
More on Turing Machines (1997) (0)
Reductions and NP -Completeness (1992) (0)
Notation and Abbreviations (2000) (0)
Regular Expressions with Dynamic Name Binding (2015) (0)
Timed Modal Specifications........ 8 (0)
Universal Machines and Diagonalization (1977) (0)
Kleene Algebra with Tests : Comple tenes s and Decidabi l i ty (0)
Still More NP-Complete Problems (1992) (0)
L O ] 8 J ul 2 01 8 Coalgebraic Tools for Randomness-Conserving Protocols (2018) (0)
On Teaching Left-Handed Children to Write (1987) (0)
More on Regular Sets (1997) (0)
Automata on Terms (1977) (0)
L O ] 1 4 M ay 2 02 1 Universal Semantics for the Stochastic λ-Calculus (2021) (0)
Reasoning About Programs (2000) (0)
Parikh’s Theorem (1977) (0)
DFA State Minimization (1977) (0)
Algebraic Complexity and Parallelism (Dagstuhl Seminar 9230) (2021) (0)
Topological Sort and MST (1992) (0)
Set Constaints and Logic Programming (1994) (0)
Simulating NPDAs by CFGs (1977) (0)
Pattern Matching and Regular Expressions (1977) (0)
Church-Rosser Made Easy (2010) (0)
The Myhill—Nerode Theorem (1977) (0)
ALEX-AN ALEXI CAL PROGRAMMING LANGUAGE (1990) (0)
Variants of DL (2000) (0)
Excluded-minor Characterization of Apex-outerplanar Graphs List of Figures 2.1 Starting List of Excluded Minors for O (0)
Collapsing Nondeterministic Automata (1977) (0)
Probabilistic Program Equivalence for NetKAT (2017) (0)
The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) (1984) (0)
Analysis of Union-Find (1992) (0)
Analysis of Miller’s Primality Test (1992) (0)
Regular Expressions and Finite Automata (1997) (0)
Matroids and Independence (1992) (0)
The Ackermann Award 2015 (2015) (0)
Hypercubes and the Gray Representation (1992) (0)
Proof of the Incompleteness Theorem (1977) (0)
Undecidable Problems About CFLs (1977) (0)
Parallel Algorithms and NC (1992) (0)
On Free ω-Continuous and Regular Ordered Algebras (2016) (0)
Reflection in the Chomsky Hierarchy (2013) (0)
Negative set constraints : an easy proof of decidability (2013) (0)
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories (2010) (0)
The Myhill—Nerode Theorem for Term Automata (1977) (0)
Final State Versus Empty Stack (1977) (0)
Other Variants of PDL (2000) (0)
Filtration and Decidability (2000) (0)
The Subset Construction (1977) (0)
More on Kleene Algebra (1992) (0)
Gödel’s Incompleteness Theorem (1977) (0)
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity (2023) (0)
AppMon: Application Monitors for Not-Yet-Trusted Software (2007) (0)
Complexity of PDL (2000) (0)
Miller’s Primality Test (1992) (0)
Solutions to Selected Miscellaneous Exercises (1977) (0)
Mathematics of Program Construction (2004) (0)
Turing Machines and Effective Computability (1977) (0)
Preface (2007) (0)
Course Roadmap and Historical Perspective (1977) (0)
PDAs and CFGs (1977) (0)
On Disintegration in Probabilistic Semantics (2018) (0)
Counting Bipartite Matchings (1992) (0)
2DFAs and Regular Sets (1977) (0)
Borel Coalgebra and Non-Wellfounded Logic (2017) (0)
Applications of Kleene Algebra (Dagstuhl Seminar 01081) (2021) (0)
II Propositional Dynamic Logic (2000) (0)
The Pumping Lemma for CFLs (1977) (0)
Shortest Paths and Transitive Closure (1992) (0)
Parallel computing as a commodity (1998) (0)
More on Max Flow (1992) (0)
The Ackermann Award 2018 (2018) (0)
Strings and Sets (1977) (0)
Citation for the Test-of-Time Award from LICS 1995 (2015) (0)
Theory of computatio (2013) (0)
Abstract Huffman Coding and PIFO Tree Embeddings (2023) (0)
Algorithms and Their Complexity (1992) (0)
Themes Complexity Theory ’ 94 In the months of August and September , 1994 (0)
Logic, Language, Information, and Computation (2014) (0)
More on Matching (1992) (0)
Using the Pumping Lemma (1977) (0)
Gödel’s Proof (1977) (0)
Finite Automata and Regular Sets (1977) (0)
2022 Alonzo Church Award Announcement (2022) (0)
Computing the Newtonian Graph (Extended abstract) (1993) (0)
Online Learning of Prediction Sux Trees (2009) (0)
Decidable and Undecidable Problems (1997) (0)
Separability in Domain Semirings (2004) (0)
More on Reductions and NP-Completeness (1992) (0)

This paper list is powered by the following services:

Other Resources About Dexter Kozen

en.wikipedia.org

What Schools Are Affiliated With Dexter Kozen?

Dexter Kozen is affiliated with the following schools: