Pages that link to "Item:Q3485848"
From MaRDI portal
The following pages link to Fast randomized consensus using shared memory (Q3485848):
Displayed 40 items.
- The space complexity of unbounded timestamps (Q352241) (← links)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Combining shared-coin algorithms (Q666060) (← links)
- Efficient execution of nondeterministic parallel programs on asynchronous systems (Q1383149) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model (Q1938364) (← links)
- The correctness proof of Ben-Or's randomized consensus algorithm (Q1938380) (← links)
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler (Q1953239) (← links)
- On the importance of having an identity or, is consensus really universal? (Q1953645) (← links)
- Coupling and self-stabilization (Q1953653) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- A complexity-based classification for multiprocessor synchronization (Q1988522) (← links)
- Probabilistic black-box reachability checking (extended version) (Q2008284) (← links)
- Randomized consensus with regular registers (Q2059870) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- The epigenetic consensus problem (Q2117720) (← links)
- On atomic registers and randomized consensus in m\&m systems (Q2121060) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Error bounds for stochastic shortest path problems (Q2408892) (← links)
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes (Q2453111) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- Deniable Functional Encryption (Q2798776) (← links)
- An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols (Q2810974) (← links)
- Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers (Q3095338) (← links)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (Q4031320) (← links)
- A Tight Space Bound for Consensus (Q4997312) (← links)
- Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Naming symmetric processes using shared variables (Q5136976) (← links)
- Atomic snapshots using lattice agreement (Q5136986) (← links)
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (Q5137903) (← links)
- Randomized two-process wait-free test-and-set (Q5138376) (← links)
- Randomized protocols for asynchronous consensus (Q5138489) (← links)
- On the optimal space complexity of consensus for anonymous processes (Q5915696) (← links)
- Parameter-Independent Strategies for pMDPs via POMDPs (Q6104800) (← links)