- Attiya and Welch. Bounds on Worst-Case Responsiveness for Agreement Algorithms
- Attiya and Welch. Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit arxiv
- Attiya, Del Pozzo, Milani, Pavloff and Rapetti. The Synchronization Power of Auditable Registers arxiv
- Lev Lehman, Attiya and Hendler. Recoverable and Detectable Self-Implementations of Swap arxiv
Two regular papers:
- Topological Characterization of Task Solvability in General Models of Computation with Armando Castañeda and Thomas Nowak arxiv
- One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks with Pierre Fraigniaud, Ami Paz and Sergio Rajsbaum arxiv
Two brief announcments:
- Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit with Jennifer Welch arxiv
- Recoverable and Detectable Self-Implementations of Swap with Tomer Lev Lehman and Danny Hendler arxiv
Faithful Simulation of Randomized BFT Protocols on Block DAGs, with Constantin Enea and Shafik Nassar, was accepted to CONCUR 2023. paper in LIPIcs NEW
My paper with Faith Ellen, “The Step Complexity of Multidimensional Approximate Agreement“, which won the best paper award in OPODIS 2022 is now online.
The paper “Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations”, also with Constantin Enea and Jennifer Welch (see https://arxiv.org/abs/2106.15554) was accepted to PODC 2022.
The paper “Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers”, with Constantin Enea and Jennifer Welch appeared in DISC 2021 (see https://arxiv.org/abs/2105.06614). DISC pre-recorded talk