Election in partially anonymous networks with arbitrary knowledge in message passing systems.
- Published in:
- Distributed Computing, 2012, v. 25, n. 4, p. 297, doi. 10.1007/s00446-012-0163-y
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2012 AND VI 25 AND IP 4
Results: 4
1
2
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack.
- Published in:
- Distributed Computing, 2012, v. 25, n. 4, p. 261, doi. 10.1007/s00446-012-0160-1
- By:
- Publication type:
- Article
3
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony.
- Published in:
- Distributed Computing, 2012, v. 25, n. 4, p. 279, doi. 10.1007/s00446-012-0165-9
- By:
- Publication type:
- Article
4
Failure detectors encapsulate fairness.
- Published in:
- Distributed Computing, 2012, v. 25, n. 4, p. 313, doi. 10.1007/s00446-012-0164-x
- By:
- Publication type:
- Article