Pages that link to "Item:Q3069909"
From MaRDI portal
The following pages link to Self-stabilizing clock synchronization in the presence of Byzantine faults (Q3069909):
Displaying 17 items.
- Self-stabilizing Byzantine asynchronous unison (Q455967) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Dynamic FTSS in asynchronous systems: the case of unison (Q551164) (← links)
- Randomization adaptive self-stabilization (Q707595) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Game authority for robust and scalable distributed selfish-computer systems (Q974739) (← links)
- Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
- Parallel composition for time-to-fault adaptive stabilization (Q1954229) (← links)
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures (Q1954236) (← links)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- Fast computation by population protocols with a leader (Q2377254) (← links)
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384) (← links)
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip (Q2637656) (← links)
- The triumph and tribulation of system stabilization (Q6062512) (← links)
- Self-stabilizing indulgent zero-degrading binary consensus (Q6201321) (← links)
