Dexter Kozen

According to our database, Dexter Kozen authored at least 157 papers between 1976 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

A Demonic Outcome Logic for Randomized Nondeterminism.

Noam Zilberstein, Dexter Kozen, Alexandra Silva, Joseph Tassarotti

CoRR, 2024

A cyclic proof system for Guarded Kleene Algebra with Tests (full version).

Jan Rooduijn, Dexter Kozen, Alexandra Silva

CoRR, 2024

A Cyclic Proof System for Guarded Kleene Algebra with Tests.

Jan Rooduijn, Dexter Kozen, Alexandra Silva

Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

Multisets and Distributions.

Dexter Kozen, Alexandra Silva

Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2023

Formal Abstractions for Packet Scheduling.

Anshuman Mohan, Yunhe Liu, Nate Foster, Tobias Kappé, Dexter Kozen

Proc. ACM Program. Lang., October, 2023

Formal Abstractions for Packet Scheduling.

Anshuman Mohan, Yunhe Liu, Nate Foster, Tobias Kappé, Dexter Kozen

Dataset, September, 2023

Joint Distributions in Probabilistic Semantics.

Dexter Kozen, Alexandra Silva, Erik Voogd

Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity.

Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Abstract Huffman Coding and PIFO Tree Embeddings.

Keri D'Angelo, Dexter Kozen

Proceedings of the Data Compression Conference, 2023

2022

2022 Alonzo Church Award Announcement.

Dexter Kozen

ACM SIGLOG News, October, 2022

Reminiscences of Juris.

Dexter Kozen

SIGACT News, 2022

Coalgebraic tools for randomness-conserving protocols.

Dexter Kozen, Matvey Soloviev

J. Log. Algebraic Methods Program., 2022

Formalizing Moessner's theorem and generalizations in Nuprl.

Mark Bickford, Dexter Kozen, Alexandra Silva

J. Log. Algebraic Methods Program., 2022

Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks.

Jana Wagemaker, Nate Foster, Tobias Kappé, Dexter Kozen, Jurriaan Rot, Alexandra Silva

Proceedings of the Programming Languages and Systems, 2022

2021

Universal Semantics for the Stochastic λ-Calculus.

Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness.

Todd Schmid, Tobias Kappé, Dexter Kozen, Alexandra Silva

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Left-handed completeness.

Dexter Kozen, Alexandra Silva

Theor. Comput. Sci., 2020

Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time.

Steffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé, Dexter Kozen, Alexandra Silva

Proc. ACM Program. Lang., 2020

Semantics of higher-order probabilistic programs with conditioning.

Fredrik Dahlqvist, Dexter Kozen

Proc. ACM Program. Lang., 2020

Universal Semantics for the Stochastic Lambda-Calculus.

Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts

CoRR, 2020

Minimisation in Logical Form.

Nick Bezhanishvili, Marcello M. Bonsangue, Helle Hvid Hansen, Dexter Kozen, Clemens Kupke, Prakash Panangaden, Alexandra Silva

CoRR, 2020

2019

Natural Transformations as Rewrite Rules and Monad Composition.

Dexter Kozen

Log. Methods Comput. Sci., 2019

On Free ω-Continuous and Regular Ordered Algebras.

Zoltán Ésik, Dexter Kozen

Log. Methods Comput. Sci., 2019

Scalable verification of probabilistic networks.

Steffen Smolka, Praveen Kumar, David M. Kahn, Nate Foster, Justin Hsu, Dexter Kozen, Alexandra Silva

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018

Boolean-Valued Semantics for the Stochastic λ-Calculus.

Giorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden, Dana S. Scott

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

The Ackermann Award 2018.

Dexter Kozen, Thomas Schwentick

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

Practical coinduction.

Dexter Kozen, Alexandra Silva

Math. Struct. Comput. Sci., 2017

Well-founded coalgebras, revisited.

Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva

Math. Struct. Comput. Sci., 2017

Completeness and incompleteness in nominal Kleene algebra.

Dexter Kozen, Konstantinos Mamouras, Alexandra Silva

J. Log. Algebraic Methods Program., 2017

CoCaml: Functional Programming with Regular Coinductive Types.

Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva

Fundam. Informaticae, 2017

Infinitary Axiomatization of the Equational Theory of Context-Free Languages.

Niels Bjørn Bugge Grathwohl, Fritz Henglein, Dexter Kozen

Fundam. Informaticae, 2017

Deciding Probabilistic Program Equivalence in NetKAT.

Steffen Smolka, David M. Kahn, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva

CoRR, 2017

Cantor meets scott: semantic foundations for probabilistic networks.

Steffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Unrestricted stone duality for Markov processes.

Robert Furber, Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Nominal Automata with Name Binding.

Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann

Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016

Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming.

Steffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva

CoRR, 2016

Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes.

Dexter Kozen

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Probabilistic NetKAT.

Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, Alexandra Silva

Proceedings of the Programming Languages and Systems, 2016

2015

A Coalgebraic Decision Procedure for NetKAT.

Nate Foster, Dexter Kozen, Mae Milano, Alexandra Silva, Laure Thompson

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Nominal Kleene Coalgebra.

Dexter Kozen, Konstantinos Mamouras, Daniela Petrisan, Alexandra Silva

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

The Ackermann Award 2015.

Anuj Dawar, Dexter Kozen, Simona Ronchi Della Rocca

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

A Metrized Duality Theorem for Markov Processes.

Dexter Kozen, Radu Mardare, Prakash Panangaden

Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

NetkAT: semantic foundations for networks.

Carolyn Jane Anderson, Nate Foster, Arjun Guha, Jean-Baptiste Jeannin, Dexter Kozen, Cole Schlesinger, David Walker

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Kleene Algebra with Equations.

Dexter Kozen, Konstantinos Mamouras

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Citations for the test-of-time award from 1994.

Dexter Kozen

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

KAT + B!

Niels Bjørn Bugge Grathwohl, Dexter Kozen, Konstantinos Mamouras

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Optimal Coin Flipping.

Dexter Kozen

Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

NetKAT - A Formal System for the Verification of Networks.

Dexter Kozen

Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013

On Moessner's Theorem.

Dexter Kozen, Alexandra Silva

Am. Math. Mon., 2013

Reflection in the Chomsky Hierarchy.

Henk Barendregt, Venanzio Capretta, Dexter Kozen

J. Autom. Lang. Comb., 2013

Preface.

Dexter Kozen, Michael W. Mislove

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Strong Completeness for Markovian Logics.

Dexter Kozen, Radu Mardare, Prakash Panangaden

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Stone Duality for Markov Processes.

Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Language Constructs for Non-Well-Founded Computation.

Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva

Proceedings of the Programming Languages and Systems, 2013

Kleene Algebra with Products and Iteration Theories.

Dexter Kozen, Konstantinos Mamouras

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Computing with Capsules.

Jean-Baptiste Jeannin, Dexter Kozen

J. Autom. Lang. Comb., 2012

New.

Dexter Kozen

Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Capsules and Separation.

Jean-Baptiste Jeannin, Dexter Kozen

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

Realization of Coinductive Types.

Dexter Kozen

Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

2010

Church-Rosser Made Easy.

Dexter Kozen

Fundam. Informaticae, 2010

Halting and Equivalence of Program Schemes in Models of Arbitrary Theories.

Dexter Kozen

Proceedings of the Fields of Logic and Computation, 2010

2009

Applications of Metric Coinduction

Dexter Kozen, Nicholas Ruozzi

Log. Methods Comput. Sci., 2009

Learning prediction suffix trees with Winnow.

Nikolaos Karampatziakis, Dexter Kozen

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

2008

Local variable scoping and Kleene algebra with tests.

Kamal Aboul-Hosn, Dexter Kozen

J. Log. Algebraic Methods Program., 2008

The Böhm-Jacopini Theorem Is False, Propositionally.

Dexter Kozen, Wei-Lung Dustin Tseng

Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

Nonlocal Flow of Control and Kleene Algebra with Tests.

Dexter Kozen

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

Preface.

Dexter Kozen

Sci. Comput. Program., 2007

Coinductive Proof Principles for Stochastic Processes.

Dexter Kozen

Log. Methods Comput. Sci., 2007

Collective Inference on Markov Models for Modeling Bird Migration.

Daniel Sheldon, M. A. Saleh Elmohamed, Dexter Kozen

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006

Theory of Computation.

Dexter Kozen

Texts in Computer Science, Springer, ISBN: 978-1-84628-477-9, 2006

Logic, Language, Information and Computation.

Ruy J. G. B. de Queiroz, Dexter Kozen

Theor. Comput. Sci., 2006

KAT-ML: an interactive theorem prover for Kleene algebra with tests.

Kamal Aboul-Hosn, Dexter Kozen

J. Appl. Non Class. Logics, 2006

Relational Semantics for Higher-Order Programs.

Kamal Aboul-Hosn, Dexter Kozen

Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006

On the Representation of Kleene Algebras with Tests.

Dexter Kozen

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Automating Proofs in Category Theory.

Dexter Kozen, Christoph Kreitz, Eva Richter

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005

Kleene Algebra and Bytecode Verification.

Lucja Kot, Dexter Kozen

Proceedings of the First Workshop on Bytecode Semantics, 2005

Supporting workflow in a course management system.

Chavdar Botev, Hubert Chao, Theodore Chao, Yim Cheng, Raymond Doyle, Sergey Grankin, Jon Guarino, Saikat Guha, Pei-Chen Lee, Dan Perry, Christopher Ré, Ilya Rifkin, Tingyan Yuan, Dora Abdullah, Kathy Carpenter, David Gries, Dexter Kozen, Andrew C. Myers, David I. Schwartz, Jayavel Shanmugasundaram

Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, 2005

2004

Some results in dynamic model theory.

Dexter Kozen

Sci. Comput. Program., 2004

Computational inductive definability.

Dexter Kozen

Ann. Pure Appl. Log., 2004

2003

Substructural logic and partial correctness.

Dexter Kozen, Jerzy Tiuryn

ACM Trans. Comput. Log., 2003

Efficient Code Certification for Open Firmware.

Matthew Stillerman, Dexter Kozen

Proceedings of the 3rd DARPA Information Survivability Conference and Exposition (DISCEX-III 2003), 2003

2002

On the Complexity of Reasoning in Kleene Algebra.

Dexter Kozen

Inf. Comput., 2002

Tarskian Set Constraints.

Robert Givan, David A. McAllester, Carl Witty, Dexter Kozen

Inf. Comput., 2002

Eager Class Initialization for Java.

Dexter Kozen, Matthew Stillerman

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002

On two letters versus three.

Dexter Kozen

Proceedings of the Fixed Points in Computer Science, 2002

Malicious Code Detection for Open Firmware.

Frank Adelstein, Matthew Stillerman, Dexter Kozen

Proceedings of the 18th Annual Computer Security Applications Conference (ACSAC 2002), 2002

2001

Dynamic logic.

David Harel, Dexter Kozen, Jerzy Tiuryn

SIGACT News, 2001

On the completeness of propositional Hoare logic.

Dexter Kozen, Jerzy Tiuryn

Inf. Sci., 2001

Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra.

Dexter Kozen

Proceedings of the STACS 2001, 2001

Intuitionistic Linear Logic and Partial Correctness.

Dexter Kozen, Jerzy Tiuryn

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000

On Hoare logic and Kleene algebra with tests.

Dexter Kozen

ACM Trans. Comput. Log., 2000

A note on the complexity of propositional Hoare logic.

Ernie Cohen, Dexter Kozen

ACM Trans. Comput. Log., 2000

Certification of Compiler Optimizations Using Kleene Algebra with Tests.

Dexter Kozen, Maria-Christina Patron

Proceedings of the Computational Logic, 2000

1999

Language-Based Security.

Dexter Kozen

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Parikh's Theorem in Commutative Kleene Algebra.

Mark W. Hopkins, Dexter Kozen

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

Set Constraints and Logic Programming.

Dexter Kozen

Inf. Comput., 1998

Efficient Algorithms for Optimal Video Transmission.

Dexter Kozen, Yaron Minsky, Brian C. Smith

Proceedings of the Data Compression Conference, 1998

1997

Kleene Algebra with Tests.

Dexter Kozen

ACM Trans. Program. Lang. Syst., 1997

Computing the Newtonian Graph.

Dexter Kozen, Kjartan Stefánsson

J. Symb. Comput., 1997

Automata and computability.

Dexter Kozen

Undergraduate texts in computer science, Springer, ISBN: 978-0-387-94907-9, 1997

1996

Rational Spaces and Set Constraints.

Dexter Kozen

Theor. Comput. Sci., 1996

Decomposition of Algebraic Functions.

Dexter Kozen, Susan Landau, Richard Zippel

J. Symb. Comput., 1996

On Regularity-Preserving Functions.

Dexter Kozen

Bull. EATCS, 1996

Kleene Algebra with Tests and Commutativity Conditions.

Dexter Kozen

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

A Complete Gentzen-Style Axiomatization for Set Constraints.

Allan Cheng, Dexter Kozen

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Kleene Algebra with Tests: Completeness and Decidability.

Dexter Kozen, Frederick Smith

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995

Decidability of Systems of Set Constraints with Negative Constraints

Alexander Aiken, Dexter Kozen, Edward L. Wimmers

Inf. Comput., October, 1995

Efficient Recursive Subtyping.

Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach

Math. Struct. Comput. Sci., 1995

Rabin Measures.

Nils Klarlund, Dexter Kozen

Chic. J. Theor. Comput. Sci., 1995

1994

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

Dexter Kozen

Inf. Comput., May, 1994

Optimal Bounds for the Change-Making Problem.

Dexter Kozen, Shmuel Zaks

Theor. Comput. Sci., 1994

Efficient Inference of Partial Types.

Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach

J. Comput. Syst. Sci., 1994

Efficient Average-Case Algorithms for the Modular Group

Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu

Electron. Colloquium Comput. Complex., 1994

Efficient Resolution of Singularities of Plane Curves.

Dexter Kozen

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

Logical Aspects of Set Constraints.

Dexter Kozen

Proceedings of the Computer Science Logic, 7th Workshop, 1993

The Complexity of Set Constraints.

Alexander Aiken, Dexter Kozen, Moshe Y. Vardi, Edward L. Wimmers

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

On the Myhill-Nerode theorem theorem for trees.

Dexter Kozen

Bull. EATCS, 1992

Design and Analysis of Algorithms.

Dexter Campbell Kozen

Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4612-4400-4, 1992

1991

Rabin Measures and Their Applications to Fairness and Automata Theory

Nils Klarlund, Dexter Kozen

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1990

On Kleene Algebras and Closed Semirings.

Dexter Kozen

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Logics of Programs.

Dexter Kozen, Jerzy Tiuryn

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Definability with Bounded Number of Bound Variables

Neil Immerman, Dexter Kozen

Inf. Comput., November, 1989

Polynomial Decomposition Algorithms.

Dexter Kozen, Susan Landau

J. Symb. Comput., 1989

1988

A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots.

Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari

SIAM J. Comput., 1988

A finite model theorem for the propositional μ-calculus.

Dexter Kozen

Stud Logica, 1988

1987

Functional Decomposition of Polynomials

Joachim von zur Gathen, Dexter Kozen, Susan Landau

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Fast parallel orthogonalization.

Dexter Kozen

SIGACT News, 1986

The Complexity of Elementary Algebra and Geometry.

Michael Ben-Or, Dexter Kozen, John H. Reif

J. Comput. Syst. Sci., 1986

Limits for Automatic Verification of Finite-State Concurrent Systems.

Krzysztof R. Apt, Dexter Kozen

Inf. Process. Lett., 1986

1985

A Probabilistic PDL.

Dexter Kozen

J. Comput. Syst. Sci., 1985

A Zero-One Law for Logic with a Fixed-Point Operator

Andreas Blass, Yuri Gurevich, Dexter Kozen

Inf. Control., 1985

NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching.

Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985

Algebraic Cell Decomposition in NC (Preliminary Version)

Dexter Kozen, Chee-Keng Yap

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

A Programming Language for the Inductive Sets, and Applications

David Harel, Dexter Kozen

Inf. Control., 1984

Pebblings, Edgings, and Equational Logic

Dexter Kozen

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

The Complexity of Elementary Algebra and Geometry (Preliminary Abstract)

Michael Ben-Or, Dexter Kozen, John H. Reif

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Generalized Fair Termination.

Nissim Francez, Dexter Kozen

Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

1983

Results on the Propositional mu-Calculus.

Dexter Kozen

Theor. Comput. Sci., 1983

A Decision Procedure for the Propositional µ-Calculus.

Dexter Kozen, Rohit Parikh

Proceedings of the Logics of Programs, 1983

1982

Process Logic: Expressiveness, Decidability, Completeness.

David Harel, Dexter Kozen, Rohit Parikh

J. Comput. Syst. Sci., 1982

Results on the Propositional µ-Calculus.

Dexter Kozen

Proceedings of the Automata, 1982

1981

An Elementary Proof of the Completness of PDL.

Dexter Kozen, Rohit Parikh

Theor. Comput. Sci., 1981

Semantics of Probabilistic Programs.

Dexter Kozen

J. Comput. Syst. Sci., 1981

Alternation.

Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer

J. ACM, 1981

Communication: Positive First-Order Logic is NP-Complete.

Dexter Kozen

IBM J. Res. Dev., 1981

On Induction vs. *-Continuity.

Dexter Kozen

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

1980

Indexings of Subrecursive Classes.

Dexter Kozen

Theor. Comput. Sci., 1980

Complexity of Boolean Algebras.

Dexter Kozen

Theor. Comput. Sci., 1980

A Representation Theorem for Models of *-Free PDL.

Dexter Kozen

Proceedings of the Automata, 1980

1979

On the Duality of Dynamic Algebras and Kripke Models.

Dexter Kozen

Proceedings of the Logics of Programs, Workshop, ETH Zürich, May-July 1979, 1979

Automata and planar graphs.

Dexter Kozen

Proceedings of the Fundamentals of Computation Theory, 1979

1978

A clique problem equivalent to graph isomorphism.

Dexter Kozen

SIGACT News, 1978

Indexing of Subrecursive Classes

Dexter Kozen

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs)

Manuel Blum, Dexter Kozen

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977

Complexity of Finitely Presented Algebras

Dexter Kozen

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

Lower Bounds for Natural Proof Systems

Dexter Kozen

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

On Parallelism in Turing Machines

Dexter Kozen

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976