Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: Lock-free deques and doubly linked lists
A lazy concurrent list-based set algorithm
A practical concurrent binary search tree
Biased Skip Lists
A survey of B-tree locking techniques
Performance Evaluation of Concurrent Lock-free Data Structures on GPUs
From Theory to Practice: Plug and Play with Succinct Data Structures
A non-blocking internal binary search tree
Parallelizing Skip Lists for In-Memory Multi-Core Database Systems
Data, Information, Knowledge, Wisdom: A Doubly Linked Chain?
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
The Skiplist-Based LSM Tree
A Scalable Lock Manager for Multicores
Efficient optimistic concurrency control using loosely synchronized clocks
QueCC: A Queue-oriented, Control-free Concurrency Architecture
TTLock: Tenacious and traceless logic locking
Adaptive locks: Combining transactions and locks for efficient concurrency
Cling: A Memory Allocator to Mitigate Dangling Pointers
A class of dynamic memory allocation algorithms
The lock holder and the lock waiter pre-emption problems: nip them in the bud using informed spinlocks (I-Spinlock)
Apologizing versus asking permission: optimistic concurrency control for abstract data types
A Statistical Recurrent Model on the Manifold of Symmetric Positive Definite Matrices
Wait-Free Synchronization.
Interimplant Papilla Reconstruction
Unbiased online active learning in data streams
Using Heuristics to Estimate an Appropriate Number of Latent Topics in Source Code Analysis