Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: An Efficient Lock-Free Logarithmic Search Data Structure Based on Multi-dimensional List
A non-blocking internal binary search tree
Alternatives to splay trees with O(log n) worst-case access times
Persistent B+-Trees in Non-Volatile Main Memory
Practical concurrent unrolled linked lists using lazy synchronization
HOT: A Height Optimized Trie Index for Main-Memory Database Systems
OpLog: a library for scaling update-heavy data structures
H-Tree: An efficient index structure for event matching in publish/subscribe systems
Amortized efficiency of list update and paging rules
Comparing search algorithms using sorting and hashing on disk and in memory
Tango: distributed data structures over a shared log
PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors
A skip list for multicore
Fast non-intrusive memory reclamation for highly-concurrent data structures
On Symmetric and Asymmetric LSHs for Inner Product Search
Performance comparison of extendible hashing and linear hashing techniques
The Linux implementation of a log-structured file system
Design and evaluation of incremental data structures and algorithms for dynamic query interfaces
Biased Skip Lists
Lease/Release: Architectural Support for Scaling Contended Data Structures
Cache-, hash-, and space-efficient bloom filters
Cytoscape.js: a graph theory library for visualisation and analysis
Power Systems Monitoring & Control Centers Sharing SCADA/EMS Information in the Age of Enterprise Mobility
A de novo 10p11.23-p12.1 deletion recapitulates the phenotype observed in WAC mutations and strengthens the role of WAC in intellectual disability and behavior disorders.
Optogenetics: 10 years of microbial opsins in neuroscience
High performance dynamic lock-free hash tables and list-based sets