• Publications
  • Influence
Non-blocking binary search trees
This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory system using single-word compare-and-swap operations. The implementationExpand
  • 155
  • 25
The computational power of population protocols
We consider the model of population protocols introduced by Angluin et al. (Computation in networks of passively mobile finite-state sensors, pp. 290–299. ACM, New York, 2004), in which anonymousExpand
  • 263
  • 14
A general technique for non-blocking trees
We describe a general technique for obtaining provably correct, non-blocking implementations of a large class of tree data structures where pointers are directed from parents to children. Updates areExpand
  • 86
  • 14
Lock-free linked lists and skip lists
Lock-free shared data structures implement distributed objects without the use of mutual exclusion, thus providing robustness and reliability. We present a new lock-free implementation ofExpand
  • 139
  • 12
An Introduction to Population Protocols
Population protocols are used as a theoretical model for a collection (or population) of tiny mobile agents that interact with one another to carry out a computation. The agents are identicallyExpand
  • 228
  • 10
Hundreds of impossibility results for distributed computing
Abstract.We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models consideredExpand
  • 150
  • 7
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
We introduce a new theoretical model of ad hoc mobile computing in which agents have restricted memory, highly unpredictable movement and no initial knowledge of the system. Each agent's memory canExpand
  • 64
  • 7
Anonymous and fault-tolerant shared-memory computing
The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not haveExpand
  • 61
  • 6
On the Power of Anonymous One-Way Communication
We consider a population of anonymous processes communicating via anonymous message-passing, where the recipient of each message is chosen by an adversary and the sender is not identified to theExpand
  • 28
  • 5
The amortized complexity of non-blocking binary search trees
We improve upon an existing non-blocking implementation of a binary search tree from single-word compare-and-swap instructions. We show that the worst-case amortized step complexity of performing aExpand
  • 31
  • 5