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.

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. permanent link 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