The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dexter Kozen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer
    Alternation. [Citation Graph (14, 0)][DBLP]
    J. ACM, 1981, v:28, n:1, pp:114-133 [Journal]
  2. Dexter Kozen, Chee-Keng Yap
    Algebraic Cell Decomposition in NC (Preliminary Version) [Citation Graph (5, 0)][DBLP]
    FOCS, 1985, pp:515-521 [Conf]
  3. Michael Ben-Or, Dexter Kozen, John H. Reif
    The Complexity of Elementary Algebra and Geometry. [Citation Graph (5, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:2, pp:251-264 [Journal]
  4. Dexter Kozen
    Complexity of Finitely Presented Algebras [Citation Graph (4, 0)][DBLP]
    STOC, 1977, pp:164-177 [Conf]
  5. Neil Immerman, Dexter Kozen
    Definability with Bounded Number of Bound Variables [Citation Graph (4, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:2, pp:121-139 [Journal]
  6. Andreas Blass, Yuri Gurevich, Dexter Kozen
    A Zero-One Law for Logic with a Fixed-Point Operator [Citation Graph (3, 0)][DBLP]
    Information and Control, 1985, v:67, n:1-3, pp:70-90 [Journal]
  7. Michael Ben-Or, Dexter Kozen, John H. Reif
    The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:457-464 [Conf]
  8. David Harel, Dexter Kozen
    A Programming Language for the Inductive Sets, and Applications [Citation Graph (1, 0)][DBLP]
    Information and Control, 1984, v:63, n:1/2, pp:118-139 [Journal]
  9. David Harel, Dexter Kozen, Rohit Parikh
    Process Logic: Expressiveness, Decidability, Completeness. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:2, pp:144-170 [Journal]
  10. Dexter Kozen
    Complexity of Boolean Algebras. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:221-247 [Journal]
  11. Dexter Kozen
    Results on the Propositional mu-Calculus. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:333-354 [Journal]
  12. Dexter Kozen, Jerzy Tiuryn
    On the Completeness of Propositional Hoare Logic. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2000, pp:195-202 [Conf]
  13. Kamal Aboul-Hosn, Dexter Kozen
    Local Variable Scoping and Kleene Algebra with Tests. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2006, pp:78-90 [Conf]
  14. Frank Adelstein, Matthew Stillerman, Dexter Kozen
    Malicious Code Detection for Open Firmware. [Citation Graph (0, 0)][DBLP]
    ACSAC, 2002, pp:403-412 [Conf]
  15. Dexter Kozen, Susan Landau, Richard Zippel
    Decomposition of algebraic functions. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:80-92 [Conf]
  16. Dexter Kozen, Christoph Kreitz, Eva Richter
    Automating Proofs in Category Theory. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:392-407 [Conf]
  17. Dexter Kozen
    Set Constraints and Logic Programming. [Citation Graph (0, 0)][DBLP]
    CCL, 1994, pp:302-303 [Conf]
  18. Dexter Kozen, Maria-Christina Patron
    Certification of Compiler Optimizations Using Kleene Algebra with Tests. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:568-582 [Conf]
  19. Alexander Aiken, Dexter Kozen, Moshe Y. Vardi, Edward L. Wimmers
    The Complexity of Set Constraints. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:1-17 [Conf]
  20. Dexter Kozen
    Logical Aspects of Set Constraints. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:175-188 [Conf]
  21. Dexter Kozen, Frederick Smith
    Kleene Algebra with Tests: Completeness and Decidability. [Citation Graph (0, 0)][DBLP]
    CSL, 1996, pp:244-259 [Conf]
  22. Dexter Kozen, Yaron Minsky, Brian C. Smith
    Efficient Algorithms for Optimal Video Transmission. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1998, pp:229-238 [Conf]
  23. Matthew Stillerman, Dexter Kozen
    Efficient Code Certification for Open Firmware. [Citation Graph (0, 0)][DBLP]
    DISCEX (2), 2003, pp:147-148 [Conf]
  24. Dexter Kozen
    Automata and planar graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:243-254 [Conf]
  25. Dexter Kozen
    On two letters versus three. [Citation Graph (0, 0)][DBLP]
    FICS, 2002, pp:44-50 [Conf]
  26. Manuel Blum, Dexter Kozen
    On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:132-142 [Conf]
  27. Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu
    Efficient Average-Case Algorithms for the Modular Group [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:143-152 [Conf]
  28. Joachim von zur Gathen, Dexter Kozen, Susan Landau
    Functional Decomposition of Polynomials [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:127-131 [Conf]
  29. David Harel, Dexter Kozen, Rohit Parikh
    Process Logic: Expressiveness, Decidability, Completeness [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:129-142 [Conf]
  30. Dexter Kozen
    On Parallelism in Turing Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:89-97 [Conf]
  31. Dexter Kozen
    Lower Bounds for Natural Proof Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:254-266 [Conf]
  32. Dexter Kozen
    Semantics of Probabilistic Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:101-114 [Conf]
  33. Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
    Efficient Inference of Partial Types [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:363-371 [Conf]
  34. Dexter Kozen
    Efficient Resolution of Singularities of Plane Curves. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:1-11 [Conf]
  35. Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani
    NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1985, pp:496-503 [Conf]
  36. Dexter Kozen, Matthew Stillerman
    Eager Class Initialization for Java. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 2002, pp:71-80 [Conf]
  37. Allan Cheng, Dexter Kozen
    A Complete Gentzen-Style Axiomatization for Set Constraints. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:134-145 [Conf]
  38. David Harel, Dexter Kozen
    A Programming Language for the Inductive Sets, and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:313-329 [Conf]
  39. Dexter Kozen
    A Representation Theorem for Models of *-Free PDL. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:351-362 [Conf]
  40. Dexter Kozen
    Results on the Propositional µ-Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:348-359 [Conf]
  41. Dexter Kozen, Shmuel Zaks
    Optimal Bounds for the Change-Making Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:150-161 [Conf]
  42. Mark W. Hopkins, Dexter Kozen
    Parikh's Theorem in Commutative Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:394-401 [Conf]
  43. Neil Immerman, Dexter Kozen
    Definability with Bounded Number of Bound Variables [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:236-244 [Conf]
  44. Nils Klarlund, Dexter Kozen
    Rabin Measures and Their Applications to Fairness and Automata Theory [Citation Graph (0, 0)][DBLP]
    LICS, 1991, pp:256-265 [Conf]
  45. Dexter Kozen
    Coinductive Proof Principles for Stochastic Processes. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:359-366 [Conf]
  46. Dexter Kozen
    A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events [Citation Graph (0, 0)][DBLP]
    LICS, 1991, pp:214-225 [Conf]
  47. Dexter Kozen
    On the Complexity of Reasoning in Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:195-202 [Conf]
  48. Dexter Kozen
    On Hoare Logic and Kleene Algebra with Tests. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:167-172 [Conf]
  49. Dexter Kozen, Jerzy Tiuryn
    Intuitionistic Linear Logic and Partial Correctness. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:259-268 [Conf]
  50. David A. McAllester, Robert Givan, Carl Witty, Dexter Kozen
    Tarskian Set Constraints. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:138-147 [Conf]
  51. Dexter Kozen
    On the Duality of Dynamic Algebras and Kripke Models. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1979, pp:1-11 [Conf]
  52. Dexter Kozen
    On Induction vs. *-Continuity. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:167-176 [Conf]
  53. Dexter Kozen, Rohit Parikh
    A Decision Procedure for the Propositional µ-Calculus. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:313-325 [Conf]
  54. Dexter Kozen
    On the Representation of Kleene Algebras with Tests. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:73-83 [Conf]
  55. Dexter Kozen
    On Kleene Algebras and Closed Semirings. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:26-47 [Conf]
  56. Dexter Kozen
    Language-Based Security. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:284-298 [Conf]
  57. Kamal Aboul-Hosn, Dexter Kozen
    Relational Semantics for Higher-Order Programs. [Citation Graph (0, 0)][DBLP]
    MPC, 2006, pp:29-48 [Conf]
  58. Dexter Kozen
    Some Results in Dynamic Model Theory. [Citation Graph (0, 0)][DBLP]
    MPC, 2002, pp:21- [Conf]
  59. Nissim Francez, Dexter Kozen
    Generalized Fair Termination. [Citation Graph (0, 0)][DBLP]
    POPL, 1984, pp:46-53 [Conf]
  60. Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
    Efficient Recursive Subtyping. [Citation Graph (0, 0)][DBLP]
    POPL, 1993, pp:419-428 [Conf]
  61. Chavdar Botev, Hubert Chao, Theodore Chao, Yim Cheng, Raymond Doyle, Sergey Grankin, Jon Guarino, Saikat Guha, Pei-Chen Lee, Dan Perry, Christopher Re, Ilya Rifkin, Tingyan Yuan, Dora Abdullah, Kathy Carpenter, David Gries, Dexter Kozen, Andrew C. Myers, David I. Schwartz, Jayavel Shanmugasundaram
    Supporting workflow in a course management system. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2005, pp:262-266 [Conf]
  62. Dexter Kozen
    Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:27-38 [Conf]
  63. Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
    A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:340-349 [Conf]
  64. Dexter Kozen
    Indexing of Subrecursive Classes [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:287-295 [Conf]
  65. Dexter Kozen
    A Probabilistic PDL [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:291-297 [Conf]
  66. Dexter Kozen
    Pebblings, Edgings, and Equational Logic [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:428-435 [Conf]
  67. Dexter Kozen
    Kleene Algebra withTests and Commutativity Conditions. [Citation Graph (0, 0)][DBLP]
    TACAS, 1996, pp:14-33 [Conf]
  68. Dexter Kozen
    Rational Spaces and Set Constraints. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:42-61 [Conf]
  69. Dexter Kozen
    Computational inductive definability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:139-148 [Journal]
  70. Nils Klarlund, Dexter Kozen
    Rabin Measures. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1995, v:1995, n:, pp:- [Journal]
  71. Dexter Kozen
    On the Myhill-Nerode theorem theorem for trees. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:47, n:, pp:170-173 [Journal]
  72. Dexter Kozen
    On Regularity-Preserving Functions. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1996, v:58, n:, pp:- [Journal]
  73. Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu
    Efficient Average-Case Algorithms for the Modular Group [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:16, pp:- [Journal]
  74. Lucja Kot, Dexter Kozen
    Kleene Algebra and Bytecode Verification. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:141, n:1, pp:221-236 [Journal]
  75. Alexander Aiken, Dexter Kozen, Edward L. Wimmers
    Decidability of Systems of Set Constraints with Negative Constraints [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:122, n:1, pp:30-44 [Journal]
  76. Robert Givan, David A. McAllester, Carl Witty, Dexter Kozen
    Tarskian Set Constraints. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:2, pp:105-131 [Journal]
  77. Dexter Kozen
    On the Complexity of Reasoning in Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:2, pp:152-162 [Journal]
  78. Dexter Kozen
    A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:2, pp:366-390 [Journal]
  79. Dexter Kozen
    Set Constraints and Logic Programming. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:142, n:1, pp:2-25 [Journal]
  80. Dexter Kozen
    Communication: Positive First-Order Logic is NP-Complete. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1981, v:25, n:4, pp:327-332 [Journal]
  81. Krzysztof R. Apt, Dexter Kozen
    Limits for Automatic Verification of Finite-State Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:6, pp:307-309 [Journal]
  82. Dexter Kozen, Jerzy Tiuryn
    On the completeness of propositional Hoare logic. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:139, n:3-4, pp:187-195 [Journal]
  83. Kamal Aboul-Hosn, Dexter Kozen
    KAT-ML: an interactive theorem prover for Kleene algebra with tests. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2006, v:16, n:1-2, pp:9-34 [Journal]
  84. Dexter Kozen
    Semantics of Probabilistic Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:22, n:3, pp:328-350 [Journal]
  85. Dexter Kozen
    A Probabilistic PDL. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:2, pp:162-178 [Journal]
  86. Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
    Efficient Inference of Partial Types. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:306-324 [Journal]
  87. Dexter Kozen, Susan Landau
    Polynomial Decomposition Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:5, pp:445-456 [Journal]
  88. Dexter Kozen, Susan Landau, Richard Zippel
    Decomposition of Algebraic Functions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1996, v:22, n:3, pp:235-246 [Journal]
  89. Dexter Kozen, Kjartan Stefánsson
    Computing the Newtonian Graph. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1997, v:24, n:2, pp:125-136 [Journal]
  90. Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
    Efficient Recursive Subtyping. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1995, v:5, n:1, pp:113-125 [Journal]
  91. Dexter Kozen
    Some results in dynamic model theory. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2004, v:51, n:1-2, pp:3-22 [Journal]
  92. Dexter Kozen
    Preface. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2007, v:65, n:2, pp:71- [Journal]
  93. Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
    A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1081-1092 [Journal]
  94. Dexter Kozen
    Indexings of Subrecursive Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:277-301 [Journal]
  95. Dexter Kozen
    Rational Spaces and Set Constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:167, n:1&2, pp:73-94 [Journal]
  96. Dexter Kozen, Rohit Parikh
    An Elementary Proof of the Completness of PDL. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:113-118 [Journal]
  97. Dexter Kozen, Shmuel Zaks
    Optimal Bounds for the Change-Making Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:123, n:2, pp:377-388 [Journal]
  98. Ruy J. G. B. de Queiroz, Dexter Kozen
    Logic, Language, Information and Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:2, pp:105-107 [Journal]
  99. Dexter Kozen
    On Hoare logic and Kleene algebra with tests. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2000, v:1, n:1, pp:60-76 [Journal]
  100. Dexter Kozen, Jerzy Tiuryn
    Substructural logic and partial correctness. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2003, v:4, n:3, pp:355-378 [Journal]
  101. Ernie Cohen, Dexter Kozen
    A note on the complexity of propositional Hoare logic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2000, v:1, n:1, pp:171-174 [Journal]
  102. Dexter Kozen
    Kleene Algebra with Tests. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:3, pp:427-443 [Journal]
  103. Dexter Kozen, Nicholas Ruozzi
    Applications of Metric Coinduction. [Citation Graph (0, 0)][DBLP]
    CALCO, 2007, pp:327-341 [Conf]

  104. Halting and Equivalence of Program Schemes in Models of Arbitrary Theories. [Citation Graph (, )][DBLP]


  105. Learning prediction suffix trees with Winnow. [Citation Graph (, )][DBLP]


  106. Nonlocal Flow of Control and Kleene Algebra with Tests. [Citation Graph (, )][DBLP]


  107. The Böhm-Jacopini Theorem Is False, Propositionally. [Citation Graph (, )][DBLP]


  108. Collective Inference on Markov Models for Modeling Bird Migration. [Citation Graph (, )][DBLP]


  109. Coinductive Proof Principles for Stochastic Processes [Citation Graph (, )][DBLP]


  110. Applications of Metric Coinduction [Citation Graph (, )][DBLP]


Search in 0.147secs, Finished in 0.152secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002