Papers tagged data structures
- A Constant Algorithm for Implementing the LFU Cache Eviction Scheme
- A New Storage Architecture for Consistent and Durable Data Structures Using Non-volatile Memory
- A Wait-Free Queue as Fast as Fetch-and-Add
- Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design
- Dynamic Hash Tables
- Efficient Lock-free B-trees
- Efficient String Matching: An Aid to Bibliographic Search
- Ideal Hash Trees
- Least Common Ancestors Revisited
- Level Ancestor Problem Simplified
- LISP II Garbage Collector
- Making Lockless Synchronization Fast: Performance Implications of Memory Reclamation
- Optimal Purely Functional Priority Queues
- Purely Functional Data Structures
- Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
- Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
- Stasis: Flexible transactional storage
- Tidy Data
- Write-Optimized B-Trees