Stop the war!
Остановите войну!
for scientists:
default search action
Eli Gafni
Eliezer M. Gafni
Person information
- affiliation: University of California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c88]Giuliano Losa, Eli Gafni:
Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. PODC 2024: 465-468 - [i21]Giuliano Losa, Eli Gafni:
Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. CoRR abs/2405.03573 (2024) - 2023
- [c87]Eli Gafni, Giuliano Losa:
Invited Paper: Time Is Not a Healer, but It Sure Makes Hindsight 20:20. SSS 2023: 62-74 - [c86]Eli Gafni, Giuliano Losa:
Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority. DISC 2023: 41:1-41:7 - [i20]Giuliano Losa, Eli Gafni:
Consensus in the Unknown-Participation Message-Adversary Model. CoRR abs/2301.04817 (2023) - [i19]Eli Gafni, Vasileios Zikas:
Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in Theory. CoRR abs/2302.05520 (2023) - [i18]Eli Gafni, Giuliano Losa:
Time is not a Healer, but it Sure Makes Hindsight 20: 20. CoRR abs/2305.02295 (2023) - 2021
- [j33]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa:
The assignment problem. Theor. Comput. Sci. 886: 13-26 (2021)
2010 – 2019
- 2019
- [c85]Marta Lokhava, Giuliano Losa, David Mazières, Graydon Hoare, Nicolas Barry, Eli Gafni, Jonathan Jove, Rafal Malinowsky, Jed McCaleb:
Fast and secure global payments with Stellar. SOSP 2019: 80-96 - [c84]Giuliano Losa, Eli Gafni, David Mazières:
Stellar Consensus by Instantiation. DISC 2019: 27:1-27:15 - [i17]Yehuda Afek, Eli Gafni, Nati Linial:
A King in every two consecutive tournaments. CoRR abs/1910.09684 (2019) - 2018
- [j32]Vikram Saraph, Maurice Herlihy, Eli Gafni:
An algorithmic approach to the asynchronous computability theorem. J. Appl. Comput. Topol. 1(3-4): 451-474 (2018) - [j31]Yuan He, Krishnan Gopalakrishnan, Eli Gafni:
Group mutual exclusion in linear time and space. Theor. Comput. Sci. 709: 31-47 (2018) - [c83]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa:
The Assignment Problem. ICDCN 2018: 14:1-14:9 - [c82]Eli Daian, Giuliano Losa, Yehuda Afek, Eli Gafni:
A Wealth of Sub-Consensus Deterministic Objects. DISC 2018: 17:1-17:17 - 2017
- [i16]Vikram Saraph, Maurice Herlihy, Eli Gafni:
An Algorithmic Approach to the Asynchronous Computability Theorem. CoRR abs/1703.08525 (2017) - [i15]Yehuda Afek, Eli Daian, Eli Gafni:
The Life in 1-Consensus. CoRR abs/1709.06808 (2017) - 2016
- [c81]Yuan He, Krishnan Gopalakrishnan, Eli Gafni:
Group mutual exclusion in linear time and space. ICDCN 2016: 22:1-22:10 - [c80]Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. OPODIS 2016: 6:1-6:17 - [c79]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Set-Consensus Collections are Decidable. OPODIS 2016: 7:1-7:15 - [c78]Yehuda Afek, Faith Ellen, Eli Gafni:
Deterministic Objects: Life Beyond Consensus. PODC 2016: 97-106 - [c77]Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Brief Announcement: Asynchronous Coordination with Constraints and Preferences. PODC 2016: 299-301 - [c76]Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Asynchronous Coordination Under Preferences and Constraints. SIROCCO 2016: 111-126 - [c75]Vikram Saraph, Maurice Herlihy, Eli Gafni:
Asynchronous Computability Theorems for t-Resilient Systems. DISC 2016: 428-441 - [i14]Danny Dolev, Eli Gafni:
Synchronous Hybrid Message-Adversary. CoRR abs/1605.02279 (2016) - [i13]Danny Dolev, Eli Gafni:
Some Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs. CoRR abs/1607.01210 (2016) - [i12]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Set-Consensus Collections are Decidable. CoRR abs/1607.05635 (2016) - [i11]Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. CoRR abs/1610.01423 (2016) - [i10]Danny Dolev, Eli Gafni:
Byzantine Processors and Cuckoo Birds: Confining Maliciousness to the Outset. CoRR abs/1611.04276 (2016) - 2015
- [j30]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Wait-freedom with advice. Distributed Comput. 28(1): 3-19 (2015) - [j29]Yehuda Afek, Eli Gafni:
A simple characterization of asynchronous computations. Theor. Comput. Sci. 561: 88-95 (2015) - [j28]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum:
Linear space bootstrap communication schemes. Theor. Comput. Sci. 561: 122-133 (2015) - [c74]Eli Gafni, Dahlia Malkhi:
Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution. DISC 2015: 140-153 - 2014
- [j27]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Musical Chairs. SIAM J. Discret. Math. 28(3): 1578-1600 (2014) - [c73]Eli Gafni, Maurice Herlihy:
Sporadic Solutions to Zero-One Exclusion Tasks. ICALP (1) 2014: 1-10 - [c72]Zohir Bouzid, Eli Gafni, Petr Kuznetsov:
Strong Equivalence Relations for Iterated Models. OPODIS 2014: 139-154 - [c71]Eli Gafni, Petr Kuznetsov, Ciprian Manolescu:
A generalized asynchronous computability theorem. PODC 2014: 222-231 - [c70]Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Automatically Adjusting Concurrency to the Level of Synchrony. DISC 2014: 1-15 - [i9]Zohir Bouzid, Eli Gafni, Petr Kuznetsov:
Live Equals Fast in Iterated Models. CoRR abs/1402.2446 (2014) - [i8]Eli Gafni:
Set Consensus: Captured by a Set of Runs with Ramifications. CoRR abs/1405.5145 (2014) - [i7]Eli Gafni:
Snapshot for Time: The One-Shot Case. CoRR abs/1408.3432 (2014) - 2013
- [c69]Yehuda Afek, Eli Gafni:
Asynchrony from Synchrony. ICDCN 2013: 225-239 - [c68]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum:
Linear Space Bootstrap Communication Schemes. ICDCN 2013: 363-377 - [c67]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum:
Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|. NETYS 2013: 28-41 - [c66]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Leslie Lamport:
Adaptive Register Allocation with a Linear Number of Registers. DISC 2013: 269-283 - [i6]Eli Gafni, Petr Kuznetsov, Ciprian Manolescu:
A generalized asynchronous computability theorem. CoRR abs/1304.1220 (2013) - 2012
- [c65]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Wait-freedom with advice. PODC 2012: 105-114 - [i5]Yehuda Afek, Eli Gafni:
Asynchrony from Synchrony. CoRR abs/1203.6096 (2012) - [i4]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Musical chairs. CoRR abs/1208.0813 (2012) - 2011
- [j26]Eli Gafni, Petr Kuznetsov:
On set consensus numbers. Distributed Comput. 24(3-4): 149-163 (2011) - [j25]Eli Gafni, Rachid Guerraoui, Bastian Pochon:
The Complexity of Early Deciding Set Agreement. SIAM J. Comput. 40(1): 63-78 (2011) - [c64]Eli Gafni, Rachid Guerraoui:
Generalized Universality. CONCUR 2011: 17-27 - [c63]Eli Gafni, Petr Kuznetsov:
Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets. ICDCN 2011: 191-202 - [c62]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 - [c61]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Oblivious Collaboration. DISC 2011: 489-504 - [i3]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Oblivious Collaboration. CoRR abs/1106.2065 (2011) - [i2]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Impersonal Failure Detection. CoRR abs/1109.3056 (2011) - 2010
- [j24]Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
The k-simultaneous consensus problem. Distributed Comput. 22(3): 185-195 (2010) - [j23]Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport:
The mailbox problem. Distributed Comput. 23(2): 113-134 (2010) - [c60]Eli Gafni, Sergio Rajsbaum:
Distributed Programming with Tasks. OPODIS 2010: 205-218 - [c59]Eli Gafni, Petr Kuznetsov:
Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. OPODIS 2010: 380-394 - [c58]Eli Gafni, Petr Kuznetsov:
Brief announcement: on L-resilience, hitting sets, and colorless tasks. PODC 2010: 81-82 - [c57]Eli Gafni, Sergio Rajsbaum:
Recursion in Distributed Computing. SSS 2010: 362-376 - [i1]Eli Gafni, Petr Kuznetsov:
L-Resilient Adversaries and Hitting Sets. CoRR abs/1004.4701 (2010)
2000 – 2009
- 2009
- [j22]Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers:
From adaptive renaming to set agreement. Theor. Comput. Sci. 410(14): 1328-1335 (2009) - [c56]Eli Gafni, Petr Kuznetsov:
The weakest failure detector for solving k-set agreement. PODC 2009: 83-91 - [c55]Eli Gafni:
The extended BG-simulation and the characterization of t-resiliency. STOC 2009: 85-92 - [c54]Eli Gafni, Petr Kuznetsov:
On Set Consensus Numbers. DISC 2009: 35-47 - [c53]Yehuda Afek, Eli Gafni, Opher Lieber:
Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. DISC 2009: 111-126 - 2008
- [j21]Michael Okun, Amnon Barak, Eli Gafni:
Renaming in synchronous message passing systems with Byzantine failures. Distributed Comput. 20(6): 403-413 (2008) - [c52]Eli Gafni:
The 0-1-Exclusion Families of Tasks. OPODIS 2008: 246-258 - [c51]Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport:
The Mailbox Problem. DISC 2008: 1-15 - 2007
- [j20]Yehuda Afek, Eli Gafni, Adam Morrison:
Common2 extended to stacks and unbounded concurrency. Distributed Comput. 20(4): 239-252 (2007) - [c50]Eli Gafni, Petr Kuznetsov:
N-Consensus is the Second Strongest Object for N+1 Processes. OPODIS 2007: 260-273 - [c49]Eli Gafni, Michel Raynal, Corentin Travers:
Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. SRDS 2007: 93-102 - 2006
- [c48]Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. ICDCN 2006: 331-341 - [c47]Eli Gafni:
Read-Write Reductions. ICDCN 2006: 349-354 - [c46]Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
The Committee Decision Problem. LATIN 2006: 502-514 - [c45]Amihai Motro, Alessandro D'Atri, Eli Gafni:
How Deep Should It Be? On the Optimality of Hierarchical Architectures. NGITS 2006: 260-273 - [c44]Eli Gafni:
Renaming with k-Set-Consensus: An Optimal Algorithm into n + k - 1 Slots. OPODIS 2006: 36-44 - [c43]Yehuda Afek, Eli Gafni, Adam Morrison:
Common2 extended to stacks and unbounded concurrency. PODC 2006: 218-227 - [c42]Eli Gafni, Sergio Rajsbaum, Maurice Herlihy:
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. DISC 2006: 329-338 - 2005
- [c41]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 - [c40]Eli Gafni, Sergio Rajsbaum:
Musical Benches. DISC 2005: 63-77 - 2004
- [c39]Carlos Brito, Eli Gafni, Shailesh Vaya:
An Information Theoretic Lower Bound for Broadcasting in Radio Networks. STACS 2004: 534-546 - [c38]Eli Gafni:
Group-Solvability. DISC 2004: 30-40 - 2003
- [j19]Eli Gafni, Leslie Lamport:
Disk Paxos. Distributed Comput. 16(1): 1-20 (2003) - [c37]Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni:
On using network attached disks as shared memory. PODC 2003: 315-324 - [c36]Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni:
Uniform Solvability with a Finite Number of MWMR Registers. DISC 2003: 16-29 - 2002
- [j18]Hagit Attiya, Arie Fouren, Eli Gafni:
An adaptive collect algorithm with applications. Distributed Comput. 15(2): 87-96 (2002) - [c35]Eli Gafni:
A Simple Algorithmic Characterization of Uniform Solvability. FOCS 2002: 228-237 - [c34]Burkhard Englert, Eli Gafni:
Fast Collect in the absence of contention. ICDCS 2002: 537-543 - 2001
- [j17]Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum:
The BG distributed simulation algorithm. Distributed Comput. 14(3): 127-146 (2001) - [j16]Eli Gafni, Michael Mitzenmacher:
Analysis of Timing-Based Mutual Exclusion with Random Times. SIAM J. Comput. 31(3): 816-837 (2001) - [c33]Eli Gafni, Michael Merritt, Gadi Taubenfeld:
The concurrency hierarchy, and algorithms for unbounded concurrency. PODC 2001: 161-169 - 2000
- [c32]Eli Gafni, Leslie Lamport:
Disk Paxos. DISC 2000: 330-344
1990 – 1999
- 1999
- [j15]Eli Gafni, Elias Koutsoupias:
Three-Processor Tasks Are Undecidable. SIAM J. Comput. 28(3): 970-983 (1999) - [c31]Eli Gafni, Jessica Staddon, Yiqun Lisa Yin:
Efficient Methods for Integrating Traceability and Broadcast Encryption. CRYPTO 1999: 372-387 - [c30]Eli Gafni, Michael Mitzenmacher:
Analysis of Timing-Based Mutual Exclusion with Random Times. PODC 1999: 13-21 - [p1]Eli Gafni:
Distributed Computing. Algorithms and Theory of Computation Handbook 1999 - 1998
- [c29]Eli Gafni:
Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). PODC 1998: 143-152 - [c28]Jiong Yang, Gil Neiger, Eli Gafni:
Structured Derivations of Consensus Algorithms for Failure Detectors. PODC 1998: 297-306 - 1997
- [j14]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) - [c27]Elizabeth Borowsky, Eli Gafni:
A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). PODC 1997: 189-198 - 1996
- [c26]Eli Gafni:
A Proof of a Theorem in Algebraic Topology by a Distributed Algorithm (Abstract). PODC 1996: 276 - [c25]Eli Gafni:
Simulation as an Iterated Task (Abstract). PODC 1996: 278 - 1995
- [j13]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) - [c24]Eli Gafni, Elias Koutsoupias:
3-Processor Tasks Are Undecidable (Abstract). PODC 1995: 271 - 1994
- [j12]Yehuda Afek, Eli Gafni:
Distributed Algorithms for Unidirectional Networks. SIAM J. Comput. 23(6): 1152-1178 (1994) - [j11]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) - [c23]Elizabeth Borowsky, Eli Gafni, Yehuda Afek:
Consensus Power Makes (Some) Sense! (Extended Abstract). PODC 1994: 363-372 - 1993
- [j10]Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. J. ACM 40(4): 873-890 (1993) - [c22]Elizabeth Borowsky, Eli Gafni:
Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). PODC 1993: 41-51 - [c21]Elizabeth Borowsky, Eli Gafni:
Generalized FLP impossibility result for t-resilient asynchronous computations. STOC 1993: 91-100 - 1992
- [c20]Yehuda Afek, Eli Gafni, Adi Rosén:
The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). PODC 1992: 35-46 - [c19]Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi:
Wait-free Test-and-Set (Extended Abstract). WDAG 1992: 85-94 - 1991
- [j9]Yehuda Afek, Eli Gafni:
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks. SIAM J. Comput. 20(2): 376-394 (1991) - [c18]Yehuda Afek, Eli Gafni:
Bootstrap Network Resynchronization (Extended Abstract). PODC 1991: 295-307 - 1990
- [c17]Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. PODC 1990: 1-13 - [c16]Yehuda Afek, Danny Dolev, Eli Gafni:
A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem. WDAG 1990: 422-431
1980 – 1989
- 1989
- [j8]Valmir Carneiro Barbosa, Eli Gafni:
A Distributed Implementation of Simulated Annealing. J. Parallel Distributed Comput. 6(2): 411-434 (1989) - [j7]Eli Gafni, Joseph Naor, Prabhakar Ragde:
On Separating the Erew and Crew Pram Models. Theor. Comput. Sci. 68(3): 343-346 (1989) - [j6]Valmir Carneiro Barbosa, Eli Gafni:
Concurrency in Heavily Loaded Neighborhood-Constrained Systems. ACM Trans. Program. Lang. Syst. 11(4): 562-584 (1989) - [c15]