Bruce Kapron
Bruce Kapron
Professor of Computer Science, University of Victoria
Verified email at - Homepage
Cited by
Cited by
Dynamic graph connectivity in polylogarithmic worst case time
BM Kapron, V King, B Mountjoy
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
A new characterization of type-2 feasibility
BM Kapron, SA Cook
SIAM Journal on Computing 25 (1), 117-132, 1996
Logics for reasoning about cryptographic constructions
R Impagliazzo, BM Kapron
Journal of Computer and System Sciences 72 (2), 286-320, 2006
Fast asynchronous byzantine agreement and leader election with full information
BM Kapron, D Kempe, V King, J Saia, V Sanwalani
ACM Transactions on Algorithms (TALG) 6 (4), 1-28, 2010
Characterizations of the basic feasible functions of finite type, Feasible Mathematics: A Mathematical Sciences Institute Workshop (S. Buss and P. Scott, eds.)
S Cook, B Kapron
Birkhäuser, 1990
The parameterized complexity of some problems in logic and linguistics
RG Downey, MR Fellows, BM Kapron, MT Hallett, HT Wareham
International Symposium on Logical Foundations of Computer Science, 89-100, 1994
Computational indistinguishability logic
G Barthe, M Daubignard, B Kapron, Y Lakhnech
Proceedings of the 17th ACM conference on Computer and Communications …, 2010
Why Waldo befriended the dummy: k-Anonymization of social networks with pseudo-nodes
S Chester, BM Kapron, G Ramesh, G Srivastava, A Thomo, S Venkatesh
Social Network Analysis and Mining 3 (3), 381-399, 2013
Complexity of social network anonymization
S Chester, BM Kapron, G Srivastava, S Venkatesh
Social Network Analysis and Mining 3 (2), 151-166, 2013
On Characterizations of the Basic Feasible Functionals Part I
RJ Irwin, BM Kapron, JS Royer
Journal of Functional Programming 11 (1), 117-153, 2001
k-Anonymization of Social Networks by Vertex Addition.
S Chester, BM Kapron, G Ramesh, G Srivastava, A Thomo, S Venkatesh
ADBIS (2) 789, 107-116, 2011
Social network anonymization via edge addition
B Kapron, G Srivastava, S Venkatesh
2011 International Conference on Advances in Social Networks Analysis and …, 2011
Dynamic graph connectivity with improved worst case update time and sublinear space
D Gibb, B Kapron, V King, N Thorn
arXiv preprint arXiv:1509.06464, 2015
A new characterization of Mehlhorn's polynomial time functionals
BM Kapron, SA Cook
FOCS, 342-347, 1991
Zero-one laws for modal logic
JY Halpern, B Kapron
Annals of Pure and Applied Logic 69 (2-3), 157-193, 1994
Modal sequents and definability
BM Kapron
The Journal of symbolic logic 52 (3), 756-762, 1987
Feasible computation in higher types
BM Kapron
University of Toronto, Department of Computer Science, 1991
Restricted linear congruences
K Bibak, B Kapron, V Srinivasan, R Tauraso, L Tóth
Journal of Number Theory 171, 128-144, 2017
On the equality of probabilistic terms
G Barthe, M Daubignard, B Kapron, Y Lakhnech, V Laporte
International Conference on Logic for Programming Artificial Intelligence …, 2010
Lower bound for scalable byzantine agreement
D Holtby, BM Kapron, V King
Distributed Computing 21 (4), 239-248, 2008
The system can't perform the operation now. Try again later.
Articles 1–20