• Publications
  • Influence
Optimal Bounds for the Predecessor Problem and Related Problems
  • P. Beame, F. Ellen
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • 1 August 2002
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-costExpand
  • 167
  • 27
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
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-costExpand
  • 100
  • 19
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
SNZI: scalable NonZero indicators
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 presentExpand
  • 98
  • 14
On the space complexity of randomized synchronization
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-processExpand
  • 69
  • 12
Relations between concurrent-write models of parallel computation
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 wayExpand
  • 93
  • 9
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
Obstruction-Free Algorithms Can Be Practically Wait-Free
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 theExpand
  • 64
  • 7
On the Inherent Sequentiality of Concurrent Objects
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 nExpand
  • 35
  • 5