Share This Author
Optimal Bounds for the Predecessor Problem and Related Problems
- P. Beame, Faith Ellen
- Mathematics, Computer ScienceJ. Comput. Syst. Sci.
- 1 August 2002
TLDR
Non-blocking binary search trees
- Faith Ellen, P. Fatourou, Eric Ruppert, F. Breugel
- Computer SciencePODC
- 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…
Optimal bounds for the predecessor problem
- P. Beame, Faith Ellen
- Computer Science, MathematicsSTOC '99
- 1 May 1999
TLDR
SNZI: scalable NonZero indicators
- Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir
- Computer SciencePODC '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…
A general technique for non-blocking trees
- Trevor Brown, Faith Ellen, Eric Ruppert
- Computer SciencePPoPP '14
- 6 February 2014
TLDR
On the space complexity of randomized synchronization
- Faith Ellen, M. Herlihy, N. Shavit
- Computer SciencePODC '93
- 1 September 1993
TLDR
Relations between concurrent-write models of parallel computation
- Faith Ellen, P. Ragde, A. Wigderson
- Computer SciencePODC '84
- 27 August 1984
TLDR
Hundreds of impossibility results for distributed computing
- Faith Ellen, Eric Ruppert
- Computer ScienceDistributed 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…
On the Inherent Sequentiality of Concurrent Objects
- Faith Ellen, Danny Hendler, N. Shavit
- Computer Science, MathematicsSIAM 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…
Obstruction-Free Algorithms Can Be Practically Wait-Free
- Faith Ellen, Victor Luchangco, Mark Moir, N. Shavit
- Computer ScienceDISC
- 26 September 2005
TLDR
...
...