Gafni, Eli - Computer Science Department, University of California at Los Angeles

E-print Network

FAQ • HELP • SITE MAP • CONTACT US

Powered by Explorit

Advanced Search

Gafni, Eli - Computer Science Department, University of California at Los Angeles

The 0 -1-Exclusion Family of Tasks July 20, 2008
Free-for-All Execution: Unifying Resiliency, Set-Consensus, and Concurrency
Read-Write Reductions Extended Abstract
[25] Nancy Lynch and Sergio Rasjbaum. A New Look at the BorowskyGafni Simulation Algorithm. Manuscript, 1995.
Analysis of Timing Based Mutual Exclusion with Random Times Eli Gafni # Michael Mitzenmacher +
Lemma A.9 If each view in CVG is associated with the shortest prefix run that gives rise to the view then for two views in a simplex one prefix run is a prefix of the other (modulo
On the WaitFree Power of IteratedImmediateSnapshots \Lambda (Extended Abstract)
RoundbyRound Fault Detectors: Unifying Synchrony and Asynchrony \Lambda
A Simple Algorithmic Characterization of Uniform Solvability \Lambda
On Uniform Protocols Eli Gafni \Lambda Elias Koutsoupias
The Extended BG-Simulation and the Characterization of t-Resiliency
Simulating Few by Many: Limited Concurrency = Set Consensus
A Simple Algorithmically Reasoned Characterization of Waitfree Computations \Lambda
Structured Derivations of Consensus Algorithms for Failure Detectors Jiong Yang \Lambda Gil Neiger y Eli Gafni z