Polylogarithmic concurrent data structures from monotone circuits
From MaRDI portal
Publication:5395675
DOI10.1145/2108242.2108244zbMath1281.68086OpenAlexW2034325394MaRDI QIDQ5395675
Keren Censor-Hillel, Hagit Attiya, James Aspnes
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2108242.2108244
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (10)
Tight Bounds for Asynchronous Renaming ⋮ Store-collect in the presence of continuous churn with application to snapshots and lattice agreement ⋮ Long-lived counters with polylogarithmic amortized step complexity ⋮ Linear space bootstrap communication schemes ⋮ A complexity-based classification for multiprocessor synchronization ⋮ Faster randomized consensus with an oblivious adversary ⋮ Lower Bounds for Restricted-Use Objects ⋮ Concurrent Use of Write-Once Memory ⋮ Communication-efficient randomized consensus ⋮ Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
This page was built for publication: Polylogarithmic concurrent data structures from monotone circuits
