| No. |
Title |
Author |
Year |
| 1 |
Faithful Simulation of Randomized BFT Protocols on Block DAGs |
Attiya, Hagit et al. |
2023 |
| 2 |
Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492) |
Attiya, Hagit et al. |
2023 |
| 3 |
The Step Complexity of Multidimensional Approximate Agreement |
Attiya, Hagit et al. |
2023 |
| 4 |
Recoverable and Detectable Fetch&Add |
Nahum, Liad et al. |
2022 |
| 5 |
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers |
Attiya, Hagit et al. |
2021 |
| 6 |
Locally Solvable Tasks and the Limitations of Valency Arguments |
Attiya, Hagit et al. |
2021 |
| 7 |
Optimal Resilience in Systems That Mix Shared Memory and Message Passing |
Attiya, Hagit et al. |
2021 |
| 8 |
Front Matter, Table of Contents, Preface, Conference Organization |
Attiya, Hagit |
2020 |
| 9 |
LIPIcs, Volume 179, DISC 2020, Complete Volume |
Attiya, Hagit |
2020 |
| 10 |
Privatization-Safe Transactional Memories |
Khyzha, Artem et al. |
2019 |
| 11 |
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects |
Attiya, Hagit et al. |
2019 |
| 12 |
Lower Bounds on the Amortized Time Complexity of Shared Objects |
Attiya, Hagit et al. |
2018 |
| 13 |
Remote Memory References at Block Granularity |
Attiya, Hagit et al. |
2018 |
| 14 |
Nontrivial and Universal Helping for Wait-Free Queues and Stacks |
Attiya, Hagit et al. |
2016 |
| 15 |
Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives |
Attiya, Hagit et al. |
2016 |
