The RedBlue family of universal constructions
From MaRDI portal
Publication:2220397
DOI10.1007/s00446-020-00370-7zbMath1497.68044OpenAlexW3007364590MaRDI QIDQ2220397
Panagiota Fatourou, Nikolaos D. Kallimanis
Publication date: 22 January 2021
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-020-00370-7
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Highly-efficient wait-free synchronization
- Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
- A time complexity lower bound for randomized implementations of some shared objects
- A polylog time wait-free construction for closed objects
- Algorithms adapting to point contention
- The RedBlue Adaptive Universal Constructions
- f -arrays
- Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
- Software transactional memory