The following pages link to Josef Widder (Q424898):
Displaying 17 items.
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- (Q1186436) (redirect page) (← links)
- Adaptive cluster growth: A new algorithm for circuit placement in rectilinear regions (Q1186438) (← links)
- In search of lost time (Q1675756) (← links)
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures (Q1954236) (← links)
- A reduction theorem for randomized distributed algorithms under weak adversaries (Q2234073) (← links)
- The Theta-Model: achieving synchrony without clocks (Q2377129) (← links)
- Link reversal routing with binary link labels: work complexity (Q2840988) (← links)
- Efficient Checking of Link-Reversal-Based Concurrent Systems (Q2912698) (← links)
- A Logic-Based Framework for Verifying Consensus Algorithms (Q2938065) (← links)
- Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction (Q3296318) (← links)
- Time Complexity of Link Reversal Routing (Q4962176) (← links)
- On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection (Q5307039) (← links)
- Tolerating corrupted communication (Q5401417) (← links)
- Distributed Computing (Q5897404) (← links)
- Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms (Q6134260) (← links)
- Eliminating Message Counters in Threshold Automata (Q6485868) (← links)
