Details
Title
Alistarh, Dan
Sciper ID
177872
Affiliated labs
LPD
Publications
Distributed Algorithms
Fast Randomized Test-and-Set and Renaming
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
How to Allocate Tasks Asynchronously
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Optimal-Time Adaptive Strong Renaming, with Applications to Counting
Randomized versus Deterministic Implementations of Concurrent Data Structures
Sub-Logarithmic Test-and-Set Against a Weak Adversary
The Complexity of Renaming
The Complexity of Renaming
See complete list of publications (25)
Fast Randomized Test-and-Set and Renaming
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
How to Allocate Tasks Asynchronously
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Optimal-Time Adaptive Strong Renaming, with Applications to Counting
Randomized versus Deterministic Implementations of Concurrent Data Structures
Sub-Logarithmic Test-and-Set Against a Weak Adversary
The Complexity of Renaming
The Complexity of Renaming
See complete list of publications (25)
Link to search
All resources
Record appears in
Authorities > People