Randomized Concurrent Set Union and Generalized Wake-Up
From MaRDI portal
Publication:5145199
DOI10.1145/3293611.3331593OpenAlexW2962741105MaRDI QIDQ5145199FDOQ5145199
S. Jayanti, Robert E. Tarjan, Enric Boix-AdserΓ
Publication date: 20 January 2021
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3293611.3331593
data structurelower boundasynchronousdisjoint set unionconcurrentlinearizableunion findwait freeJayanti's wake up
Cited In (3)
Recommendations
- A Randomized Concurrent Algorithm for Disjoint Set Union π π
- Title not available (Why is that?) π π
- Enumeration and random generation of concurrent computations π π
- Title not available (Why is that?) π π
- Randomized uniform self-stabilizing mutual exclusion π π
- Randomized mutual exclusion algorithms revisited π π
- Concurrent disjoint set union π π
- The concurrency hierarchy, and algorithms for unbounded concurrency π π
- Randomized mutual exclusion with sub-logarithmic RMR-complexity π π
This page was built for publication: Randomized Concurrent Set Union and Generalized Wake-Up
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145199)