The following pages link to Adam Morrison (Q1954245):
Displaying 12 items.
- Common2 extended to stacks and unbounded concurrency (Q1954246) (← links)
- Specification and space complexity of collaborative text editing (Q2220887) (← links)
- The CB tree: a practical concurrent self-adjusting search tree (Q2256968) (← links)
- Fast and scalable rendezvousing (Q2441532) (← links)
- Limitations of Highly-Available Eventually-Consistent Data Stores (Q2796275) (← links)
- From bounded to unbounded concurrency objects and back (Q2943391) (← links)
- CBTree: A Practical Concurrent Self-Adjusting Search Tree (Q4909398) (← links)
- (Q5090915) (← links)
- Common2 extended to stacks and unbounded concurrency (Q5177283) (← links)
- Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity (Q5197664) (← links)
- Specification and Complexity of Collaborative Text Editing (Q5361944) (← links)
- A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms (Q5363806) (← links)
