| dc.contributor.advisor | Frank T. Leighton. | en_US |
| dc.contributor.author | Feldman, Paul Neil | en_US |
| dc.contributor.other | Massachusetts Institute of Technology. Dept. of Mathematics. | en_US |
| dc.date.accessioned | 2005-08-09T16:52:47Z | |
| dc.date.available | 2005-08-09T16:52:47Z | |
| dc.date.copyright | 1988 | en_US |
| dc.date.issued | 1988 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/14368 | |
| dc.description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988. | en_US |
| dc.description | Title as it appeared in M.I.T Graduate List, June 1988: Optimal protocols for Byzantine agreement. | en_US |
| dc.description | Includes bibliographical references. | en_US |
| dc.description.statementofresponsibility | by Pal Neil Feldman. | en_US |
| dc.format.extent | 60 p. | en_US |
| dc.format.extent | 5273718 bytes | |
| dc.format.extent | 5273479 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| dc.rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
| dc.subject | Mathematics. | en_US |
| dc.title | Optimal algorithms for Byzantine agreement | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | Ph.D. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
| dc.identifier.oclc | 20051076 | en_US |
