The following pages link to Gil Neiger (Q1292423):
Displaying 18 items.
- (Q675300) (redirect page) (← links)
- The complexity of almost-optimal simultaneous coordination (Q675301) (← links)
- Using knowledge to optimally achieve coordination in distributed systems (Q1292424) (← links)
- Distributed consensus revisited (Q1318741) (← links)
- Simplifying the design of knowledge-based algorithms using knowledge consistency (Q1893742) (← links)
- Common knowledge and consistent simultaneous coordination (Q2365570) (← links)
- Structured derivations of consensus algorithms for failure detectors (Q2790120) (← links)
- Simplifying fault-tolerance (Q3196621) (← links)
- Automatically increasing the fault-tolerance of distributed algorithms (Q3489432) (← links)
- Fast and simple distributed consensus (Q5136978) (← links)
- Causal memory: definitions, implementation, and programming (Q5137003) (← links)
- On the use of registers in achieving wait-free consensus (Q5137333) (← links)
- (Q5203718) (← links)
- Simulating synchronized clocks and common knowledge in distributed systems (Q5286166) (← links)
- The possibility and the complexity of achieving fault-tolerant coordination (Q5348852) (← links)
- A gap theorem for consensus types extended abstract (Q5361426) (← links)
- On the use of registers in achieving wait-free consensus (Q5361427) (← links)
- Failure detectors and the wait-free hierarchy (extended abstract) (Q5361443) (← links)
