Results: 5
Tight bounds for shared memory systems accessed by Byzantine processes.
- Published in:
- Distributed Computing, 2005, v. 18, n. 2, p. 99, doi. 10.1007/s00446-005-0125-8
- By:
- Publication type:
- Article
Introduction to the special issue DISC 2003.
- Published in:
- Distributed Computing, 2005, v. 18, n. 2, p. 111, doi. 10.1007/s00446-005-0132-9
- By:
- Publication type:
- Article
Tight bounds for k-set agreement with limited-scope failure detectors.
- Published in:
- Distributed Computing, 2005, v. 18, n. 2, p. 157, doi. 10.1007/s00446-005-0141-8
- By:
- Publication type:
- Article
GeoQuorums: implementing atomic memory in mobile ad hoc networks.
- Published in:
- Distributed Computing, 2005, v. 18, n. 2, p. 125, doi. 10.1007/s00446-005-0140-9
- By:
- Publication type:
- Article
Probabilistic quorums for dynamic systems.
- Published in:
- Distributed Computing, 2005, v. 18, n. 2, p. 113, doi. 10.1007/s00446-005-0139-2
- By:
- Publication type:
- Article