No. Title Author Year
1 Recoverable and Detectable Fetch&Add Nahum, Liad et al. 2022
2 Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers Attiya, Hagit et al. 2021
3 Locally Solvable Tasks and the Limitations of Valency Arguments Attiya, Hagit et al. 2021
4 Optimal Resilience in Systems That Mix Shared Memory and Message Passing Attiya, Hagit et al. 2021
5 Front Matter, Table of Contents, Preface, Conference Organization Attiya, Hagit 2020
6 LIPIcs, Volume 179, DISC 2020, Complete Volume Attiya, Hagit 2020
7 Privatization-Safe Transactional Memories Khyzha, Artem et al. 2019
8 Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects Attiya, Hagit et al. 2019
9 Lower Bounds on the Amortized Time Complexity of Shared Objects Attiya, Hagit et al. 2018
10 Remote Memory References at Block Granularity Attiya, Hagit et al. 2018
11 Nontrivial and Universal Helping for Wait-Free Queues and Stacks Attiya, Hagit et al. 2016
12 Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives Attiya, Hagit et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI