Search the dblp DataBase
Eli Gafni :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Eli Gafni , Jessica Staddon , Yiqun Lisa Yin Efficient Methods for Integrating Traceability and Broadcast Encryption. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1999, pp:372-387 [Conf ] Yehuda Afek , Baruch Awerbuch , Eli Gafni Applying Static Network Protocols to Dynamic Networks [Citation Graph (0, 0)][DBLP ] FOCS, 1987, pp:358-370 [Conf ] Yehuda Afek , Eli Gafni , Moty Ricklin Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:370-375 [Conf ] Eli Gafni A Simple Algorithmic Characterization of Uniform Solvability. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:228-237 [Conf ] Valmir C. Barbosa , Eli Gafni Concurrency in Heavily Loaded Neighborhood-Constrained Systems. [Citation Graph (0, 0)][DBLP ] ICDCS, 1987, pp:448-457 [Conf ] Burkhard Englert , Eli Gafni Fast Collect in the absence of contention. [Citation Graph (0, 0)][DBLP ] ICDCS, 2002, pp:537-543 [Conf ] John M. Marberg , Eli Gafni Sorting and Selection in Multi-Channel Broadcast Networks. [Citation Graph (0, 0)][DBLP ] ICPP, 1985, pp:846-850 [Conf ] John M. Marberg , Eli Gafni An O(n^2 m^1/2) Distributed Max-Flow Algorithm. [Citation Graph (0, 0)][DBLP ] ICPP, 1987, pp:213-216 [Conf ] Yuval Tamir , Eli Gafni A Software-Based Hardware Fault Tolerance Scheme for Multicomputers. [Citation Graph (0, 0)][DBLP ] ICPP, 1987, pp:117-120 [Conf ] Eli Gafni , Sergio Rajsbaum , Michel Raynal , Corentin Travers The Committee Decision Problem. [Citation Graph (0, 0)][DBLP ] LATIN, 2006, pp:502-514 [Conf ] Amihai Motro , Alessandro D'Atri , Eli Gafni How Deep Should It Be? On the Optimality of Hierarchical Architectures. [Citation Graph (0, 0)][DBLP ] NGITS, 2006, pp:260-273 [Conf ] Eli Gafni Renaming with k -Set-Consensus: An Optimal Algorithm into n + k - 1 Slots. [Citation Graph (0, 0)][DBLP ] OPODIS, 2006, pp:36-44 [Conf ] Yehuda Afek , Danny Dolev , Hagit Attiya , Eli Gafni , Michael Merritt , Nir Shavit Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP ] PODC, 1990, pp:1-13 [Conf ] Yehuda Afek , Eli Gafni Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks. [Citation Graph (0, 0)][DBLP ] PODC, 1985, pp:186-195 [Conf ] Yehuda Afek , Eli Gafni Bootstrap Network Resynchronization (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1991, pp:295-307 [Conf ] Yehuda Afek , Eli Gafni , Adam Morrison Common2 extended to stacks and unbounded concurrency. [Citation Graph (0, 0)][DBLP ] PODC, 2006, pp:218-227 [Conf ] Yehuda Afek , Eli Gafni , Adi Rosén The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1992, pp:35-46 [Conf ] Marcos Kawazoe Aguilera , Burkhard Englert , Eli Gafni On using network attached disks as shared memory. [Citation Graph (0, 0)][DBLP ] PODC, 2003, pp:315-324 [Conf ] Elizabeth Borowsky , Eli Gafni Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1993, pp:41-51 [Conf ] Elizabeth Borowsky , Eli Gafni A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1997, pp:189-198 [Conf ] Elizabeth Borowsky , Eli Gafni , Yehuda Afek Consensus Power Makes (Some) Sense! (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1994, pp:363-372 [Conf ] Ching-Tsun Chou , Eli Gafni Understanding and Verifying Distributed Algorithms Using Stratified Decomposition. [Citation Graph (0, 0)][DBLP ] PODC, 1988, pp:44-65 [Conf ] Eli Gafni Improvements in the Time Complexity of Two Message-Optimal Election Algorithms. [Citation Graph (0, 0)][DBLP ] PODC, 1985, pp:175-185 [Conf ] Eli Gafni A Proof of a Theorem in Algebraic Topology by a Distributed Algorithm (Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1996, pp:276- [Conf ] Eli Gafni Simulation as an Iterated Task (Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1996, pp:278- [Conf ] Eli Gafni Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1998, pp:143-152 [Conf ] Eli Gafni , Yehuda Afek Election and Traversal in Unidirectional Networks. [Citation Graph (0, 0)][DBLP ] PODC, 1984, pp:190-198 [Conf ] Eli Gafni , Yehuda Afek End-to-End Communication in Unreliable Networks. [Citation Graph (0, 0)][DBLP ] PODC, 1988, pp:131-148 [Conf ] Eli Gafni , Elias Koutsoupias 3-Processor Tasks Are Undecidable (Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1995, pp:271- [Conf ] Eli Gafni , Michael Mitzenmacher Analysis of Timing-Based Mutual Exclusion with Random Times. [Citation Graph (0, 0)][DBLP ] PODC, 1999, pp:13-21 [Conf ] Eli Gafni , Michael Merritt , Gadi Taubenfeld The concurrency hierarchy, and algorithms for unbounded concurrency. [Citation Graph (0, 0)][DBLP ] PODC, 2001, pp:161-169 [Conf ] Jiong Yang , Gil Neiger , Eli Gafni Structured Derivations of Consensus Algorithms for Failure Detectors. [Citation Graph (0, 0)][DBLP ] PODC, 1998, pp:297-306 [Conf ] Carlos Brito , Eli Gafni , Shailesh Vaya An Information Theoretic Lower Bound for Broadcasting in Radio Networks. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:534-546 [Conf ] Elizabeth Borowsky , Eli Gafni Generalized FLP impossibility result for t-resilient asynchronous computations. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:91-100 [Conf ] Danny Dolev , Eli Gafni , Nir Shavit Toward a Non-Atomic Era: \ell-Exclusion as a Test Case [Citation Graph (0, 0)][DBLP ] STOC, 1988, pp:78-92 [Conf ] Eli Gafni , Rachid Guerraoui , Bastian Pochon From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement. [Citation Graph (0, 0)][DBLP ] STOC, 2005, pp:714-722 [Conf ] Yehuda Afek , Baruch Awerbuch , Eli Gafni Local Fail-safe Network Reset Procedure. [Citation Graph (0, 0)][DBLP ] WDAG, 1987, pp:197-211 [Conf ] Yehuda Afek , Danny Dolev , Eli Gafni A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem. [Citation Graph (0, 0)][DBLP ] WDAG, 1990, pp:422-431 [Conf ] Yehuda Afek , Eli Gafni , John Tromp , Paul M. B. Vitányi Wait-free Test-and-Set (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WDAG, 1992, pp:85-94 [Conf ] Marcos Kawazoe Aguilera , Burkhard Englert , Eli Gafni Uniform Solvability with a Finite Number of MWMR Registers. [Citation Graph (0, 0)][DBLP ] DISC, 2003, pp:16-29 [Conf ] Eli Gafni , Sergio Rajsbaum Musical Benches. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:63-77 [Conf ] Eli Gafni Group-Solvability. [Citation Graph (0, 0)][DBLP ] DISC, 2004, pp:30-40 [Conf ] Eli Gafni Generalized Scheme for Topology-Update in Dynamic Networks. [Citation Graph (0, 0)][DBLP ] WDAG, 1987, pp:187-196 [Conf ] Eli Gafni , Leslie Lamport Disk Paxos. [Citation Graph (0, 0)][DBLP ] DISC, 2000, pp:330-344 [Conf ] Eli Gafni , Sergio Rajsbaum , Maurice Herlihy Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. [Citation Graph (0, 0)][DBLP ] DISC, 2006, pp:329-338 [Conf ] Yehuda Afek , Eli Gafni , Sergio Rajsbaum , Michel Raynal , Corentin Travers Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. [Citation Graph (0, 0)][DBLP ] ICDCN, 2006, pp:331-341 [Conf ] Eli Gafni Read-Write Reductions. [Citation Graph (0, 0)][DBLP ] ICDCN, 2006, pp:349-354 [Conf ] John M. Marberg , Eli Gafni Sorting in Constant Number of Row and Column Phases on a Mesh. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1988, v:3, n:, pp:561-572 [Journal ] Hagit Attiya , Arie Fouren , Eli Gafni An adaptive collect algorithm with applications. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2002, v:15, n:2, pp:87-96 [Journal ] Elizabeth Borowsky , Eli Gafni , Nancy A. Lynch , Sergio Rajsbaum The BG distributed simulation algorithm. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2001, v:14, n:3, pp:127-146 [Journal ] Eli Gafni , Leslie Lamport Disk Paxos. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2003, v:16, n:1, pp:1-20 [Journal ] Yehuda Afek , Hagit Attiya , Danny Dolev , Eli Gafni , Michael Merritt , Nir Shavit Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP ] J. ACM, 1993, v:40, n:4, pp:873-890 [Journal ] Yehuda Afek , Baruch Awerbuch , Eli Gafni , Yishay Mansour , Adi Rosén , Nir Shavit Slide-The Key to Polynomial End-to-End Communication. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:22, n:1, pp:158-186 [Journal ] Valmir C. Barbosa , Eli Gafni A Distributed Implementation of Simulated Annealing. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1989, v:6, n:2, pp:411-434 [Journal ] Yehuda Afek , Eli Gafni Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1991, v:20, n:2, pp:376-394 [Journal ] Yehuda Afek , Eli Gafni Distributed Algorithms for Unidirectional Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:6, pp:1152-1178 [Journal ] Eli Gafni , Elias Koutsoupias Three-Processor Tasks Are Undecidable. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:28, n:3, pp:970-983 [Journal ] Eli Gafni , Michael Mitzenmacher Analysis of Timing-Based Mutual Exclusion with Random Times. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:3, pp:816-837 [Journal ] Eli Gafni , Joseph Naor , Prabhakar Ragde On Separating the Erew and Crew Pram Models. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1989, v:68, n:3, pp:343-346 [Journal ] John M. Marberg , Eli Gafni Distributed Sorting Algorithms for Multi-Channel Broadcast Networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1987, v:52, n:, pp:193-203 [Journal ] Eli Gafni , Dimitri P. Bertsekas Asymptotic optimality of shortest path routing algorithms. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1987, v:33, n:1, pp:83-90 [Journal ] Yehuda Afek , Danny Dolev , Eli Gafni , Michael Merritt , Nir Shavit A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:939-953 [Journal ] Valmir C. Barbosa , Eli Gafni Concurrency in Heavily Loaded Neighborhood-Constrained Systems. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1989, v:11, n:4, pp:562-584 [Journal ] N-Consensus is the Second Strongest Object for N+1 Processes. [Citation Graph (, )][DBLP ] The 0-1-Exclusion Families of Tasks. [Citation Graph (, )][DBLP ] The weakest failure detector for solving k-set agreement. [Citation Graph (, )][DBLP ] Brief announcement: on L-resilience, hitting sets, and colorless tasks. [Citation Graph (, )][DBLP ] Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. [Citation Graph (, )][DBLP ] Recursion in Distributed Computing. [Citation Graph (, )][DBLP ] The extended BG-simulation and the characterization of t-resiliency. [Citation Graph (, )][DBLP ] The Mailbox Problem. [Citation Graph (, )][DBLP ] Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. [Citation Graph (, )][DBLP ] On Set Consensus Numbers. [Citation Graph (, )][DBLP ] L-Resilient Adversaries and Hitting Sets [Citation Graph (, )][DBLP ] Common2 extended to stacks and unbounded concurrency. [Citation Graph (, )][DBLP ] Renaming in synchronous message passing systems with Byzantine failures. [Citation Graph (, )][DBLP ] Search in 0.108secs, Finished in 0.111secs