Agreement, leader election and secure message transmission in networks with Byzantine faulty links and processors /
We consider agreement and leader election on asynchronous networks when the . processors are reliable, but some of the channels are subject to failure. Fischer, Lynch, and Paterson have already shown that no deterministic algorithm can solve the agreement problem on asynchronous networks if any pro...
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1995.
|
| Subjects: | |
| Online Access: | http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=742145391&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD |
Internet
http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=742145391&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQDCushing: Theses & Dissertations Microforms (Does not check out)
| Call Number: |
1995 Dissertation H376 |
|
|---|---|---|
| Call Number | Status | Get It |
| 1995 Dissertation H376 | Available | |
Available Online
| Call Number: |
1995 Dissertation H376 |
|
|---|---|---|
| Call Number | Status | Get It |
| 1995 Dissertation H376 | Available | |