Bruce M. Kapron
Orcid: 0000-0002-3295-543XAffiliations:
- University of Victoria, Canada
According to our database1,
Bruce M. Kapron
authored at least 65 papers
between 1987 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
2025
0
1
2
3
4
5
6
7
8
2
1
1
1
3
1
1
2
2
2
3
3
7
2
1
1
1
1
2
1
1
2
2
1
1
3
1
1
3
1
2
2
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on cs.uvic.ca
On csauthors.net:
Bibliography
2025
Complete and tractable machine-independent characterizations of second-order polytime.
Log. Methods Comput. Sci., 2025
2024
The Computational Complexity of Variational Inequalities and Applications in Game Theory.
CoRR, 2024
On Separation Logic, Computational Independence, and Pseudorandomness (Extended Version).
CoRR, 2024
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
Proceedings of the 37th IEEE Computer Security Foundations Symposium, 2024
On the Computational Complexity of Quasi-Variational Inequalities and Multi-Leader-Follower Games.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
2023
Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023
2022
Log. Methods Comput. Sci., 2022
2020
2019
NII Shonan Meet. Rep., 2019
Discret. Math., 2019
Proceedings of the Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis, 2019
2018
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes.
Int. J. Found. Comput. Sci., 2018
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes.
Des. Codes Cryptogr., 2018
2017
J. Cryptol., 2017
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions.
IACR Cryptol. ePrint Arch., 2017
Electron. Colloquium Comput. Complex., 2017
2016
IEEE Trans. Inf. Theory, 2016
Inf. Process. Lett., 2016
IACR Cryptol. ePrint Arch., 2016
On a variant of multilinear modular hashing with applications to authentication and secrecy codes.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016
Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016
2015
Theor. Comput. Sci., 2015
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes.
IACR Cryptol. ePrint Arch., 2015
Electron. Colloquium Comput. Complex., 2015
CoRR, 2015
2014
Encyclopedia of Social Network Analysis and Mining, 2014
2013
Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes.
Soc. Netw. Anal. Min., 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
IACR Cryptol. ePrint Arch., 2012
2011
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011
Proceedings of the ADBIS 2011, 2011
2010
ACM Trans. Algorithms, 2010
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010
2008
2007
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
2006
2003
Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193].
Ann. Pure Appl. Log., 2003
2002
ACM Trans. Comput. Log., 2002
2001
J. Funct. Program., 2001
1999
RAIRO Theor. Informatics Appl., 1999
1996
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution.
J. Comput. Syst. Sci., 1996
Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996
1994
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994
1993
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1989
Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1987