How much memory is needed for leader election.
- Published in:
- Distributed Computing, 2011, v. 24, n. 2, p. 65, doi. 10.1007/s00446-011-0131-y
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2011 AND VI 24 AND IP 2
Results: 5
1
2
Distributed discovery of large near-cliques.
- Published in:
- Distributed Computing, 2011, v. 24, n. 2, p. 79, doi. 10.1007/s00446-011-0132-x
- By:
- Publication type:
- Article
3
Modeling radio networks.
- Published in:
- Distributed Computing, 2011, v. 24, n. 2, p. 101, doi. 10.1007/s00446-011-0135-7
- By:
- Publication type:
- Article
4
Derandomizing random walks in undirected graphs using locally fair exploration strategies.
- Published in:
- Distributed Computing, 2011, v. 24, n. 2, p. 91, doi. 10.1007/s00446-011-0138-4
- By:
- Publication type:
- Article
5
Fully-adaptive algorithms for long-lived renaming.
- Published in:
- Distributed Computing, 2011, v. 24, n. 2, p. 119, doi. 10.1007/s00446-011-0137-5
- By:
- Publication type:
- Article