The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Parallel program design: a foundation
Parallel program design: a foundation
Automatically increasing the fault-tolerance of distributed systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Self-stabilizing extensions for message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Self-stabilization
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Distributed Algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
On-Line detection and prediction of temporal patterns
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
International Journal of Grid and Utility Computing
| Hi-index | 0.01 |
For a complete network of n processors within which communication lines are private, we show how to achieve concurrently many Byzantine Agreements within constant expected time both on synchronous and asynchronous networks. As an immediate consequence, ...