Results: 4
Efficient distributed approximation algorithms via probabilistic tree embeddings.
- Published in:
- Distributed Computing, 2012, v. 25, n. 3, p. 189, doi. 10.1007/s00446-012-0157-9
- By:
- Publication type:
- Article
Window-based greedy contention management for transactional memory: theory and practice.
- Published in:
- Distributed Computing, 2012, v. 25, n. 3, p. 225, doi. 10.1007/s00446-012-0159-7
- By:
- Publication type:
- Article
Fault-containing self-stabilization in asynchronous systems with constant fault-gap.
- Published in:
- Distributed Computing, 2012, v. 25, n. 3, p. 207, doi. 10.1007/s00446-011-0155-3
- By:
- Publication type:
- Article
Partial synchrony based on set timeliness.
- Published in:
- Distributed Computing, 2012, v. 25, n. 3, p. 249, doi. 10.1007/s00446-012-0158-8
- By:
- Publication type:
- Article