Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Optimal Bounds for the Predecessor Problem and Related Problems

We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost… Expand

Non-blocking binary search trees

- F. Ellen, P. Fatourou, E. Ruppert, F. V. Breugel
- Computer Science
- PODC '10
- 25 July 2010

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 implementation… Expand

Optimal bounds for the predecessor problem

We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed efficiently stored set. Our algorithms are for the unit-cost… Expand

A general technique for non-blocking trees

- T. Brown, F. Ellen, E. Ruppert
- Computer Science
- PPoPP '14
- 6 February 2014

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 are… Expand

SNZI: scalable NonZero indicators

- F. Ellen, Y. Lev, Victor Luchangco, M. Moir
- Computer Science
- PODC '07
- 12 August 2007

We introduce the SNZI shared object, which is related to traditional shared counters, but has weaker semantics. We also introduce a resettable version of SNZI called SNZI-R. We present… Expand

On the space complexity of randomized synchronization

- F. Ellen, M. Herlihy, N. Shavit
- Computer Science
- PODC '93
- 1 September 1993

The "wait-free hierarchy" provides a classification of multiprocessor synchronization primitives based on the values of n for which there are deterministic wait-free implementations of n-process… Expand

Relations between concurrent-write models of parallel computation

- F. Ellen, P. Ragde, A. Wigderson
- Computer Science
- PODC '84
- 27 August 1984

Shared-memory models for parallel computation (e.g. parallel RAMs) are very natural and already widely used for parallel algorithm design. The various models differ from each other mainly in the way… Expand

Hundreds of impossibility results for distributed computing

- F. Ellen, E. Ruppert
- Computer Science
- Distributed Computing
- 1 September 2003

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 considered… Expand

Obstruction-Free Algorithms Can Be Practically Wait-Free

- F. Ellen, Victor Luchangco, M. Moir, N. Shavit
- Computer Science
- DISC
- 26 September 2005

The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and wait-freedom, and admits simpler implementations that are faster in the… Expand

On the Inherent Sequentiality of Concurrent Objects

- F. Ellen, D. Hendler, N. Shavit
- Computer Science, Mathematics
- SIAM J. Comput.
- 1 May 2012

We present $\Omega(n)$ lower bounds on the worst case time to perform a single instance of an operation in any nonblocking implementation of a large class of concurrent data structures shared by n… Expand