The following pages link to Eli Gafni (Q477088):
Displayed 50 items.
- A simple characterization of asynchronous computations (Q477089) (← links)
- Linear space bootstrap communication schemes (Q477099) (← links)
- The mailbox problem (Q661002) (← links)
- On set consensus numbers (Q661057) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Distributed sorting algorithms for multi-channel broadcast networks (Q1098273) (← links)
- Sorting in constant number of row and column phases on a mesh (Q1105380) (← links)
- On separating the EREW and CREW PRAM models (Q1124343) (← links)
- An algorithmic approach to the asynchronous computability theorem (Q1616400) (← links)
- Asynchronous computability theorems for \(t\)-resilient systems (Q1660951) (← links)
- Elastic configuration maintenance via a parsimonious speculating snapshot solution (Q1664137) (← links)
- Common2 extended to stacks and unbounded concurrency (Q1954246) (← links)
- Renaming in synchronous message passing systems with Byzantine failures (Q1954260) (← links)
- The assignment problem (Q2232588) (← links)
- The \(k\)-simultaneous consensus problem (Q2377137) (← links)
- (Q2766889) (← links)
- Analysis of Timing-Based Mutual Exclusion with Random Times (Q2784482) (← links)
- The concurrency hierarchy, and algorithms for unbounded concurrency (Q2787678) (← links)
- Round-by-round fault detectors (extended abstract) (Q2790109) (← links)
- Structured derivations of consensus algorithms for failure detectors (Q2790120) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- Musical Chairs (Q2935289) (← links)
- Analysis of timing-based mutual exclusion with random times (Q2942747) (← links)
- A generalized asynchronous computability theorem (Q2943623) (← links)
- The Complexity of Early Deciding Set Agreement (Q2999854) (← links)
- Asymptotic optimality of shortest path routing algorithms (Q3028855) (← links)
- Projected Newton methods and optimization of multicommodity flows (Q3039012) (← links)
- Generalized Universality (Q3090818) (← links)
- Oblivious Collaboration (Q3095350) (← links)
- Slide—The Key to Polynomial End-to-End Communication (Q3125223) (← links)
- (Q3174928) (← links)
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks (Q3210138) (← links)
- Two-Metric Projection Methods for Constrained Optimization (Q3220362) (← links)
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks (Q3335695) (← links)
- Dynamic control of session input rates in communication networks (Q3342183) (← links)
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement (Q3524315) (← links)
- The Committee Decision Problem (Q3525785) (← links)
- The Mailbox Problem (Q3540216) (← links)
- From a static impossibility to an adaptive lower bound (Q3581411) (← links)
- On Set Consensus Numbers (Q3646215) (← links)
- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus (Q3646220) (← links)
- (Q3790654) (← links)
- (Q3793716) (← links)
- (Q3864317) (← links)
- Projection methods for variational inequalities with application to the traffic assignment problem (Q3936522) (← links)
- Three-Processor Tasks Are Undecidable (Q4229418) (← links)
- Atomic snapshots of shared memory (Q4271088) (← links)
- Distributed Algorithms For Unidirectional Networks (Q4327415) (← links)
- (Q4941866) (← links)
- (Q5090908) (← links)