Bruce M. Kapron

2008
23	EE	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
22	EE	Dan Holtby, Bruce M. Kapron, Valerie King: Lower bound for scalable Byzantine Agreement. Distributed Computing 21(4): 239-248 (2008)
2007
21	EE	Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh: A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). ICALP 2007: 328-339
2006
20	EE	Dan Holtby, Bruce M. Kapron, Valerie King: Lower bound for scalable Byzantine Agreement. PODC 2006: 285-291
19	EE	Russell Impagliazzo, Bruce M. Kapron: Logics for reasoning about cryptographic constructions. J. Comput. Syst. Sci. 72(2): 286-320 (2006)
2003
18	EE	Russell Impagliazzo, Bruce M. Kapron: Logics for Reasoning about Cryptographic Constructions. FOCS 2003: 372-383
17	EE	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)
16	EE	Valentin Goranko, Bruce M. Kapron: The modal logic of the countable random frame. Arch. Math. Log. 42(3): 221-243 (2003)
2002
15	EE	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
14		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
13	EE	Samuel R. Buss, Bruce M. Kapron: Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. LICS 2000: 77-83
1999
12		Bruce M. Kapron: Feasibly Continuous Type-Two Functionals. Computational Complexity 8(2): 188-201 (1999)
11		Dilian Gurov, Bruce M. Kapron: A note on negative tagging for least fixed-point formulae. ITA 33(4/5): 383-392 (1999)
1996
10	EE	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: (1996)
9		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)
8		Bruce M. Kapron, Steven A. Cook: A New Characterization of Type-2 Feasibility. SIAM J. Comput. 25(1): 117-132 (1996)
1994
7		Joseph Y. Halpern, Bruce M. Kapron: Zero-One Laws for Modal Logic. Ann. Pure Appl. Logic 69(2-3): 157-193 (1994)
1993
6		Peter Clote, Aleksandar Ignjatovic, Bruce M. Kapron: Parallel computable higher type functionals (Extended Abstract) FOCS 1993: 72-81
5		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
4		Joseph Y. Halpern, Bruce M. Kapron: Zero-One Laws for Modal Logic LICS 1992: 369-380
1991
3		Bruce M. Kapron, Stephen A. Cook: A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) FOCS 1991: 342-347
1989
2		Stephen A. Cook, Bruce M. Kapron: Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) FOCS 1989: 154-159
1987
1		Bruce M. Kapron: Modal Sequents and Definability. J. Symb. Log. 52(3): 756-762 (1987)

Coauthor Index

1	Sergey Berezin	[10]
2	Samuel R. Buss	[13] [15]
3	Peter Clote	[6]
4	Stephen A. Cook	[2] [3]
5	Steven A. Cook	[8]
6	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[5] [9]
7	Valentin Goranko	[16]
8	Dilian Gurov	[10] [11]
9	Joseph Y. Halpern	[4] [7] [17]
10	Dan Holtby	[20] [22]
11	Aleksandar Ignjatovic	[6]
12	Russell Impagliazzo	[5] [9] [18] [19]
13	Robert J. Irwin	[14]
14	David Kempe	[23]
15	Valerie King	[5] [9] [20] [22] [23]
16	Miroslaw Kutylowski	[5] [9]
17	Lior Malka	[21]
18	James S. Royer	[14]
19	Jared Saia	[23]
20	Vishal Sanwalani	[23]
21	Srinivasan Venkatesh	[21]

Colors in the list of coauthors