Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: A Fast Lock-Free Internal Binary Search Tree
A non-blocking internal binary search tree
The Skiplist-Based LSM Tree
High performance dynamic lock-free hash tables and list-based sets
Concurrency control and recovery for balanced B-link trees
The Bw-Tree: A B-tree for new hardware platforms
Persistent B+-Trees in Non-Volatile Main Memory
Applications of Path Compression on Balanced Trees
Performance of B+ tree concurrency control algorithms
Making B+- trees cache conscious in main memory
Cache-oblivious B-trees
A dichromatic framework for balanced trees
Lock-free linked lists and skip lists
LHlf: lock-free linear hashing (poster paper)
Alternatives to splay trees with O(log n) worst-case access times
The string B-tree: a new data structure for string search in external memory and its applications
Implementing Lock-Free Queues
PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors
TLB misses: The Missing Issue of Adaptive Radix Tree?
Split-ordered lists: lock-free extensible hash tables
Amortized Rotation Cost in AVL Trees
clique - width and well - quasi - order case for support previous track record .
On-line personalization of a touch screen based keyboard
Automatic Summarization of Bug Reports
Describing the emotional states that are expressed in speech
Introduction to Algorithms