Pages that link to "Item:Q2961576"
From MaRDI portal
The following pages link to Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms (Q2961576):
Displaying 6 items.
- Counting protocols for reliable end-to-end transmission (Q1267718) (← links)
- Scalable eventually consistent counters over unreliable networks (Q1733394) (← links)
- Parameterized model checking of networks of timed automata with Boolean guards (Q1989334) (← links)
- Synthesis of distributed algorithms with parameterized threshold guards (Q3300835) (← links)
- Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing (Q4635891) (← links)
- Reachability in Parameterized Systems: All Flavors of Threshold Automata (Q5009433) (← links)