Optimal algorithms for Byzantine agreement
Citable URI:
http://hdl.handle.net/1721.1/14368
| Title: | Optimal algorithms for Byzantine agreement |
| Author: | Feldman, Paul Neil |
| Other Contributors: | Massachusetts Institute of Technology. Dept. of Mathematics. |
| Advisor: | Frank T. Leighton. |
| Department: | Massachusetts Institute of Technology. Dept. of Mathematics. |
| Publisher: | Massachusetts Institute of Technology |
| Issue Date: | 1988 |
| Description: |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988. Title as it appeared in M.I.T Graduate List, June 1988: Optimal protocols for Byzantine agreement. Includes bibliographical references. |
| URI: | http://hdl.handle.net/1721.1/14368 |
| Keywords: | Mathematics. |
Files in this item
| Files | Size | Format | View | Description |
|---|---|---|---|---|
| Preview, non-printable (open to all) | 5.273Mb |
View/ |
Preview, non-printable (open to all) | |
| Full printable version (MIT only) | 5.273Mb |
View/ |
Full printable version (MIT only) |
This item appears in the following Collection(s)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|