The following pages link to Eli Gafni (Q477088):
Displayed 23 items.
- The BG distributed simulation algorithm (Q5138357) (← links)
- An adaptive collect algorithm with applications (Q5138374) (← links)
- Disk Paxos (Q5138480) (← links)
- Sporadic Solutions to Zero-One Exclusion Tasks (Q5167726) (← links)
- The weakest failure detector for solving k-set agreement (Q5170305) (← links)
- The extended BG-simulation and the characterization of t-resiliency (Q5172701) (← links)
- Common2 extended to stacks and unbounded concurrency (Q5177283) (← links)
- Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations (Q5248475) (← links)
- Bootstrap network resynchronization (extended abstract) (Q5255828) (← links)
- STACS 2004 (Q5309729) (← links)
- The slide mechanism with applications in dynamic networks (Q5348833) (← links)
- Consensus power makes (some) sense! (extended abstract) (Q5361428) (← links)
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract) (Q5361482) (← links)
- Deterministic Objects (Q5361923) (← links)
- Brief Announcement (Q5361948) (← links)
- Immediate atomic snapshots and fast renaming (Q5365157) (← links)
- N-Consensus is the Second Strongest Object for N + 1 Processes (Q5386256) (← links)
- Distributed Computing (Q5395137) (← links)
- Group-Solvability (Q5464206) (← links)
- Wait-freedom with advice (Q5891976) (← links)
- Distributed Computing (Q5897397) (← links)
- Wait-freedom with advice (Q5918242) (← links)
- A King in every two consecutive tournaments (Q6327645) (← links)