| Publication | Date of Publication | Type |
|---|
| Logics for reasoning about cryptographic constructions | 2026-05-29 | Paper |
| On the computational complexity of games with uncertainty | 2025-11-11 | Paper |
| Declassification policy for program complexity analysis | 2025-06-18 | Paper |
| Cook's Berkeley notes | 2025-05-25 | Paper |
| ACM interview of Stephen A. Cook by Bruce M. Kapron | 2025-05-25 | Paper |
Complete and tractable machine-independent characterizations of second-order polytime
Logical Methods in Computer Science | 2025-01-31 | Paper |
Complete and tractable machine-independent characterizations of second-order polytime
Lecture Notes in Computer Science | 2024-01-23 | Paper |
A tier-based typed programming language characterizing feasible functionals
(available as arXiv preprint) | 2022-08-02 | Paper |
| A tier-based typed programming language characterizing feasible functionals | 2022-08-02 | Paper |
A tier-based typed programming language characterizing Feasible Functionals
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
A tier-based typed programming language characterizing Feasible Functionals
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Type-two polynomial-time and restricted lookahead
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Type-two polynomial-time and restricted lookahead
Theoretical Computer Science | 2020-04-21 | Paper |
A generalization of Schönemann's theorem via a graph theoretic method
Discrete Mathematics | 2019-09-11 | Paper |
Dynamic graph connectivity in polylogarithmic worst case time
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes
Designs, Codes and Cryptography | 2018-07-13 | Paper |
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
International Journal of Foundations of Computer Science | 2018-05-17 | Paper |
Reproducible circularly secure bit encryption: applications and realizations
Journal of Cryptology | 2018-02-15 | Paper |
Resource-bounded continuity and sequentiality for type-two functionals
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Toward fine-grained blackbox separations between semantic and circular-security notions
Lecture Notes in Computer Science | 2017-06-13 | Paper |
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Simultaneous secrecy and reliability amplification for a general channel model
Theory of Cryptography | 2016-12-21 | Paper |
On a restricted linear congruence
International Journal of Number Theory | 2016-11-16 | Paper |
Restricted linear congruences
Journal of Number Theory | 2016-10-26 | Paper |
Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT
Nuclear Physics B | 2016-09-16 | Paper |
On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
MMH* with arbitrary modulus is always almost-universal
Information Processing Letters | 2016-04-06 | Paper |
Reproducible circularly-secure bit encryption: applications and realizations
Lecture Notes in Computer Science | 2015-12-10 | Paper |
A framework for non-interactive instance-dependent commitment schemes (NIC)
Theoretical Computer Science | 2015-10-08 | Paper |
Gambling, computational information and encryption security
Lecture Notes in Computer Science | 2015-09-24 | Paper |
Lower bound for scalable Byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Lower bound for scalable Byzantine agreement
Distributed Computing | 2013-06-28 | Paper |
Computational soundness of coinductive symbolic security under active attacks
Theory of Cryptography | 2013-03-18 | Paper |
On the equality of probabilistic terms
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
| scientific article; zbMATH DE number 5764832 (Why is no real title available?) | 2010-08-06 | Paper |
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
Automata, Languages and Programming | 2007-11-28 | Paper |
Logics for reasoning about cryptographic constructions
Journal of Computer and System Sciences | 2006-04-28 | Paper |
The modal logic of the countable random frame
Archive for Mathematical Logic | 2003-09-16 | Paper |
On characterizations of the basic feasible functionals. I
Journal of Functional Programming | 2002-09-11 | Paper |
| scientific article; zbMATH DE number 1499087 (Why is no real title available?) | 2000-09-03 | Paper |
Feasibly continuous type-two functionals
Computational Complexity | 2000-03-30 | Paper |
A Note on Negative Tagging for Least Fixed-Point Formulae
RAIRO - Theoretical Informatics and Applications | 2000-03-16 | Paper |
A Note on Negative Tagging for Least Fixed-Point Formulae
RAIRO - Theoretical Informatics and Applications | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1231562 (Why is no real title available?) | 1998-12-20 | Paper |
Limits on the power of parallel random access machines with weak forms of write conflict resolution
Journal of Computer and System Sciences | 1997-03-31 | Paper |
| scientific article; zbMATH DE number 512845 (Why is no real title available?) | 1996-07-29 | Paper |
A new Characterization of Type-2 Feasibility
SIAM Journal on Computing | 1996-06-05 | Paper |
Zero-one laws for modal logic
Annals of Pure and Applied Logic | 1994-11-08 | Paper |
| scientific article; zbMATH DE number 176200 (Why is no real title available?) | 1993-05-18 | Paper |
Modal sequents and definability
Journal of Symbolic Logic | 1987-01-01 | Paper |
