Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory
Consistency Oblivious Programming
Considering Rendering Algorithms for In Situ Visualization
Connecting with Computer Science, 2e Chapter 8 Data Structures
Confluently Persistent Tries for Efficient Version Control
Conditions Under Which Conditional Independence and Scoring
Condensed
Concurrent Search Tree by Lazy Splaying
Concurrent R
Concurrent Programming Without Locks
Concurrent Libraries with Foresight
Concurrent Data Structures in Architectures with Limited Shared
Concurrent Data Structures (Book Chapter).
Concurrent Cache-Oblivious B-trees using Transactional Memory
Concurrent Cache-Oblivious B-Trees
Concurrent Access Algorithms for Different Data Structures: A
Concurrency and Recovery in Generalized Search Trees
Concrete Data Types
Concise Notes on Data Structures and Algorithms
Conc-Trees for Functional and Parallel Programming
