1. Attiya and Welch. Bounds on Worst-Case Responsiveness for Agreement Algorithms
2. Attiya and Welch. Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit arxiv
3. Attiya, Del Pozzo, Milani, Pavloff and Rapetti. The Synchronization Power of Auditable Registers arxiv
4. 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

Participated in FCRC 2023 Plenary Panel: Reflecting on 50 Years of Computing Research, and Future Outlook. youtube recording

My paper with Armando Castañeda and Sergio Rajsbaum, “Locally Solvable Tasks and the Limitations of Valency Arguments” has appeared in Journal on Parallel and Distributed Computing (accessible link).

My paper with Faith Ellen, “The Step Complexity of Multidimensional Approximate Agreement“, which won the best paper award in OPODIS 2022 is now online.

Slides for my talk about hyperproprties and abstraction in concurrent objects, given at FRIDA 2022.

“Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations”, with Constantin Enea and Jennifer Welch (see https://arxiv.org/abs/2106.15554) is now published online (this includes a recording of my talk).
Here are my slides (with the trademarked figure!).

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

Our paper on Detectable Recovery of Lock-Free Data Structures to apear in PPoPP 2022.