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.

Our paper “Separating lock-freedom from wait-freedom at every level of the consensus hierarchy” (previously published in PODC 2018) appeared in Journal of Parallel and Distributed Computing. link open link for 50 days

Our paper “Store-collect in the presence of continuous churn with application to snapshots and lattice agreement” is published in the Information&Computation special issue of SSS 2020. author’s link

∇ Paper on Recoverable and detectable Fetch&Add, by Liad Nahum, Hagit Attiya, Ohad Ben-Baruch and Danny Hendler, has appeared in OPODIS 2021. My talk on Youtube

New paper evaluating the use of Optane Data Center Persistent Memory Module (DCPMM) for scientific computing on high-performance machines has been accepted to Fault Tolerance for HPC at eXtreme Scale (FTXS 2021).
The paper was featured in HPCWire.

My keynote at SRDS 2021 on “Preserving hyperproperties when using concurrent objects” is on Youtube.

Ask Me Anything in EuroSys 2021, on Wednesday, April 28, at 14:30 BST. Youtube video

Our paper “Specification and space complexity of collaborative text editing” (previously published in PODC 2016) appeared in Theoretical Computer Science. link open link for 50 days

Two papers accepted to OPODIS 2020:

• Hagit Attiya, Sweta Kumari, and Noa Schiller, Optimal Resilience in Systems that Mix shared Memory and Message      arxiv
• Hagit Attiya, Armando Castañeda, and Sergio Rajsbaum. Locally Solvable Tasks and the Limitations of Valency Arguments     arxiv