Bruce M. Kapron
Loading Google Thumbnails...
| 2010 |
|---|
| 9 | Fast asynchronous Byzantine agreement and leader election with full information. Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload |
| 2008 |
|---|
| 8 | Lower bound for scalable Byzantine Agreement. Dan Holtby, Bruce M. Kapron, Valerie King. Distributed Computing (21): 239-248 (2008). Web SearchBibTeXDownload |
| 7 | Fast asynchronous byzantine agreement and leader election with full information. Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani. SODA 2008, 1038-1047. Web SearchBibTeXDownload |
| 2006 |
|---|
| 6 | Lower bound for scalable Byzantine Agreement. Dan Holtby, Bruce M. Kapron, Valerie King. PODC 2006, 285-291. Web SearchBibTeXDownload |
| 2003 |
|---|
| 5 | Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193]. Joseph Y. Halpern, Bruce M. Kapron. Ann. Pure Appl. Logic (121): 281-283 (2003). Web SearchBibTeXDownload |
| 1996 |
|---|
| 4 | Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski. J. Comput. Syst. Sci. (53): 104-111 (1996). Web SearchBibTeXDownload |
| 1994 |
|---|
| 3 | Zero-One Laws for Modal Logic. Joseph Y. Halpern, Bruce M. Kapron. Ann. Pure Appl. Logic (69): 157-193 (1994). Web SearchBibTeXDownload |
| 1993 |
|---|
| 2 | Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski. STACS 1993, 386-397. Web SearchBibTeXDownload |
| 1992 |
|---|
| 1 | Zero-One Laws for Modal Logic. Joseph Y. Halpern, Bruce M. Kapron. LICS 1992, 369-380. Web SearchBibTeXDownload |
from DBLP and Google Scholar
