research
∙
03/16/2021
Wait-free approximate agreement on graphs
Approximate agreement is one of the few variants of consensus that can b...
share
research
∙
11/04/2018
Why Extension-Based Proofs Fail
We prove that a class of fundamental shared memory tasks are not amenabl...
research
∙
07/18/2018
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing
This work is a continuation of efforts to define and understand competit...
research
∙
12/18/2017
Pragmatic Primitives for Non-blocking Data Structures
We define a new set of primitive operations that greatly simplify the im...
research
∙
12/18/2017
A General Technique for Non-blocking Trees
We describe a general technique for obtaining provably correct, non-bloc...
research
∙
11/07/2017
Revisionist Simulations: A New Approach to Proving Space Lower Bounds
Determining the space complexity of x-obstruction-free k-set agreement f...
research
∙
10/09/2017
