A tradeoff between safety and liveness for randomized coordinated attack protocols

Authors:
George Varghese;Nancy A. Lynch
Affiliations:
Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA
Venue:
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Year:
1992

The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a distributed environment

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

The NetWire emulator: a tool for teaching and understanding networks

Proceedings of the 6th annual conference on Innovation and technology in computer science education
Probabilistic Büchi automata with non-extremal acceptance thresholds

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Synchronous consensus under hybrid process and link failures

Theoretical Computer Science

Hi-index	0.00