F
Faith Ellen
Researcher at University of Toronto
Publications - 70
Citations - 1480
Faith Ellen is an academic researcher from University of Toronto. The author has contributed to research in topics: Upper and lower bounds & Data structure. The author has an hindex of 21, co-authored 68 publications receiving 1343 citations.
Papers
More filters
Proceedings ArticleDOI
Non-blocking binary search trees
TL;DR: 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.
Proceedings ArticleDOI
A general technique for non-blocking trees
TL;DR: In this paper, the authors 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, where updates are permitted to modify any contiguous portion of the tree atomically.
Proceedings ArticleDOI
SNZI: scalable NonZero indicators
TL;DR: This work introduces the SNZI shared object, which is related to traditional shared counters, but has weaker semantics, and introduces a resettable version of SNZI called SNZI-R.
Posted Content
A General Technique for Non-blocking Trees
TL;DR: 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 and an experimental performance analysis demonstrates that the Java implementation of a chromatic tree rivals, and often significantly outperforms, other leading concurrent dictionaries.
Posted Content
Tight Bounds for Set Disjointness in the Message Passing Model
TL;DR: In this article, a lower bound of the form Ω(n \cdot k)$ for the set disjointness problem in the message passing model was shown.