Pages that link to "Item:Q3768381"
From MaRDI portal
The following pages link to On the minimal synchronism needed for distributed consensus (Q3768381):
Displaying 50 items.
- From binary consensus to multivalued consensus in asynchronous message-passing systems (Q294742) (← links)
- Byzantine agreement with homonyms in synchronous systems (Q391249) (← links)
- Simulating synchronous processors (Q578903) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
- Tight bounds on the round complexity of distributed 1-solvable tasks (Q673104) (← links)
- The asynchronous bounded-cycle model (Q719298) (← links)
- Design of transaction commitment protocols (Q751232) (← links)
- A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems (Q845867) (← links)
- Transaction commit in a realistic timing model (Q913533) (← links)
- Initial failures in distributed computations (Q915424) (← links)
- On the minimum requirements for independent recovery in distributed systems (Q922672) (← links)
- The gap in circumventing the impossibility of consensus (Q931725) (← links)
- Fault-tolerant critical section management in asynchronous environments (Q1183601) (← links)
- Efficient parallel algorithms can be made robust (Q1189859) (← links)
- Fast information sharing in a complete network (Q1209151) (← links)
- Space-efficient asynchronous consensus without shared memory initialization (Q1209330) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Necessary and sufficient conditions for broadcast consensus protocols. (Q1312603) (← links)
- Reliability versus cost: Design of a probabilistic broadcast algorithm (Q1331788) (← links)
- Efficient execution of nondeterministic parallel programs on asynchronous systems (Q1383149) (← links)
- Revisiting the PAXOS algorithm (Q1575634) (← links)
- In search of lost time (Q1675756) (← links)
- Computing in totally anonymous asynchronous shared memory systems (Q1854512) (← links)
- A classification of wait-free loop agreement tasks (Q1870526) (← links)
- A necessary and sufficient condition for transforming limited accuracy failure detectors (Q1878682) (← links)
- Possibility and impossibility results in a shared memory environment (Q1901689) (← links)
- Failure detectors encapsulate fairness (Q1938374) (← links)
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler (Q1953239) (← links)
- Low complexity Byzantine-resilient consensus (Q1953244) (← links)
- Active disk Paxos with infinitely many processes (Q1953639) (← links)
- Randomized leader election (Q1954216) (← links)
- Failure detectors as type boosters (Q1954255) (← links)
- MinMax algorithms for stabilizing consensus (Q1981802) (← links)
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures (Q2009633) (← links)
- The epigenetic consensus problem (Q2117720) (← links)
- The Theta-Model: achieving synchrony without clocks (Q2377129) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- On implementing omega in systems with weak reliability and synchrony assumptions (Q2377261) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- A Paxos based algorithm to minimize the overhead of process recovery in consensus (Q2422778) (← links)
- Generalized Paxos made Byzantine (and less complex) (Q2633262) (← links)
- Highly concurrent logically synchronous multicast (Q2638776) (← links)
- Minimizing synchronization in \(\text{IDR}(s)\). (Q2897405) (← links)
- Byzantine Agreement Using Partial Authentication (Q3095344) (← links)
- Reliable synchronization in distributed systems (Q3154799) (← links)
- Authenticated Byzantine Generals in Dual Failure Model (Q3406476) (← links)
- A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling (Q3460730) (← links)
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (Q4031320) (← links)
- On distributed algorithms in a broadcast domain (Q4630276) (← links)
