Pages that link to "Item:Q3452512"
From MaRDI portal
The following pages link to Conditions on input vectors for consensus solvability in asynchronous distributed systems (Q3452512):
Displaying 18 items.
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- No double discount: condition-based simultaneity yields limited gain (Q418187) (← links)
- A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems (Q845867) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
- Synchronous condition-based consensus (Q2375299) (← links)
- On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time (Q2406433) (← links)
- A hierarchy of conditions for consensus solvability (Q2787677) (← links)
- Communication Patterns and Input Patterns in Distributed Computing (Q3460703) (← links)
- Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time (Q3460716) (← links)
- No Double Discount: Condition-Based Simultaneity Yields Limited Gain (Q3540247) (← links)
- What Can be Computed in a Distributed System? (Q5170751) (← links)
- Conditions on input vectors for consensus solvability in asynchronous distributed systems (Q5175963) (← links)
- Narrowing Power vs. Efficiency in Synchronous Set Agreement (Q5445741) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)
- On the Validity of Consensus (Q6202272) (← links)
