Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology. - Eli Gafni; Dimitri P. Bertsekas (IEEE Trans. Commun., 1981)

The integration of routing and flow-control for voice and data in a computer communication network. - Eliezer M. Gafni (1982)

Path assignment for virtual circuit routing. - Eliezer M. Gafni; Dimitri P. Bertsekas (SIGCOMM, 1983)

Election and Traversal in Unidirectional Networks. - Eli Gafni; Yehuda Afek (PODC, 1984)

Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks. - Dimitri P. Bertsekas; Eli Gafni; Robert G. Gallager (IEEE Trans. Commun., 1984)

Sorting and Selection in Multi-Channel Broadcast Networks. - John M. Marberg; Eli Gafni (ICPP, 1985)

Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks. - Yehuda Afek; Eli Gafni (PODC, 1985)

Improvements in the Time Complexity of Two Message-Optimal Election Algorithms. - Eli Gafni (PODC, 1985)

Applying Static Network Protocols to Dynamic Networks - Yehuda Afek; Baruch Awerbuch; Eli Gafni (FOCS, 1987)

Concurrency in Heavily Loaded Neighborhood-Constrained Systems. - Valmir Carneiro Barbosa; Eli Gafni (ICDCS, 1987)

An O(n^2 m^1/2) Distributed Max-Flow Algorithm. - John M. Marberg; Eli Gafni (ICPP, 1987)

A Software-Based Hardware Fault Tolerance Scheme for Multicomputers. - Yuval Tamir; Eli Gafni (ICPP, 1987)

Local Fail-safe Network Reset Procedure. - Yehuda Afek; Baruch Awerbuch; Eli Gafni (WDAG, 1987)

Generalized Scheme for Topology-Update in Dynamic Networks. - Eli Gafni (WDAG, 1987)

Distributed Sorting Algorithms for Multi-Channel Broadcast Networks. - John M. Marberg; Eli Gafni (Theor. Comput. Sci., 1987)

Asymptotic optimality of shortest path routing algorithms. - Eli Gafni; Dimitri P. Bertsekas (IEEE Trans. Inf. Theory, 1987)

Understanding and Verifying Distributed Algorithms Using Stratified Decomposition. - Ching-Tsun Chou; Eli Gafni (PODC, 1988)

End-to-End Communication in Unreliable Networks. - Eli Gafni; Yehuda Afek (PODC, 1988)

Toward a Non-Atomic Era: ell-Exclusion as a Test Case - Danny Dolev; Eli Gafni; Nir Shavit (STOC, 1988)

Sorting in Constant Number of Row and Column Phases on a Mesh. - John M. Marberg; Eli Gafni (Algorithmica, 1988)

Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract) - Yehuda Afek; Eli Gafni; Moty Ricklin (FOCS, 1989)

A Distributed Implementation of Simulated Annealing. - Valmir Carneiro Barbosa; Eli Gafni (J. Parallel Distributed Comput., 1989)

On Separating the Erew and Crew Pram Models. - Eli Gafni; Joseph Naor; Prabhakar Ragde (Theor. Comput. Sci., 1989)

Atomic Snapshots of Shared Memory. - Yehuda Afek; Danny Dolev; Hagit Attiya; Eli Gafni; Michael Merritt; Nir Shavit (PODC, 1990)

A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem. - Yehuda Afek; Danny Dolev; Eli Gafni (WDAG, 1990)

Bootstrap Network Resynchronization (Extended Abstract). - Yehuda Afek; Eli Gafni (PODC, 1991)

The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). - Yehuda Afek; Eli Gafni; Adi Rosén (PODC, 1992)

Wait-free Test-and-Set (Extended Abstract). - Yehuda Afek; Eli Gafni; John Tromp; Paul M. B. Vitányi (WDAG, 1992)

Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). - Elizabeth Borowsky; Eli Gafni (PODC, 1993)

Generalized FLP impossibility result for t-resilient asynchronous computations. - Elizabeth Borowsky; Eli Gafni (STOC, 1993)

Consensus Power Makes (Some) Sense! (Extended Abstract). - Elizabeth Borowsky; Eli Gafni; Yehuda Afek (PODC, 1994)

Distributed Algorithms for Unidirectional Networks. - Yehuda Afek; Eli Gafni (SIAM J. Comput., 1994)

A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem. - Yehuda Afek; Danny Dolev; Eli Gafni; Michael Merritt; Nir Shavit (ACM Trans. Program. Lang. Syst., 1994)

3-Processor Tasks Are Undecidable (Abstract). - Eli Gafni; Elias Koutsoupias (PODC, 1995)

The Supercomputer Supernet: A Scalable Distributed Terabit Network. - Leonard Kleinrock; Mario Gerla; Nicholas Bambos; Jason Cong; Eli Gafni; Larry Bergman; Joseph A. Bannister (J. High Speed Networks, 1995)

A Proof of a Theorem in Algebraic Topology by a Distributed Algorithm (Abstract). - Eli Gafni (PODC, 1996)

Simulation as an Iterated Task (Abstract). - Eli Gafni (PODC, 1996)

A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). - Elizabeth Borowsky; Eli Gafni (PODC, 1997)

Slide-The Key to Polynomial End-to-End Communication. - Yehuda Afek; Baruch Awerbuch; Eli Gafni; Yishay Mansour; Adi Rosén; Nir Shavit (J. Algorithms, 1997)

Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). - Eli Gafni (PODC, 1998)

Structured Derivations of Consensus Algorithms for Failure Detectors. - Jiong Yang; Gil Neiger; Eli Gafni (PODC, 1998)

Distributed Computing. - Eli Gafni (Algorithms and Theory of Computation Handbook, 1999)

Efficient Methods for Integrating Traceability and Broadcast Encryption. - Eli Gafni; Jessica Staddon; Yiqun Lisa Yin (CRYPTO, 1999)

Analysis of Timing-Based Mutual Exclusion with Random Times. - Eli Gafni; Michael Mitzenmacher (PODC, 1999)

Three-Processor Tasks Are Undecidable. - Eli Gafni; Elias Koutsoupias (SIAM J. Comput., 1999)

Disk Paxos. - Eli Gafni; Leslie Lamport (DISC, 2000)

The concurrency hierarchy, and algorithms for unbounded concurrency. - Eli Gafni; Michael Merritt; Gadi Taubenfeld (PODC, 2001)

The BG distributed simulation algorithm. - Elizabeth Borowsky; Eli Gafni; Nancy A. Lynch; Sergio Rajsbaum (Distributed Comput., 2001)

A Simple Algorithmic Characterization of Uniform Solvability. - Eli Gafni (FOCS, 2002)

Fast Collect in the absence of contention. - Burkhard Englert; Eli Gafni (ICDCS, 2002)

An adaptive collect algorithm with applications. - Hagit Attiya; Arie Fouren; Eli Gafni (Distributed Comput., 2002)

On using network attached disks as shared memory. - Marcos Kawazoe Aguilera; Burkhard Englert; Eli Gafni (PODC, 2003)

Uniform Solvability with a Finite Number of MWMR Registers. - Marcos Kawazoe Aguilera; Burkhard Englert; Eli Gafni (DISC, 2003)

An Information Theoretic Lower Bound for Broadcasting in Radio Networks. - Carlos Brito 001; Eli Gafni; Shailesh Vaya (STACS, 2004)

Group-Solvability. - Eli Gafni (DISC, 2004)

From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement. - Eli Gafni; Rachid Guerraoui; Bastian Pochon (STOC, 2005)

Musical Benches. - Eli Gafni; Sergio Rajsbaum (DISC, 2005)

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. - Yehuda Afek; Eli Gafni; Sergio Rajsbaum; Michel Raynal; Corentin Travers (ICDCN, 2006)

Read-Write Reductions. - Eli Gafni (ICDCN, 2006)

The Committee Decision Problem. - Eli Gafni; Sergio Rajsbaum; Michel Raynal; Corentin Travers (LATIN, 2006)

How Deep Should It Be? On the Optimality of Hierarchical Architectures. - Amihai Motro; Alessandro D'Atri; Eli Gafni (NGITS, 2006)

Renaming with k-Set-Consensus: An Optimal Algorithm into n + k - 1 Slots. - Eli Gafni (OPODIS, 2006)

Common2 extended to stacks and unbounded concurrency. - Yehuda Afek; Eli Gafni; Adam Morrison 001 (PODC, 2006)

Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. - Eli Gafni; Sergio Rajsbaum; Maurice Herlihy (DISC, 2006)

N-Consensus is the Second Strongest Object for N+1 Processes. - Eli Gafni; Petr Kuznetsov (OPODIS, 2007)

Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. - Eli Gafni; Michel Raynal; Corentin Travers (SRDS, 2007)

The 0-1-Exclusion Families of Tasks. - Eli Gafni (OPODIS, 2008)

The Mailbox Problem. - Marcos Kawazoe Aguilera; Eli Gafni; Leslie Lamport (DISC, 2008)

Renaming in synchronous message passing systems with Byzantine failures. - Michael Okun; Amnon Barak; Eli Gafni (Distributed Comput., 2008)

The weakest failure detector for solving k-set agreement. - Eli Gafni; Petr Kuznetsov (PODC, 2009)

The extended BG-simulation and the characterization of t-resiliency. - Eli Gafni (STOC, 2009)

Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. - Yehuda Afek; Eli Gafni; Opher Lieber (DISC, 2009)

On Set Consensus Numbers. - Eli Gafni; Petr Kuznetsov (DISC, 2009)

From adaptive renaming to set agreement. - Eli Gafni; Achour Mostéfaoui; Michel Raynal; Corentin Travers (Theor. Comput. Sci., 2009)

Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. - Eli Gafni; Petr Kuznetsov (OPODIS, 2010)

Distributed Programming with Tasks. - Eli Gafni; Sergio Rajsbaum (OPODIS, 2010)

Brief announcement: on L-resilience, hitting sets, and colorless tasks. - Eli Gafni; Petr Kuznetsov (PODC, 2010)

Recursion in Distributed Computing. - Eli Gafni; Sergio Rajsbaum (SSS, 2010)

L-Resilient Adversaries and Hitting Sets - Eli Gafni; Petr Kuznetsov (CoRR, 2010)

The k-simultaneous consensus problem. - Yehuda Afek; Eli Gafni; Sergio Rajsbaum; Michel Raynal; Corentin Travers (Distributed Comput., 2010)

Generalized Universality. - Eli Gafni; Rachid Guerraoui (CONCUR, 2011)

Relating L mathcal{L}-Resilience and Wait-Freedom via Hitting Sets. - Eli Gafni; Petr Kuznetsov (ICDCN, 2011)

Oblivious Collaboration. - Yehuda Afek; Yakov Babichenko; Uriel Feige; Eli Gafni; Nati Linial; Benny Sudakov (DISC, 2011)

Brief Announcement: On the Meaning of Solving a Task with a Failure Detector. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov (DISC, 2011)

Impersonal Failure Detection - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov (CoRR, 2011)

The Complexity of Early Deciding Set Agreement. - Eli Gafni; Rachid Guerraoui; Bastian Pochon (SIAM J. Comput., 2011)

Wait-freedom with advice. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov (PODC, 2012)

Asynchrony from Synchrony. - Yehuda Afek; Eli Gafni (ICDCN, 2013)

Linear Space Bootstrap Communication Schemes. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Sergio Rajsbaum (ICDCN, 2013)

Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Sergio Rajsbaum (NETYS, 2013)

Adaptive Register Allocation with a Linear Number of Registers. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Leslie Lamport (DISC, 2013)

Sporadic Solutions to Zero-One Exclusion Tasks. - Eli Gafni; Maurice Herlihy (ICALP (1), 2014)

Strong Equivalence Relations for Iterated Models. - Zohir Bouzid; Eli Gafni; Petr Kuznetsov (OPODIS, 2014)

A generalized asynchronous computability theorem. - Eli Gafni; Petr Kuznetsov; Ciprian Manolescu (PODC, 2014)

Automatically Adjusting Concurrency to the Level of Synchrony. - Pierre Fraigniaud; Eli Gafni; Sergio Rajsbaum; Matthieu Roy (DISC, 2014)

Live Equals Fast in Iterated Models. - Zohir Bouzid; Eli Gafni; Petr Kuznetsov (CoRR, 2014)

Set Consensus: Captured by a Set of Runs with Ramifications. - Eli Gafni (CoRR, 2014)

Snapshot for Time: The One-Shot Case. - Eli Gafni (CoRR, 2014)

Musical Chairs. - Yehuda Afek; Yakov Babichenko; Uriel Feige; Eli Gafni; Nati Linial; Benny Sudakov (SIAM J. Discret. Math., 2014)

Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution. - Eli Gafni; Dahlia Malkhi (DISC, 2015)

A simple characterization of asynchronous computations. - Yehuda Afek; Eli Gafni (Theor. Comput. Sci., 2015)

Group mutual exclusion in linear time and space. - Yuan He 003; Krishnan Gopalakrishnan; Eli Gafni (ICDCN, 2016)

Set-Consensus Collections are Decidable. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov (OPODIS, 2016)

Read-Write Memory and k-Set Consensus as an Affine Task. - Eli Gafni; Yuan He 003; Petr Kuznetsov; Thibault Rieutord (OPODIS, 2016)

Deterministic Objects: Life Beyond Consensus. - Yehuda Afek; Faith Ellen; Eli Gafni (PODC, 2016)

Brief Announcement: Asynchronous Coordination with Constraints and Preferences. - Armando Castañeda; Pierre Fraigniaud; Eli Gafni; Sergio Rajsbaum; Matthieu Roy (PODC, 2016)

Asynchronous Coordination Under Preferences and Constraints. - Armando Castañeda; Pierre Fraigniaud; Eli Gafni; Sergio Rajsbaum; Matthieu Roy (SIROCCO, 2016)

Asynchronous Computability Theorems for t-Resilient Systems. - Vikram Saraph; Maurice Herlihy; Eli Gafni (DISC, 2016)

Synchronous Hybrid Message-Adversary. - Danny Dolev; Eli Gafni (CoRR, 2016)

Some Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs. - Danny Dolev; Eli Gafni (CoRR, 2016)

Byzantine Processors and Cuckoo Birds: Confining Maliciousness to the Outset. - Danny Dolev; Eli Gafni (CoRR, 2016)

The Life in 1-Consensus. - Yehuda Afek; Eli Daian; Eli Gafni (CoRR, 2017)

The Assignment Problem. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Giuliano Losa (ICDCN, 2018)

A Wealth of Sub-Consensus Deterministic Objects. - Eli Daian; Giuliano Losa; Yehuda Afek; Eli Gafni (DISC, 2018)

An algorithmic approach to the asynchronous computability theorem. - Vikram Saraph; Maurice Herlihy; Eli Gafni (J. Appl. Comput. Topol., 2018)

Fast and secure global payments with Stellar. - Marta Lokhava; Giuliano Losa; David Mazières; Graydon Hoare; Nicolas Barry; Eli Gafni; Jonathan Jove; Rafal Malinowsky; Jed McCaleb (SOSP, 2019)

Stellar Consensus by Instantiation. - Giuliano Losa; Eli Gafni; David Mazières (DISC, 2019)

A King in every two consecutive tournaments. - Yehuda Afek; Eli Gafni; Nati Linial (CoRR, 2019)

Invited Paper: Time Is Not a Healer, but It Sure Makes Hindsight 20:20. - Eli Gafni; Giuliano Losa (SSS, 2023)

Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority. - Eli Gafni; Giuliano Losa (DISC, 2023)

Consensus in the Unknown-Participation Message-Adversary Model. - Giuliano Losa; Eli Gafni (CoRR, 2023)

Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in Theory. - Eli Gafni; Vasileios Zikas (CoRR, 2023)

Time is not a Healer, but it Sure Makes Hindsight 20: 20. - Eli Gafni; Giuliano Losa (CoRR, 2023)

Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. - Giuliano Losa; Eli Gafni (PODC, 2024)

Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. - Giuliano Losa; Eli Gafni (CoRR, 2024)

Keynote: Examples of Mantras as a Beacon in Guiding Research. - Eli Gafni (PODC, 2025)

Brief Announcement: Stranger-Free Tasks. - Eli Gafni; Giuliano Losa; Michel Raynal; Gadi Taubenfeld (PODC, 2025)