 | 2012 |
|---|
| 11 |       | Dan Alistarh,
Seth Gilbert,
Rachid Guerraoui,
Corentin Travers:
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.
Algorithmica 62(1-2): 595-629 (2012) |
| 2011 |
|---|
| 10 | | Dan Alistarh,
James Aspnes:
Sub-logarithmic Test-and-Set against a Weak Adversary.
DISC 2011: 97-109 |
| 9 | | Dan Alistarh,
James Aspnes,
Seth Gilbert,
Rachid Guerraoui:
The Complexity of Renaming.
FOCS 2011: 718-727 |
| 8 | | Dan Alistarh,
Seth Gilbert,
Rachid Guerraoui,
Corentin Travers:
Generating Fast Indulgent Algorithms.
ICDCN 2011: 41-52 |
| 7 | | Dan Alistarh,
James Aspnes,
Keren Censor-Hillel,
Seth Gilbert,
Morteza Zadimoghaddam:
Optimal-time adaptive strong renaming, with applications to counting.
PODC 2011: 239-248 |
| 2010 |
|---|
| 6 | | Dan Alistarh,
Seth Gilbert,
Rachid Guerraoui,
Corentin Travers:
Brief Announcement: New Bounds for Partially Synchronous Set Agreement.
DISC 2010: 404-405 |
| 5 | | Dan Alistarh,
Hagit Attiya,
Seth Gilbert,
Andrei Giurgiu,
Rachid Guerraoui:
Fast Randomized Test-and-Set and Renaming.
DISC 2010: 94-108 |
| 4 | | Dan Alistarh,
Seth Gilbert,
Rachid Guerraoui,
Morteza Zadimoghaddam:
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange).
ICALP (2) 2010: 115-126 |
| 3 | | Dan Alistarh,
Seth Gilbert,
Rachid Guerraoui,
Zarko Milosevic,
Calvin C. Newport:
Securing every bit: authenticated broadcast in radio networks.
SPAA 2010: 50-59 |
| 2009 |
|---|
| 2 | | Dan Alistarh,
Seth Gilbert,
Rachid Guerraoui,
Corentin Travers:
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.
ISAAC 2009: 943-953 |
| 2008 |
|---|
| 1 | | Dan Alistarh,
Seth Gilbert,
Rachid Guerraoui,
Corentin Travers:
How to Solve Consensus in the Smallest Window of Synchrony.
DISC 2008: 32-46 |
Data released under the ODC-BY 1.0 license — See also our legal information page