default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruce M. Kapron
Person information
- affiliation: University of Victoria, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c35]Bruce M. Kapron, Koosha Samieefar:
On the Computational Complexity of Quasi-Variational Inequalities and Multi-Leader-Follower Games. AAMAS 2024: 2324-2326- [c34]Ugo Dal Lago, Davide Davoli, Bruce M. Kapron:
On Separation Logic, Computational Independence, and Pseudorandomness. CSF 2024: 80-95 - [c33]Emmanuel Hainry
, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Declassification Policy for Program Complexity Analysis. LICS 2024: 41:1-41:14 - [i26]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Declassification Policy for Program Complexity Analysis. CoRR abs/2401.14957 (2024) - [i25]Ugo Dal Lago, Davide Davoli, Bruce M. Kapron:
On Separation Logic, Computational Independence, and Pseudorandomness (Extended Version). CoRR abs/2405.11987 (2024) - [i24]Zahra Javar, Bruce M. Kapron:
Linicrypt in the Ideal Cipher Model. IACR Cryptol. ePrint Arch. 2024: 706 (2024) - 2023
- [c32]Zahra Javar, Bruce M. Kapron:
Preimage Awareness in Linicrypt. CSF 2023: 33-42 - [c31]Zahra Javar, Bruce M. Kapron:
Linicrypt in the Ideal Cipher Model. ProvSec 2023: 91-111 - [p2]Bruce M. Kapron:
Introduction. Logic, Automata, and Computational Complexity 2023 - [p1]Bruce M. Kapron:
Cook's Berkeley Notes. Logic, Automata, and Computational Complexity 2023: 321-324 - [e1]Bruce M. Kapron:
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook. ACM Books 43, ACM 2023, ISBN 979-8-4007-0779-7 [contents] - [i23]Bruce M. Kapron, Koosha Samieefar:
The Computational Complexity of Equilibria with Strategic Constraints. CoRR abs/2305.04918 (2023) - 2022
- [j24]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. Log. Methods Comput. Sci. 18(1) (2022) - [c30]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS 2022: 368-388 - [i22]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. CoRR abs/2208.14739 (2022) - 2021
- [i21]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. CoRR abs/2102.11605 (2021) - 2020
- [j23]Bruce M. Kapron, Florian Steinberg:
Type-two polynomial-time and restricted lookahead. Theor. Comput. Sci. 813: 1-19 (2020) - [c29]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. LICS 2020: 535-549 - [i20]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh:
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs. CoRR abs/2010.05407 (2020) - [i19]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh:
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. CoRR abs/2010.05415 (2020) - [i18]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
MMH* with arbitrary modulus is always almost-universal. CoRR abs/2010.05420 (2020)
2010 – 2019
- 2019
- [j22]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
A generalization of Schönemann's theorem via a graph theoretic method. Discret. Math. 342(11): 3057-3061 (2019) - [c28]Bruce M. Kapron, Florian Steinberg:
Type-two Iteration with Bounded Query Revision. DICE-FOPARA@ETAPS 2019: 61-73 - [i17]Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg:
Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). NII Shonan Meet. Rep. 2019 (2019) - 2018
- [j21]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. Des. Codes Cryptogr. 86(9): 1893-1904 (2018) - [j20]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth:
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. Int. J. Found. Comput. Sci. 29(3): 357-376 (2018) - [c27]Bruce M. Kapron, Florian Steinberg:
Type-two polynomial-time and restricted lookahead. LICS 2018: 579-588 - [r2]Sean Chester, Bruce M. Kapron, Gautam Srivastava, Venkatesh Srinivasan, Alex Thomo:
Anonymization and De-anonymization of Social Network Data. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - [i16]Bruce M. Kapron, Florian Steinberg:
Type-two polynomial-time and restricted lookahead. CoRR abs/1801.07485 (2018) - 2017
- [j19]Mohammad Hajiabadi, Bruce M. Kapron:
Reproducible Circularly Secure Bit Encryption: Applications and Realizations. J. Cryptol. 30(4): 1187-1237 (2017) - [c26]Mohammad Hajiabadi, Bruce M. Kapron:
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. EUROCRYPT (2) 2017: 561-591 - [i15]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
A generalization of Schönemann's theorem via a graph theoretic method. CoRR abs/1712.06770 (2017) - [i14]Stephen A. Cook, Bruce M. Kapron:
A Survey of Classes of Primitive Recursive Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i13]Mohammad Hajiabadi, Bruce M. Kapron:
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. IACR Cryptol. ePrint Arch. 2017: 146 (2017) - 2016
- [j18]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
MMH⁎ with arbitrary modulus is always almost-universal. Inf. Process. Lett. 116(7): 481-483 (2016) - [j17]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. IEEE Trans. Inf. Theory 62(11): 6355-6358 (2016) - [c25]Ariel Webster, Bruce M. Kapron, Valerie King:
Stability of certainty and opinion in influence networks. ASONAM 2016: 1309-1320 - [c24]Erkan Ersan, Lior Malka, Bruce M. Kapron:
Semantically Non-preserving Transformations for Antivirus Evaluation. FPS 2016: 273-281 - [c23]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth:
On a variant of multilinear modular hashing with applications to authentication and secrecy codes. ISITA 2016: 320-324 - [c22]Mohammad Hajiabadi, Bruce M. Kapron, Venkatesh Srinivasan:
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. Public Key Cryptography (2) 2016: 129-158 - [c21]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro:
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. TCC (B1) 2016: 235-261 - [i12]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro:
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. IACR Cryptol. ePrint Arch. 2016: 760 (2016) - 2015
- [j16]Bruce M. Kapron, Lior Malka, S. Venkatesh:
A framework for non-interactive instance-dependent commitment schemes (NIC). Theor. Comput. Sci. 593: 1-15 (2015) - [c20]Mohammad Hajiabadi, Bruce M. Kapron:
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations. CRYPTO (1) 2015: 224-243 - [c19]Mohammad Hajiabadi, Bruce M. Kapron:
Gambling, Computational Information and Encryption Security. ICITS 2015: 141-158 - [i11]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, Roberto Tauraso, László Tóth:
Restricted linear congruences and an authenticated encryption scheme. CoRR abs/1503.01806 (2015) - [i10]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh:
On almost-universal multilinear modular hashing with composite moduli. CoRR abs/1507.02331 (2015) - [i9]David Gibb, Bruce M. Kapron, Valerie King, Nolan Thorn:
Dynamic graph connectivity with improved worst case update time and sublinear space. CoRR abs/1509.06464 (2015) - [i8]Mohammad Hajiabadi, Bruce M. Kapron:
Gambling, Computational Information, and Encryption Security. Electron. Colloquium Comput. Complex. TR15 (2015) - [i7]Mohammad Hajiabadi, Bruce M. Kapron:
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations. IACR Cryptol. ePrint Arch. 2015: 531 (2015) - [i6]Mohammad Hajiabadi, Bruce M. Kapron, S. Venkatesh:
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. IACR Cryptol. ePrint Arch. 2015: 741 (2015) - [i5]Mohammad Hajiabadi, Bruce M. Kapron:
Gambling, Computational Information and Encryption Security. IACR Cryptol. ePrint Arch. 2015: 870 (2015) - [i4]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, Roberto Tauraso, László Tóth:
Restricted linear congruences. IACR Cryptol. ePrint Arch. 2015: 1186 (2015) - [i3]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, László Tóth:
On an almost-universal hash function family with applications to authentication and secrecy codes. IACR Cryptol. ePrint Arch. 2015: 1187 (2015) - 2014
- [r1]Sean Chester, Bruce M. Kapron, Gautam Srivastava, Srinivasan Venkatesh, Alex Thomo:
Anonymization and De-anonymization of Social Network Data. Encyclopedia of Social Network Analysis and Mining 2014: 48-56 - 2013
- [j15]Sean Chester, Bruce M. Kapron, Gautam Srivastava, S. Venkatesh:
Complexity of social network anonymization. Soc. Netw. Anal. Min. 3(2): 151-166 (2013) - [j14]Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh:
Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. Soc. Netw. Anal. Min. 3(3): 381-399 (2013) - [c18]Bruce M. Kapron, Valerie King, Ben Mountjoy:
Dynamic graph connectivity in polylogarithmic worst case time. SODA 2013: 1131-1142 - [c17]Mohammad Hajiabadi, Bruce M. Kapron:
Computational Soundness of Coinductive Symbolic Security under Active Attacks. TCC 2013: 539-558 - 2012
- [i2]Mohammad Hajiabadi, Bruce M. Kapron:
Computational Soundness of Coinductive Symbolic Security under Active Attacks. IACR Cryptol. ePrint Arch. 2012: 560 (2012) - 2011
- [c16]Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh:
k-Anonymization of Social Networks by Vertex Addition. ADBIS (2) 2011: 107-116 - [c15]Bruce M. Kapron, Gautam Srivastava, S. Venkatesh:
Social Network Anonymization via Edge Addition. ASONAM 2011: 155-162 - 2010
- [j13]Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani:
Fast asynchronous Byzantine agreement and leader election with full information. ACM Trans. Algorithms 6(4): 68:1-68:28 (2010) - [c14]Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech:
Computational indistinguishability logic. CCS 2010: 375-386 - [c13]Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech, Vincent Laporte:
On the Equality of Probabilistic Terms. LPAR (Dakar) 2010: 46-63
2000 – 2009
- 2009
- [i1]Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh:
A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC). IACR Cryptol. ePrint Arch. 2009: 461 (2009) - 2008
- [j12]Dan Holtby, Bruce M. Kapron, Valerie King:
Lower bound for scalable Byzantine Agreement. Distributed Comput. 21(4): 239-248 (2008) - [c12]Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani:
Fast asynchronous byzantine agreement and leader election with full information. SODA 2008: 1038-1047 - 2007
- [c11]Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh:
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). ICALP 2007: 328-339 - 2006
- [j11]Russell Impagliazzo, Bruce M. Kapron:
Logics for reasoning about cryptographic constructions. J. Comput. Syst. Sci. 72(2): 286-320 (2006) - [c10]Dan Holtby, Bruce M. Kapron, Valerie King:
Lower bound for scalable Byzantine Agreement. PODC 2006: 285-291 - 2003
- [j10]Valentin Goranko, Bruce M. Kapron:
The modal logic of the countable random frame. Arch. Math. Log. 42(3): 221-243 (2003) - [j9]Joseph Y. Halpern, Bruce M. Kapron:
Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193]. Ann. Pure Appl. Log. 121(2-3): 281-283 (2003) - [c9]Russell Impagliazzo, Bruce M. Kapron:
Logics for Reasoning about Cryptographic Constructions. FOCS 2003: 372-383 - 2002
- [j8]Samuel R. Buss, Bruce M. Kapron:
Resource-bounded continuity and sequentiality for type-two functionals. ACM Trans. Comput. Log. 3(3): 402-417 (2002) - 2001
- [j7]Robert J. Irwin, James S. Royer, Bruce M. Kapron:
On characterizations of the basic feasible functionals (Part I). J. Funct. Program. 11(1): 117-153 (2001) - 2000
- [c8]Samuel R. Buss, Bruce M. Kapron:
Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. LICS 2000: 77-83
1990 – 1999
- 1999
- [j6]Bruce M. Kapron:
Feasibly Continuous Type-Two Functionals. Comput. Complex. 8(2): 188-201 (1999) - [j5]Dilian Gurov, Bruce M. Kapron:
A note on negative tagging for least fixed-point formulae. RAIRO Theor. Informatics Appl. 33(4/5): 383-392 (1999) - 1996
- [j4]Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski:
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. J. Comput. Syst. Sci. 53(1): 104-111 (1996) - [j3]Bruce M. Kapron, Stephen A. Cook:
A New Characterization of Type-2 Feasibility. SIAM J. Comput. 25(1): 117-132 (1996) - [c7]Dilian Gurov, Sergey Berezin, Bruce M. Kapron:
A modal mu-calculus and a proof system for value passing processes. INFINITY 1996: 47 - 1994
- [j2]Joseph Y. Halpern, Bruce M. Kapron:
Zero-One Laws for Modal Logic. Ann. Pure Appl. Log. 69(2-3): 157-193 (1994) - [c6]Bruce M. Kapron, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett, Harold T. Wareham:
The Parameterized Complexity of Some Problems in Logic and Linguistics. LFCS 1994: 89-100 - 1993
- [c5]Peter Clote, Aleksandar Ignjatovic, Bruce M. Kapron:
Parallel computable higher type functionals (Extended Abstract). FOCS 1993: 72-81 - [c4]Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski:
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. STACS 1993: 386-397 - 1992
- [c3]Joseph Y. Halpern, Bruce M. Kapron:
Zero-One Laws for Modal Logic. LICS 1992: 369-380 - 1991
- [b1]Bruce M. Kapron:
Feasible computation in higher types. University of Toronto, Canada, 1991 - [c2]Bruce M. Kapron, Stephen A. Cook:
A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract). FOCS 1991: 342-347
1980 – 1989
- 1989
- [c1]Stephen A. Cook, Bruce M. Kapron:
Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract). FOCS 1989: 154-159 - 1987
- [j1]Bruce M. Kapron:
Modal Sequents and Definability. J. Symb. Log. 52(3): 756-762 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
