The following pages link to Yehuda Afek (Q455958):
Displaying 50 items.
- Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method (Q455960) (← links)
- A simple characterization of asynchronous computations (Q477089) (← links)
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- Local stabilizer (Q701137) (← links)
- Self-stabilization over unreliable communication media (Q1310565) (← links)
- Elections in anonymous networks (Q1333265) (← links)
- The local detection paradigm and its applications to self-stabilization (Q1389769) (← links)
- The power of multiobjects. (Q1854306) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Efficient adaptive collect algorithms (Q1954244) (← links)
- Common2 extended to stacks and unbounded concurrency (Q1954246) (← links)
- The CB tree: a practical concurrent self-adjusting search tree (Q2256968) (← links)
- The \(k\)-simultaneous consensus problem (Q2377137) (← links)
- Fast and scalable rendezvousing (Q2441532) (← links)
- Beeping a maximal independent set (Q2441534) (← links)
- Restoration by path concatenation (Q2787666) (← links)
- Failure detectors in loosely named systems (Q2934333) (← links)
- Musical Chairs (Q2935289) (← links)
- The power of multi-objects (extended abstract) (Q2942734) (← links)
- From bounded to unbounded concurrency objects and back (Q2943391) (← links)
- Distributed computing building blocks for rational agents (Q2943641) (← links)
- Oblivious Collaboration (Q3095350) (← links)
- A Biological Solution to a Fundamental Distributed Computing Problem (Q3101797) (← links)
- Slide—The Key to Polynomial End-to-End Communication (Q3125223) (← links)
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks (Q3210138) (← links)
- Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects (Q3524306) (← links)
- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus (Q3646220) (← links)
- (Q3790654) (← links)
- Sparser: A Paradigm for Running Distributed Algorithms (Q4033771) (← links)
- The Instancy of Snapshots and Commuting Objects (Q4228287) (← links)
- Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms (Q4228288) (← links)
- (Q4228458) (← links)
- (Q4232879) (← links)
- (Q4234103) (← links)
- (Q4259994) (← links)
- Atomic snapshots of shared memory (Q4271088) (← links)
- Distributed Algorithms For Unidirectional Networks (Q4327415) (← links)
- Optimal Time–Space Tradeoff for Shared Memory Leader Election (Q4366876) (← links)
- Computing with faulty shared objects (Q4369897) (← links)
- Local management of a global resource in a communication network (Q4371514) (← links)
- CBTree: A Practical Concurrent Self-Adjusting Search Tree (Q4909398) (← links)
- (Q5090892) (← links)
- (Q5090894) (← links)
- (Q5090908) (← links)
- The Synergy of Finite State Machines (Q5091099) (← links)
- On the complexity of global computation in the presence of link failures: the general case (Q5136985) (← links)
- Long lived adaptive splitter and applications (Q5138373) (← links)
- Restoration by path concatenation: fast recovery of MPLS paths (Q5138384) (← links)
- Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract) (Q5176772) (← links)
- Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract) (Q5176774) (← links)
