Designing algorithms for dependent process failures

Authors:
Flavio Junqueira;Keith Marzullo
Affiliations:
University of California, San Diego, Department of Computer Science and Engineering;University of California, San Diego, Department of Computer Science and Engineering
Venue:
Future directions in distributed computing
Year:
2003

The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Byzantine quorum systems

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Muteness detectors for consensus with Byzantine processes

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing

Optimizing Threshold Protocols in Adversarial Structures

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The disagreement power of an adversary: extended abstract

Proceedings of the 28th ACM symposium on Principles of distributed computing
The disagreement power of an adversary

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Concurrent computing and shellable complexes

DISC'10 Proceedings of the 24th international conference on Distributed computing
Distributed programming with tasks

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A survey on some recent advances in shared memory models

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity

Hi-index	0.00