Renaming in synchronous message passing systems with Byzantine failures.
- Published in:
- Distributed Computing, 2008, v. 20, n. 6, p. 403, doi. 10.1007/s00446-007-0045-x
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2008 AND VI 20 AND IP 6
Results: 5
1
2
A fast distributed approximation algorithm for minimum spanning trees.
- Published in:
- Distributed Computing, 2008, v. 20, n. 6, p. 391, doi. 10.1007/s00446-007-0047-8
- By:
- Publication type:
- Article
3
Low-latency atomic broadcast in the presence of contention.
- Published in:
- Distributed Computing, 2008, v. 20, n. 6, p. 435, doi. 10.1007/s00446-007-0052-y
- By:
- Publication type:
- Article
4
Introduction to special issue dedicated to the DISC 20th anniversary.
- Published in:
- 2008
- By:
- Publication type:
- Editorial
5
The weakest failure detectors to boost obstruction-freedom.
- Published in:
- Distributed Computing, 2008, v. 20, n. 6, p. 415, doi. 10.1007/s00446-007-0046-9
- By:
- Publication type:
- Article