| 2026 | PODC | Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing. | Hagit Attiya, Armando Castaeda, Constantin Enea |
| 2026 | PODC | Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience. | Hagit Attiya, Itay Flam, Jennifer L. Welch |
| 2026 | PODC | Brief Announcement: A Space-Efficient Lock-Free Linear-Probing Hash Table. | Hagit Attiya, Rotem Oshman, Noa Schiller |
| 2026 | SIROCCO | Equivalence and Separation Between Heard-Of and Asynchronous Message-Passing Models. | Hagit Attiya, Armando Castaeda, Dhrubajyoti Ghosh, Thomas Nowak |
| 2025 | OPODIS | Recoverable Lock-Free Locks. | Hagit Attiya, Panagiota Fatourou, Eleftherios Kosmas, Yuanhao Wei |
| 2025 | PODC | Auditing without Leaks Despite Curiosity. | Hagit Attiya, Antonio Fernndez Anta, Alessia Milani, Alexandre Rapetti, Corentin Travers |
| 2025 | PODC | Solvability Characterization for General Three-Process Tasks. | Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2025 | STOC | History-Independent Concurrent Hash Tables. | Hagit Attiya, Michael A. Bender, Martn Farach-Colton, Rotem Oshman, Noa Schiller |
| 2025 | SIROCCO | On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement. | Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2024 | PODC | History-Independent Concurrent Objects. | Hagit Attiya, Michael A. Bender, Martn Farach-Colton, Rotem Oshman, Noa Schiller |
| 2024 | PODC | Strong Linearizability using Primitives with Consensus Number 2. | Hagit Attiya, Armando Castaeda, Constantin Enea |
| 2023 | CIAC | Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. | Hagit Attiya, Noa Schiller |
| 2023 | CONCUR | Faithful Simulation of Randomized BFT Protocols on Block DAGs. | Hagit Attiya, Constantin Enea, Shafik Nassar |
| 2023 | OPODIS | The Synchronization Power of Auditable Registers. | Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti |
| 2023 | OPODIS | Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. | Hagit Attiya, Jennifer L. Welch |
| 2023 | OPODIS | Bounds on Worst-Case Responsiveness for Agreement Algorithms. | Hagit Attiya, Jennifer L. Welch |
| 2023 | OPODIS | Recoverable and Detectable Self-Implementations of Swap. | Tomer Lev Lehman, Hagit Attiya, Danny Hendler |
| 2022 | OPODIS | The Step Complexity of Multidimensional Approximate Agreement. | Hagit Attiya, Faith Ellen |
| 2022 | PODC | Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. | Hagit Attiya, Constantin Enea, Jennifer L. Welch |
| 2022 | PPoPP | Detectable recovery of lock-free data structures. | Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas |
| 2021 | OPODIS | Recoverable and Detectable Fetch&Add. | Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler |
| 2021 | PODC | 2021 Principles of Distributed Computing Doctoral Dissertation Award. | Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi |
| 2021 | SSS | Flat-Combining-Based Persistent Data Structures for Non-volatile Memory. | Matan Rusanovsky, Hagit Attiya, Ohad Ben-Baruch, Tom Gerby, Danny Hendler, Pedro Ramalhete |
| 2020 | OPODIS | Locally Solvable Tasks and the Limitations of Valency Arguments. | Hagit Attiya, Armando Castaeda, Sergio Rajsbaum |
| 2020 | OPODIS | Optimal Resilience in Systems That Mix Shared Memory and Message Passing. | Hagit Attiya, Sweta Kumari, Noa Schiller |
| 2020 | PODC | Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. | Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch |
| 2020 | SPAA | Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures. | Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas |
| 2020 | SSS | Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. | Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch |
| 2018 | PODC | Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory. | Hagit Attiya, Ohad Ben-Baruch, Danny Hendler |
| 2018 | PODC | Separating Lock-Freedom from Wait-Freedom. | Hagit Attiya, Armando Castaeda, Danny Hendler, Matthieu Perrin |
| 2018 | PPoPP | Safe privatization in transactional memory. | Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky |
| 2017 | OPODIS | Lower Bounds on the Amortized Time Complexity of Shared Objects. | Hagit Attiya, Arie Fouren |
| 2017 | OPODIS | Remote Memory References at Block Granularity. | Hagit Attiya, Gili Yavneh |
| 2016 | PODC | Specification and Complexity of Collaborative Text Editing. | Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski |
| 2015 | OPODIS | Nontrivial and Universal Helping for Wait-Free Queues and Stacks. | Hagit Attiya, Armando Castaeda, Danny Hendler |
| 2015 | OPODIS | Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives. | Hagit Attiya, Arie Fouren |
| 2015 | PODC | Limitations of Highly-Available Eventually-Consistent Data Stores. | Hagit Attiya, Faith Ellen, Adam Morrison |
| 2015 | PODC | Trading Fences with RMRs and Separating Memory Models. | Hagit Attiya, Danny Hendler, Philipp Woelfel |
| 2014 | PODC | Concurrent updates with RCU: search tree as an example. | Maya Arbel, Hagit Attiya |
| 2013 | ICDCS | Safety of Deferred Update in Transactional Memory. | Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi |
| 2013 | PODC | Upper bound on the complexity of solving hard renaming. | Hagit Attiya, Armando Castaeda, Maurice Herlihy, Ami Paz |
| 2013 | PODC | A programming language perspective on transactional memory consistency. | Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky |
| 2013 | PODC | An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract. | Hagit Attiya, Danny Hendler, Smadar Levy |
| 2012 | PODC | Faster than optimal snapshots (for a while): preliminary version. | James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen |
| 2012 | SPAA | Lower bounds for restricted-use objects: extended abstract. | James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler |
| 2012 | SIROCCO | Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. | Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers |
| 2011 | ICDCN | Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It. | Hagit Attiya |
| 2011 | ICDCN | Single-Version STMs Can Be Multi-version Permissive (Extended Abstract). | Hagit Attiya, Eshcar Hillel |
| 2011 | POPL | Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. | Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, Martin T. Vechev |
| 2011 | SSS | Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. | Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sbastien Tixeuil |
| 2011 | SSS | A Non-topological Proof for the Impossibility of k-Set Agreement. | Hagit Attiya, Armando Castaeda |
| 2010 | PODC | The inherent complexity of transactional memory and what to do about it. | Hagit Attiya |
| 2010 | PODC | Brief announcement: single-version permissive STM. | Hagit Attiya, Eshcar Hillel |
| 2010 | POPL | Sequential verification of serializability. | Hagit Attiya, G. Ramalingam, Noam Rinetzky |
| 2010 | SPAA | Brief announcement: combine -- an improved directory-based consistency protocol. | Hagit Attiya, Vincent Gramoli, Alessia Milani |
| 2010 | SSS | A Provably Starvation-Free Distributed Directory Protocol. | Hagit Attiya, Vincent Gramoli, Alessia Milani |
| 2009 | OPODIS | Transactional Scheduling for Read-Dominated Workloads. | Hagit Attiya, Alessia Milani |
| 2009 | PODC | Max registers, counters, and monotone circuits. | James Aspnes, Hagit Attiya, Keren Censor |
| 2009 | SPAA | Inherent limitations on disjoint-access parallel implementations of transactional memory. | Hagit Attiya, Eshcar Hillel, Alessia Milani |
| 2008 | ICDCN | Highly-Concurrent Multi-word Synchronization. | Hagit Attiya, Eshcar Hillel |
| 2008 | ICDCS | Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. | Hagit Attiya, Alex Kogan, Jennifer L. Welch |
| 2008 | PODC | Randomized consensus in expected O(n log n) individual work. | James Aspnes, Hagit Attiya, Keren Censor |
| 2008 | PODC | Lower bounds for randomized consensus under a weak adversary. | Hagit Attiya, Keren Censor |
| 2008 | PODC | Tight RMR lower bounds for mutual exclusion and other problems. | Hagit Attiya, Danny Hendler, Philipp Woelfel |
| 2008 | PODC | A world of (Im) possibilities. | Hagit Attiya, Jennifer L. Welch |
| 2008 | STOC | Tight rmr lower bounds for mutual exclusion and other problems. | Hagit Attiya, Danny Hendler, Philipp Woelfel |
| 2008 | SPAA | Partial snapshot objects. | Hagit Attiya, Rachid Guerraoui, Eric Ruppert |
| 2007 | PODC | The complexity of updating multi-writer snapshot objects. | Hagit Attiya, Faith Ellen, Panagiota Fatourou |
| 2007 | PODC | The power of DCAS: highly-concurrent software transactional memory. | Hagit Attiya, Eshcar Hillel |
| 2007 | STOC | Tight bounds for asynchronous randomized consensus. | Hagit Attiya, Keren Censor |
| 2006 | ICDCN | The Complexity of Updating Multi-writer Snapshot Objects. | Hagit Attiya, Faith Ellen, Panagiota Fatourou |
| 2006 | PODC | Transactional contention management as a non-clairvoyant scheduling problem. | Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir |
| 2006 | PODC | Synchronizing without locks is inherently expensive. | Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov |
| 2006 | SPAA | Packet-mode emulation of output-queued switches. | Hagit Attiya, David Hay, Isaac Keslassy |
| 2006 | SIROCCO | Adapting to Point Contention with Long-Lived Safe Agreement . | Hagit Attiya |
| 2005 | OPODIS | Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks. | Hagit Attiya, David Hay, Jennifer L. Welch |
| 2005 | SPAA | Randomization does not reduce the average delay in parallel packet switches. | Hagit Attiya, David Hay |
| 2004 | MASCOTS | The N-Burst/G/1 Model with Heavy-Tailed Service-Times Distribution. | Ronit Nossenson, Hagit Attiya |
| 2004 | PODC | Lower bounds for adaptive collect and related objects. | Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan |
| 2004 | SPAA | The inherent queuing delay of parallel packet switches. | Hagit Attiya, David Hay |
| 2003 | WWW | Understanding the Distribution of File Transmission Duration in the Web. | Ronit Nossenson, Hagit Attiya |
| 2003 | SRDS | Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers. | Hagit Attiya, Amir Bar-Or |
| 2001 | SRDS | Quantifying Rollback Propagation in Distributed Checkpointing. | Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg |
| 2000 | PODC | Adaptive and efficient mutual exclusion (extended abstract). | Hagit Attiya, Vita Bortnikov |
| 1999 | PODC | Long-Lived Renaming Made Adaptive. | Yehuda Afek, Hagit Attiya, Arie Fouren, Gideon Stupp, Dan Touitou |
| 1998 | PODC | A Direct Lower Bound for | Hagit Attiya |
| 1998 | PODC | Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract). | Hagit Attiya, Arie Fouren |
| 1997 | OPODIS | IDABased Protocols for Reliable Multicast. | Hagit Attiya, Hadas Shachnai |
| 1996 | PODC | Universal Operations: Unary versus Binary (Extended Abstract). | Hagit Attiya, Eyal Dagan |
| 1994 | STOC | Time-adaptive algorithms for synchronization. | Rajeev Alur, Hagit Attiya, Gadi Taubenfeld |
| 1994 | SPAA | Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract). | Hagit Attiya, Roy Friedman |
| 1993 | PODC | Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version). | Hagit Attiya, Amir Herzberg, Sergio Rajsbaum |
| 1993 | PODC | Atomic Snapshots in O(n log n) Operations (Preliminary Version). | Hagit Attiya, Ophir Rachman |
| 1993 | SPAA | Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies. | Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch |
| 1992 | SODA | Counting Networks with Arbitrary Fan-Out. | Eran Aharonson, Hagit Attiya |
| 1992 | STOC | A Correctness Condition for High-Performance Multiprocessors (Extended Abstract) | Hagit Attiya, Roy Friedman |
| 1991 | STOC | Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty | Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer |
| 1991 | SPAA | Sequential Consistency Versus Linearizability (Extended Abstract). | Hagit Attiya, Jennifer L. Welch |
| 1990 | FOCS | Are Wait-Free Algorithms Fast? (Extended Abstract) | Hagit Attiya, Nancy A. Lynch, Nir Shavit |
| 1990 | PODC | Atomic Snapshots of Shared Memory. | Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit |
| 1990 | PODC | Sharing Memory Robustly in Message-Passing Systems. | Hagit Attiya, Amotz Bar-Noy, Danny Dolev |
| 1990 | PODC | Using Mappings to Prove Timing Properties. | Nancy A. Lynch, Hagit Attiya |
| 1989 | PODC | Bounded Polynomial Randomized Consensus. | Hagit Attiya, Danny Dolev, Nir Shavit |
| 1989 | RTSS | Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty. | Hagit Attiya, Nancy A. Lynch |
| 1987 | FOCS | Achievable Cases in an Asynchronous Environment (Extended Abstract) | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rdiger Reischuk |