The following pages link to (Q4436059):
Displaying 20 items.
- Lock-free deques and doubly linked lists (Q436838) (← links)
- Contention-sensitive data structures and algorithms (Q526873) (← links)
- Automated flaw detection in algebraic specifications (Q616853) (← links)
- Parallel implementations of Brunotte's algorithm (Q635350) (← links)
- An efficient approach to achieve compositionality using optimized multi-version object based transactional systems (Q2139092) (← links)
- The amortized analysis of a non-blocking chromatic tree (Q2202000) (← links)
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree (Q2232591) (← links)
- Nonblocking \(k\)-compare-single-swap (Q2272205) (← links)
- Built-in coloring for highly-concurrent doubly-linked lists (Q2392250) (← links)
- On the correctness of a lock-free compression-based elastic mechanism for a hash trie design (Q2676227) (← links)
- In the Search for Optimal Concurrency (Q2835023) (← links)
- Abstract Specifications for Concurrent Maps (Q2988678) (← links)
- Liveness-Preserving Atomicity Abstraction (Q3012940) (← links)
- (Q3300815) (← links)
- Local Reasoning for Global Graph Properties (Q5041096) (← links)
- (Q5090915) (← links)
- (Q5091079) (← links)
- (Q5091080) (← links)
- (Q5091081) (← links)
- NB{\texttt{malloc}}: Allocating memory in a lock-free manner (Q5961972) (← links)
