The RedBlue family of universal constructions
From MaRDI portal
Publication:2220397
DOI10.1007/S00446-020-00370-7zbMATH Open1497.68044OpenAlexW3007364590MaRDI QIDQ2220397FDOQ2220397
Authors: 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
Recommendations
Cites Work
- Algorithms adapting to point contention
- The RedBlue Adaptive Universal Constructions
- Title not available (Why is that?)
- Software transactional memory
- F-arrays, implementation and applications
- Bounds on the shared memory requirements for long-lived \& adaptive objects (extended abstract)
- Adaptive and efficient algorithms for lattice agreement and renaming
- A time complexity lower bound for randomized implementations of some shared objects
- Space- and time-adaptive nonblocking algorithms
- Highly-efficient wait-free synchronization
- A polylog time wait-free construction for closed objects
Cited In (5)
Uses Software
This page was built for publication: The RedBlue family of universal constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220397)