Filter Results:
- Full text PDF available (17)
Publication Year
1979
2019
- This year (5)
- Last 5 years (23)
- Last 10 years (42)
Publication Type
Co-author
Journals and Conferences
Learn More
- Paul Beame, Faith Ellen
- J. Comput. Syst. Sci.
- 2002
2 Research supported by grants from the Natural Sciences and Engineering Research Council of Canada and Communications and Information Technology Ontario. Part of the research was conducted while… (More)
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… (More)
- Trevor Brown, Faith Ellen, Eric Ruppert
- PPOPP
- 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… (More)
- Paul Beame, Faith Ellen
- STOC
- 1999
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… (More)
- Faith Ellen, Maurice Herlihy, Nir Shavit
- PODC
- 1993
The “wait-free hierarchy” defines a deterministic computability separation among multiprocessor synchronization primitives based on the values of n for which they are able to solve n-process… (More)
- Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir
- PODC
- 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… (More)
- Faith Ellen, Prabhakar Ragde, Avi Wigderson
- SIAM J. Comput.
- 1988
- Faith Ellen, Victor Luchangco, Mark Moir, Nir Shavit
- DISC
- 2005
The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations that are faster in the… (More)
- Trevor Brown, Faith Ellen, Eric Ruppert
- PODC
- 2013
We define a new set of primitive operations that greatly simplify the implementation of non-blocking data structures in asynchronous shared-memory systems. The new operations operate on a set of… (More)
- Faith Ellen, Danny Hendler, Nir Shavit
- 46th Annual IEEE Symposium on Foundations of…
- 2005
This paper proves /spl Omega/(n) lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by n processes. For standard… (More)