2 papers
cs.DS2024
A Lock-free Binary Trie
Jeremy Ko
A binary trie is a sequential data structure for a dynamic set on the universe supporting Search with worst-case step complexity, and Insert, Delete, and P…
cs.DC2018
The Amortized Analysis of a Non-blocking Chromatic Tree
Jeremy Ko
A non-blocking chromatic tree is a type of balanced binary search tree where multiple processes can concurrently perform search and update operations. We prove that a certain imple…