Eli Gafni

Yehuda Afek, Eli Gafni: Asynchrony from Synchrony. ICDCN 2013: 225-239

Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum: Linear Space Bootstrap Communication Schemes. ICDCN 2013: 363-377

Eli Gafni, Petr Kuznetsov, Ciprian Manolescu: A generalized asynchronous computability theorem. CoRR abs/1304.1220 (2013)

Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov: Wait-freedom with advice. PODC 2012: 105-114

Yehuda Afek, Eli Gafni: Asynchrony from Synchrony. CoRR abs/1203.6096 (2012)

Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov: Musical chairs. CoRR abs/1208.0813 (2012)

Eli Gafni, Petr Kuznetsov: On set consensus numbers. Distributed Computing 24(3-4): 149-163 (2011)

Eli Gafni, Rachid Guerraoui, Bastian Pochon: The Complexity of Early Deciding Set Agreement. SIAM J. Comput. 40(1): 63-78 (2011)

Eli Gafni, Rachid Guerraoui: Generalized Universality. CONCUR 2011: 17-27

Eli Gafni, Petr Kuznetsov: Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets. ICDCN 2011: 191-202

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

Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov: Oblivious Collaboration. DISC 2011: 489-504

Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov: Oblivious Collaboration. CoRR abs/1106.2065 (2011)

Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov: Impersonal Failure Detection. CoRR abs/1109.3056 (2011)

Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers: The k-simultaneous consensus problem. Distributed Computing 22(3): 185-195 (2010)

Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport: The mailbox problem. Distributed Computing 23(2): 113-134 (2010)

Eli Gafni, Sergio Rajsbaum: Distributed Programming with Tasks. OPODIS 2010: 205-218

Eli Gafni, Petr Kuznetsov: Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. OPODIS 2010: 380-394

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

Eli Gafni, Sergio Rajsbaum: Recursion in Distributed Computing. SSS 2010: 362-376

Eli Gafni, Petr Kuznetsov: L-Resilient Adversaries and Hitting Sets. CoRR abs/1004.4701 (2010)

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

Eli Gafni, Petr Kuznetsov: The weakest failure detector for solving k-set agreement. PODC 2009: 83-91

Eli Gafni: The extended BG-simulation and the characterization of t-resiliency. STOC 2009: 85-92

Eli Gafni, Petr Kuznetsov: On Set Consensus Numbers. DISC 2009: 35-47

Yehuda Afek, Eli Gafni, Opher Lieber: Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. DISC 2009: 111-126

Michael Okun, Amnon Barak, Eli Gafni: Renaming in synchronous message passing systems with Byzantine failures. Distributed Computing 20(6): 403-413 (2008)

Eli Gafni: The 0-1-Exclusion Families of Tasks. OPODIS 2008: 246-258

Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport: The Mailbox Problem. DISC 2008: 1-15

Yehuda Afek, Eli Gafni, Adam Morrison: Common2 extended to stacks and unbounded concurrency. Distributed Computing 20(4): 239-252 (2007)

Eli Gafni, Petr Kuznetsov: N-Consensus is the Second Strongest Object for N+1 Processes. OPODIS 2007: 260-273

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

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

Eli Gafni: Read-Write Reductions. ICDCN 2006: 349-354

Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers: The Committee Decision Problem. LATIN 2006: 502-514

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

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

Yehuda Afek, Eli Gafni, Adam Morrison: Common2 extended to stacks and unbounded concurrency. PODC 2006: 218-227

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

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

Eli Gafni, Sergio Rajsbaum: Musical Benches. DISC 2005: 63-77

Carlos Brito, Eli Gafni, Shailesh Vaya: An Information Theoretic Lower Bound for Broadcasting in Radio Networks. STACS 2004: 534-546

Eli Gafni: Group-Solvability. DISC 2004: 30-40

Eli Gafni, Leslie Lamport: Disk Paxos. Distributed Computing 16(1): 1-20 (2003)

Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni: On using network attached disks as shared memory. PODC 2003: 315-324

Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni: Uniform Solvability with a Finite Number of MWMR Registers. DISC 2003: 16-29

Hagit Attiya, Arie Fouren, Eli Gafni: An adaptive collect algorithm with applications. Distributed Computing 15(2): 87-96 (2002)

Eli Gafni: A Simple Algorithmic Characterization of Uniform Solvability. FOCS 2002: 228-237

Burkhard Englert, Eli Gafni: Fast Collect in the absence of contention. ICDCS 2002: 537-543

Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum: The BG distributed simulation algorithm. Distributed Computing 14(3): 127-146 (2001)

Eli Gafni, Michael Mitzenmacher: Analysis of Timing-Based Mutual Exclusion with Random Times. SIAM J. Comput. 31(3): 816-837 (2001)

Eli Gafni, Michael Merritt, Gadi Taubenfeld: The concurrency hierarchy, and algorithms for unbounded concurrency. PODC 2001: 161-169

Eli Gafni, Leslie Lamport: Disk Paxos. DISC 2000: 330-344

Eli Gafni, Elias Koutsoupias: Three-Processor Tasks Are Undecidable. SIAM J. Comput. 28(3): 970-983 (1999)

Eli Gafni, Jessica Staddon, Yiqun Lisa Yin: Efficient Methods for Integrating Traceability and Broadcast Encryption. CRYPTO 1999: 372-387

Eli Gafni, Michael Mitzenmacher: Analysis of Timing-Based Mutual Exclusion with Random Times. PODC 1999: 13-21

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

Jiong Yang, Gil Neiger, Eli Gafni: Structured Derivations of Consensus Algorithms for Failure Detectors. PODC 1998: 297-306

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

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

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

Eli Gafni: Simulation as an Iterated Task (Abstract). PODC 1996: 278

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

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

Yehuda Afek, Eli Gafni: Distributed Algorithms for Unidirectional Networks. SIAM J. Comput. 23(6): 1152-1178 (1994)

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

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

Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit: Atomic Snapshots of Shared Memory. J. ACM 40(4): 873-890 (1993)

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

Elizabeth Borowsky, Eli Gafni: Generalized FLP impossibility result for t-resilient asynchronous computations. STOC 1993: 91-100

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

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

Yehuda Afek, Eli Gafni: Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks. SIAM J. Comput. 20(2): 376-394 (1991)

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

Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit: Atomic Snapshots of Shared Memory. PODC 1990: 1-13

Yehuda Afek, Danny Dolev, Eli Gafni: A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem. WDAG 1990: 422-431

Valmir C. Barbosa, Eli Gafni: A Distributed Implementation of Simulated Annealing. J. Parallel Distrib. Comput. 6(2): 411-434 (1989)

Eli Gafni, Joseph Naor, Prabhakar Ragde: On Separating the Erew and Crew Pram Models. Theor. Comput. Sci. 68(3): 343-346 (1989)

Valmir C. Barbosa, Eli Gafni: Concurrency in Heavily Loaded Neighborhood-Constrained Systems. ACM Trans. Program. Lang. Syst. 11(4): 562-584 (1989)

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

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

Ching-Tsun Chou, Eli Gafni: Understanding and Verifying Distributed Algorithms Using Stratified Decomposition. PODC 1988: 44-65

Eli Gafni, Yehuda Afek: End-to-End Communication in Unreliable Networks. PODC 1988: 131-148

Danny Dolev, Eli Gafni, Nir Shavit: Toward a Non-Atomic Era: \ell-Exclusion as a Test Case. STOC 1988: 78-92

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

Eli Gafni, Dimitri P. Bertsekas: Asymptotic optimality of shortest path routing algorithms. IEEE Transactions on Information Theory 33(1): 83-90 (1987)

Yehuda Afek, Baruch Awerbuch, Eli Gafni: Applying Static Network Protocols to Dynamic Networks. FOCS 1987: 358-370

Valmir C. Barbosa, Eli Gafni: Concurrency in Heavily Loaded Neighborhood-Constrained Systems. ICDCS 1987: 448-457

Yuval Tamir, Eli Gafni: A Software-Based Hardware Fault Tolerance Scheme for Multicomputers. ICPP 1987: 117-120

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

Eli Gafni: Generalized Scheme for Topology-Update in Dynamic Networks. WDAG 1987: 187-196

Yehuda Afek, Baruch Awerbuch, Eli Gafni: Local Fail-safe Network Reset Procedure. WDAG 1987: 197-211

John M. Marberg, Eli Gafni: Sorting and Selection in Multi-Channel Broadcast Networks. ICPP 1985: 846-850

Eli Gafni: Improvements in the Time Complexity of Two Message-Optimal Election Algorithms. PODC 1985: 175-185

Yehuda Afek, Eli Gafni: Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks. PODC 1985: 186-195

Eli Gafni, Yehuda Afek: Election and Traversal in Unidirectional Networks. PODC 1984: 190-198