| 2025 | OPODIS | How Exhaustive Does an Extension-Based Proof Need to Be? | Faith Ellen, Shihao Liu, Leqi Zhu, Eli Gafni, Rati Gelashvili |
| 2025 | OPODIS | Solving Tasks with Fewer Registers Than Processes. | Eli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld |
| 2025 | PODC | Keynote: Examples of Mantras as a Beacon in Guiding Research. | Eli Gafni |
| 2025 | PODC | Brief Announcement: Stranger-Free Tasks. | Eli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld |
| 2024 | PODC | Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. | Giuliano Losa, Eli Gafni |
| 2023 | SSS | Invited Paper: Time Is Not a Healer, but It Sure Makes Hindsight 20:20. | Eli Gafni, Giuliano Losa |
| 2019 | SOSP | Fast and secure global payments with Stellar. | Marta Lokhava, Giuliano Losa, David Mazires, Graydon Hoare, Nicolas Barry, Eli Gafni, Jonathan Jove, Rafal Malinowsky, Jed McCaleb |
| 2018 | ICDCN | The Assignment Problem. | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa |
| 2016 | ICDCN | Group mutual exclusion in linear time and space. | Yuan He, Krishnan Gopalakrishnan, Eli Gafni |
| 2016 | OPODIS | Set-Consensus Collections are Decidable. | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov |
| 2016 | OPODIS | Read-Write Memory and k-Set Consensus as an Affine Task. | Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord |
| 2016 | PODC | Deterministic Objects: Life Beyond Consensus. | Yehuda Afek, Faith Ellen, Eli Gafni |
| 2016 | PODC | Brief Announcement: Asynchronous Coordination with Constraints and Preferences. | Armando Castaeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy |
| 2016 | SIROCCO | Asynchronous Coordination Under Preferences and Constraints. | Armando Castaeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy |
| 2014 | ICALP | Sporadic Solutions to Zero-One Exclusion Tasks. | Eli Gafni, Maurice Herlihy |
| 2014 | OPODIS | Strong Equivalence Relations for Iterated Models. | Zohir Bouzid, Eli Gafni, Petr Kuznetsov |
| 2014 | PODC | A generalized asynchronous computability theorem. | Eli Gafni, Petr Kuznetsov, Ciprian Manolescu |
| 2013 | ICDCN | Asynchrony from Synchrony. | Yehuda Afek, Eli Gafni |
| 2013 | ICDCN | Linear Space Bootstrap Communication Schemes. | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum |
| 2012 | PODC | Wait-freedom with advice. | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov |
| 2011 | CONCUR | Generalized Universality. | Eli Gafni, Rachid Guerraoui |
| 2011 | ICDCN | Relating | Eli Gafni, Petr Kuznetsov |
| 2010 | OPODIS | Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. | Eli Gafni, Petr Kuznetsov |
| 2010 | OPODIS | Distributed Programming with Tasks. | Eli Gafni, Sergio Rajsbaum |
| 2010 | PODC | Brief announcement: on L-resilience, hitting sets, and colorless tasks. | Eli Gafni, Petr Kuznetsov |
| 2010 | SSS | Recursion in Distributed Computing. | Eli Gafni, Sergio Rajsbaum |
| 2009 | PODC | The weakest failure detector for solving k-set agreement. | Eli Gafni, Petr Kuznetsov |
| 2009 | STOC | The extended BG-simulation and the characterization of t-resiliency. | Eli Gafni |
| 2008 | OPODIS | The 0-1-Exclusion Families of Tasks. | Eli Gafni |
| 2007 | OPODIS | N-Consensus is the Second Strongest Object for N+1 Processes. | Eli Gafni, Petr Kuznetsov |
| 2007 | SRDS | Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. | Eli Gafni, Michel Raynal, Corentin Travers |
| 2006 | ICDCN | Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. | Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers |
| 2006 | ICDCN | Read-Write Reductions. | Eli Gafni |
| 2006 | LATIN | The Committee Decision Problem. | Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers |
| 2006 | OPODIS | Renaming with | Eli Gafni |
| 2006 | PODC | Common2 extended to stacks and unbounded concurrency. | Yehuda Afek, Eli Gafni, Adam Morrison |
| 2005 | STOC | From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement. | Eli Gafni, Rachid Guerraoui, Bastian Pochon |
| 2004 | STACS | An Information Theoretic Lower Bound for Broadcasting in Radio Networks. | Carlos Brito, Eli Gafni, Shailesh Vaya |
| 2003 | PODC | On using network attached disks as shared memory. | Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni |
| 2002 | FOCS | A Simple Algorithmic Characterization of Uniform Solvability. | Eli Gafni |
| 2002 | ICDCS | Fast Collect in the absence of contention. | Burkhard Englert, Eli Gafni |
| 2001 | PODC | The concurrency hierarchy, and algorithms for unbounded concurrency. | Eli Gafni, Michael Merritt, Gadi Taubenfeld |
| 1999 | CRYPTO | Efficient Methods for Integrating Traceability and Broadcast Encryption. | Eli Gafni, Jessica Staddon, Yiqun Lisa Yin |
| 1999 | PODC | Analysis of Timing-Based Mutual Exclusion with Random Times. | Eli Gafni, Michael Mitzenmacher |
| 1998 | PODC | Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). | Eli Gafni |
| 1998 | PODC | Structured Derivations of Consensus Algorithms for Failure Detectors. | Jiong Yang, Gil Neiger, Eli Gafni |
| 1997 | PODC | A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). | Elizabeth Borowsky, Eli Gafni |
| 1996 | PODC | A Proof of a Theorem in Algebraic Topology by a Distributed Algorithm (Abstract). | Eli Gafni |
| 1996 | PODC | Simulation as an Iterated Task (Abstract). | Eli Gafni |
| 1995 | PODC | 3-Processor Tasks Are Undecidable (Abstract). | Eli Gafni, Elias Koutsoupias |
| 1994 | PODC | Consensus Power Makes (Some) Sense! (Extended Abstract). | Elizabeth Borowsky, Eli Gafni, Yehuda Afek |
| 1993 | PODC | Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). | Elizabeth Borowsky, Eli Gafni |
| 1993 | STOC | Generalized FLP impossibility result for t-resilient asynchronous computations. | Elizabeth Borowsky, Eli Gafni |
| 1992 | PODC | The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). | Yehuda Afek, Eli Gafni, Adi Rosn |
| 1991 | PODC | Bootstrap Network Resynchronization (Extended Abstract). | Yehuda Afek, Eli Gafni |
| 1990 | PODC | Atomic Snapshots of Shared Memory. | Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit |
| 1989 | FOCS | Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract) | Yehuda Afek, Eli Gafni, Moty Ricklin |
| 1988 | PODC | Understanding and Verifying Distributed Algorithms Using Stratified Decomposition. | Ching-Tsun Chou, Eli Gafni |
| 1988 | PODC | End-to-End Communication in Unreliable Networks. | Eli Gafni, Yehuda Afek |
| 1988 | STOC | Toward a Non-Atomic Era: \ell-Exclusion as a Test Case | Danny Dolev, Eli Gafni, Nir Shavit |
| 1987 | FOCS | Applying Static Network Protocols to Dynamic Networks | Yehuda Afek, Baruch Awerbuch, Eli Gafni |
| 1987 | ICDCS | Concurrency in Heavily Loaded Neighborhood-Constrained Systems. | Valmir Carneiro Barbosa, Eli Gafni |
| 1987 | ICPP | An O(n^2 m^1/2) Distributed Max-Flow Algorithm. | John M. Marberg, Eli Gafni |
| 1987 | ICPP | A Software-Based Hardware Fault Tolerance Scheme for Multicomputers. | Yuval Tamir, Eli Gafni |
| 1985 | ICPP | Sorting and Selection in Multi-Channel Broadcast Networks. | John M. Marberg, Eli Gafni |
| 1985 | PODC | Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks. | Yehuda Afek, Eli Gafni |
| 1985 | PODC | Improvements in the Time Complexity of Two Message-Optimal Election Algorithms. | Eli Gafni |
| 1984 | PODC | Election and Traversal in Unidirectional Networks. | Eli Gafni, Yehuda Afek |