Modal Sequents and Definability. - Bruce M. Kapron (J. Symb. Log., 1987)

Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) - Stephen A. Cook; Bruce M. Kapron (FOCS, 1989)

A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) - Bruce M. Kapron; Stephen A. Cook (FOCS, 1991)

Feasible computation in higher types. - Bruce M. Kapron (1991)

Parallel computable higher type functionals (Extended Abstract) - Peter Clote; Aleksandar Ignjatovic; Bruce M. Kapron (FOCS, 1993)

The Parameterized Complexity of Some Problems in Logic and Linguistics. - Bruce M. Kapron; Michael R. Fellows; Rodney G. Downey; Michael T. Hallett; Harold T. Wareham (LFCS, 1994)

Zero-One Laws for Modal Logic. - Joseph Y. Halpern; Bruce M. Kapron (Ann. Pure Appl. Log., 1994)

A modal mu-calculus and a proof system for value passing processes. - Dilian Gurov; Sergey Berezin; Bruce M. Kapron (INFINITY, 1996)

Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. - Faith E. Fich; Russell Impagliazzo; Bruce M. Kapron; Valerie King; Miroslaw Kutylowski (J. Comput. Syst. Sci., 1996)

A New Characterization of Type-2 Feasibility. - Bruce M. Kapron; Stephen A. Cook (SIAM J. Comput., 1996)

Feasibly Continuous Type-Two Functionals. - Bruce M. Kapron (Comput. Complex., 1999)

A note on negative tagging for least fixed-point formulae. - Dilian Gurov; Bruce M. Kapron (RAIRO Theor. Informatics Appl., 1999)

On characterizations of the basic feasible functionals (Part I). - Robert J. Irwin; James S. Royer; Bruce M. Kapron (J. Funct. Program., 2001)

Resource-bounded continuity and sequentiality for type-two functionals. - Samuel R. Buss; Bruce M. Kapron (ACM Trans. Comput. Log., 2002)

The modal logic of the countable random frame. - Valentin Goranko; Bruce M. Kapron (Arch. Math. Log., 2003)

Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193]. - Joseph Y. Halpern; Bruce M. Kapron (Ann. Pure Appl. Log., 2003)

Logics for reasoning about cryptographic constructions. - Russell Impagliazzo; Bruce M. Kapron (J. Comput. Syst. Sci., 2006)

A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). - Bruce M. Kapron; Lior Malka; Srinivasan Venkatesh 001 (ICALP, 2007)

Lower bound for scalable Byzantine Agreement. - Dan Holtby; Bruce M. Kapron; Valerie King (Distributed Comput., 2008)

Computational indistinguishability logic. - Gilles Barthe; Marion Daubignard; Bruce M. Kapron; Yassine Lakhnech (CCS, 2010)

On the Equality of Probabilistic Terms. - Gilles Barthe; Marion Daubignard; Bruce M. Kapron; Yassine Lakhnech; Vincent Laporte (LPAR (Dakar), 2010)

Fast asynchronous Byzantine agreement and leader election with full information. - Bruce M. Kapron; David Kempe 001; Valerie King; Jared Saia; Vishal Sanwalani (ACM Trans. Algorithms, 2010)

k-Anonymization of Social Networks by Vertex Addition. - Sean Chester; Bruce M. Kapron; Ganesh Ramesh; Gautam Srivastava 001; Alex Thomo; S. Venkatesh 001 (ADBIS (2), 2011)

Social Network Anonymization via Edge Addition. - Bruce M. Kapron; Gautam Srivastava 001; S. Venkatesh 001 (ASONAM, 2011)

Computational Soundness of Coinductive Symbolic Security under Active Attacks. - Mohammad Hajiabadi; Bruce M. Kapron (IACR Cryptol. ePrint Arch., 2012)

Dynamic graph connectivity in polylogarithmic worst case time. - Bruce M. Kapron; Valerie King; Ben Mountjoy (SODA, 2013)

Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. - Sean Chester; Bruce M. Kapron; Ganesh Ramesh; Gautam Srivastava 001; Alex Thomo; S. Venkatesh 001 (Soc. Netw. Anal. Min., 2013)

Complexity of social network anonymization. - Sean Chester; Bruce M. Kapron; Gautam Srivastava 001; S. Venkatesh 001 (Soc. Netw. Anal. Min., 2013)

Anonymization and De-anonymization of Social Network Data. - Sean Chester; Bruce M. Kapron; Gautam Srivastava 001; Srinivasan Venkatesh 001; Alex Thomo (Encyclopedia of Social Network Analysis and Mining, 2014)

On almost-universal multilinear modular hashing with composite moduli. - Khodakhast Bibak; Bruce M. Kapron; S. Venkatesh 001 (CoRR, 2015)

Restricted linear congruences and an authenticated encryption scheme. - Khodakhast Bibak; Bruce M. Kapron; Srinivasan Venkatesh 001; Roberto Tauraso; László Tóth 003 (CoRR, 2015)

Dynamic graph connectivity with improved worst case update time and sublinear space. - David Gibb; Bruce M. Kapron; Valerie King; Nolan Thorn (CoRR, 2015)

Gambling, Computational Information, and Encryption Security. - Mohammad Hajiabadi; Bruce M. Kapron (Electron. Colloquium Comput. Complex., 2015)

Restricted linear congruences. - Khodakhast Bibak; Bruce M. Kapron; S. Venkatesh 001; Roberto Tauraso; László Tóth 003 (IACR Cryptol. ePrint Arch., 2015)

On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. - Mohammad Hajiabadi; Bruce M. Kapron; S. Venkatesh 001 (IACR Cryptol. ePrint Arch., 2015)

A framework for non-interactive instance-dependent commitment schemes (NIC). - Bruce M. Kapron; Lior Malka; S. Venkatesh 001 (Theor. Comput. Sci., 2015)

Stability of certainty and opinion in influence networks. - Ariel Webster; Bruce M. Kapron; Valerie King (ASONAM, 2016)

Semantically Non-preserving Transformations for Antivirus Evaluation. - Erkan Ersan; Lior Malka; Bruce M. Kapron (FPS, 2016)

On a variant of multilinear modular hashing with applications to authentication and secrecy codes. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001; László Tóth 003 (ISITA, 2016)

Simultaneous Secrecy and Reliability Amplification for a General Channel Model. - Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets; Bruce M. Kapron; Valerie King; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2016)

MMH⁎ with arbitrary modulus is always almost-universal. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Inf. Process. Lett., 2016)

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (IEEE Trans. Inf. Theory, 2016)

A Survey of Classes of Primitive Recursive Functions. - Stephen A. Cook; Bruce M. Kapron (Electron. Colloquium Comput. Complex., 2017)

Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. - Mohammad Hajiabadi; Bruce M. Kapron (IACR Cryptol. ePrint Arch., 2017)

Reproducible Circularly Secure Bit Encryption: Applications and Realizations. - Mohammad Hajiabadi; Bruce M. Kapron (J. Cryptol., 2017)

Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Des. Codes Cryptogr., 2018)

On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. - Khodakhast Bibak; Bruce M. Kapron; Srinivasan Venkatesh 001; László Tóth 003 (Int. J. Found. Comput. Sci., 2018)

Anonymization and De-anonymization of Social Network Data. - Sean Chester; Bruce M. Kapron; Gautam Srivastava 001; Venkatesh Srinivasan 001; Alex Thomo (Encyclopedia of Social Network Analysis and Mining. 2nd Ed., 2018)

Type-two Iteration with Bounded Query Revision. - Bruce M. Kapron; Florian Steinberg 001 (DICE-FOPARA@ETAPS, 2019)

A generalization of Schönemann's theorem via a graph theoretic method. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Discret. Math., 2019)

Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). - Bruce M. Kapron; Akitoshi Kawamura; Florian Steinberg 001 (NII Shonan Meet. Rep., 2019)

MMH* with arbitrary modulus is always almost-universal. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (CoRR, 2020)

Type-two polynomial-time and restricted lookahead. - Bruce M. Kapron; Florian Steinberg 001 (Theor. Comput. Sci., 2020)

A tier-based typed programming language characterizing Feasible Functionals. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (Log. Methods Comput. Sci., 2022)

Introduction. - Bruce M. Kapron (Logic, Automata, and Computational Complexity, 2023)

Cook's Berkeley Notes. - Bruce M. Kapron (Logic, Automata, and Computational Complexity, 2023)

Preimage Awareness in Linicrypt. - Zahra Javar; Bruce M. Kapron (CSF, 2023)

On the Computational Complexity of Quasi-Variational Inequalities and Multi-Leader-Follower Games. - Bruce M. Kapron; Koosha Samieefar (AAMAS, 2024)

On Separation Logic, Computational Independence, and Pseudorandomness. - Ugo Dal Lago; Davide Davoli 001; Bruce M. Kapron (CSF, 2024)

Declassification Policy for Program Complexity Analysis. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (LICS, 2024)

On Separation Logic, Computational Independence, and Pseudorandomness (Extended Version). - Ugo Dal Lago; Davide Davoli 001; Bruce M. Kapron (CoRR, 2024)

The Computational Complexity of Variational Inequalities and Applications in Game Theory. - Bruce M. Kapron; Koosha Samieefar (CoRR, 2024)

Linicrypt in the Ideal Cipher Model. - Zahra Javar; Bruce M. Kapron (IACR Cryptol. ePrint Arch., 2024)

On The Computational Complexity of Games with Uncertainty. - Bruce M. Kapron; Koosha Samieefar (CIAC (1), 2025)

The Computational Complexity of Equilibria with Strategic Constraints. - Bruce M. Kapron; Koosha Samieefar (SOFSEM (2), 2025)

Complete and tractable machine-independent characterizations of second-order polytime. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (Log. Methods Comput. Sci., 2025)