Found: 7
Select item for more details and to access through your institution.
Wait-freedom with advice.
- Published in:
- Distributed Computing, 2015, v. 28, n. 1, p. 3, doi. 10.1007/s00446-014-0231-6
- By:
- Publication type:
- Article
Byzantine agreement with homonyms.
- Published in:
- Distributed Computing, 2013, v. 26, n. 5/6, p. 321, doi. 10.1007/s00446-013-0190-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
The minimum information about failures for solving non-local tasks in message-passing systems.
- Published in:
- Distributed Computing, 2011, v. 24, n. 5, p. 255, doi. 10.1007/s00446-011-0146-4
- By:
- Publication type:
- Article
The disagreement power of an adversary.
- Published in:
- Distributed Computing, 2011, v. 24, n. 3/4, p. 137, doi. 10.1007/s00446-010-0122-4
- By:
- Publication type:
- Article
On implementing omega in systems with weak reliability and synchrony assumptions.
- Published in:
- Distributed Computing, 2008, v. 21, n. 4, p. 285, doi. 10.1007/s00446-008-0068-y
- By:
- Publication type:
- Article
Making Local Algorithms Wait-Free: the Case of Ring Coloring.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 2, p. 344, doi. 10.1007/s00224-017-9772-y
- By:
- Publication type:
- Article