| 2013 | ||
|---|---|---|
| c16 | Bruce M. Kapron, Valerie King, Ben Mountjoy: Dynamic graph connectivity in polylogarithmic worst case time. SODA 2013: 1131-1142 | |
| c15 | Mohammad Hajiabadi, Bruce M. Kapron: Computational Soundness of Coinductive Symbolic Security under Active Attacks. TCC 2013: 539-558 | |
| 2012 | ||
| i3 | Mohammad Hajiabadi, Bruce M. Kapron: Computational Soundness of Coinductive Symbolic Security under Active Attacks. IACR Cryptology ePrint Archive 2012: 560 (2012) | |
| 2011 | ||
| c14 | 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 | |
| c13 | Bruce M. Kapron, Gautam Srivastava, S. Venkatesh: Social Network Anonymization via Edge Addition. ASONAM 2011: 155-162 | |
| i2 | Mohammad Hajiabadi, Bruce M. Kapron: Co-induction and Computational Semantics for Public-key Encryption with Key Cycles. IACR Cryptology ePrint Archive 2011: 85 (2011) | |
| 2010 | ||
| j14 | Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani: Fast asynchronous Byzantine agreement and leader election with full information. ACM Transactions on Algorithms 6(4) (2010) | |
| c12 | Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech: Computational indistinguishability logic. ACM Conference on Computer and Communications Security 2010: 375-386 | |
| c11 | Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech, Vincent Laporte: On the Equality of Probabilistic Terms. LPAR (Dakar) 2010: 46-63 | |
| 2009 | ||
| i1 | Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh: A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC). IACR Cryptology ePrint Archive 2009: 461 (2009) | |
| 2008 | ||
| j13 | Dan Holtby, Bruce M. Kapron, Valerie King: Lower bound for scalable Byzantine Agreement. Distributed Computing 21(4): 239-248 (2008) | |
| c10 | 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 | ||
| c9 | Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh: A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). ICALP 2007: 328-339 | |
| 2006 | ||
| j12 | Russell Impagliazzo, Bruce M. Kapron: Logics for reasoning about cryptographic constructions. J. Comput. Syst. Sci. 72(2): 286-320 (2006) | |
| c8 | Dan Holtby, Bruce M. Kapron, Valerie King: Lower bound for scalable Byzantine Agreement. PODC 2006: 285-291 | |
| 2003 | ||
| j11 | Valentin Goranko, Bruce M. Kapron: The modal logic of the countable random frame. Arch. Math. Log. 42(3): 221-243 (2003) | |
| j10 | 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. Logic 121(2-3): 281-283 (2003) | |
| c7 | Russell Impagliazzo, Bruce M. Kapron: Logics for Reasoning about Cryptographic Constructions. FOCS 2003: 372-383 | |
| 2002 | ||
| j9 | 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 | ||
| j8 | 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 | ||
| c6 | Samuel R. Buss, Bruce M. Kapron: Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. LICS 2000: 77-83 | |
| 1999 | ||
| j7 | Bruce M. Kapron: Feasibly Continuous Type-Two Functionals. Computational Complexity 8(2): 188-201 (1999) | |
| j6 | Dilian Gurov, Bruce M. Kapron: A note on negative tagging for least fixed-point formulae. ITA 33(4/5): 383-392 (1999) | |
| 1996 | ||
| j5 | Dilian Gurov, Sergey Berezin, Bruce M. Kapron: A modal mu-calculus and a proof system for value passing processes. Electr. Notes Theor. Comput. Sci. 5: 47 (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) | |
| 1994 | ||
| j2 | Joseph Y. Halpern, Bruce M. Kapron: Zero-One Laws for Modal Logic. Ann. Pure Appl. Logic 69(2-3): 157-193 (1994) | |
| 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 | ||
| 1991 | ||
| c2 | Bruce M. Kapron, Stephen A. Cook: A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract). FOCS 1991: 342-347 | |
| 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 | ||
Colors in the list of coauthors
Last update Fri May 24 03:59:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page