Pages that link to "Item:Q918186"
From MaRDI portal
The following pages link to Knowledge and common knowledge in a Byzantine environment: Crash failures (Q918186):
Displaying 50 items.
- No double discount: condition-based simultaneity yields limited gain (Q418187) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems (Q528185) (← links)
- A knowledge-based analysis of global function computation (Q660991) (← links)
- The complexity of almost-optimal simultaneous coordination (Q675301) (← links)
- Simultaneity is harder than agreement (Q757014) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Continuous consensus with ambiguous failures (Q986534) (← links)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- I'm OK if you're OK: On the notion of trusting commmunication (Q1114430) (← links)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- Using knowledge to optimally achieve coordination in distributed systems (Q1292424) (← links)
- Knowledge in shared memory systems. (Q1312600) (← links)
- Common knowledge and update in finite environments (Q1383157) (← links)
- Determination of social laws for multi-agent mobilization (Q1389600) (← links)
- A computer scientist looks at game theory. (Q1413213) (← links)
- Choosing social laws for multi-agent systems: Minimality and simplicity (Q1575182) (← links)
- A simple proof of the uniform consensus synchronous lower bound. (Q1853174) (← links)
- Naming and identity in epistemic logic. II: A first-order logic for naming (Q1855214) (← links)
- Continuous consensus via common knowledge (Q1954252) (← links)
- Unbeatable consensus (Q2121062) (← links)
- Wanted dead or alive: epistemic logic for impure simplicial complexes (Q2148776) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- Common knowledge and consistent simultaneous coordination (Q2365570) (← links)
- Synchronous condition-based consensus (Q2375299) (← links)
- The \(k\)-simultaneous consensus problem (Q2377137) (← links)
- Coordinated consensus in dynamic networks (Q2943377) (← links)
- Error-free multi-valued consensus with byzantine failures (Q2943378) (← links)
- Distributed graph coloring in a few rounds (Q2943379) (← links)
- MIS on trees (Q2943380) (← links)
- Toward more localized local algorithms (Q2943381) (← links)
- The complexity of robust atomic storage (Q2943384) (← links)
- Resilience of mutual exclusion algorithms to transient memory faults (Q2943385) (← links)
- The impact of memory models on software reliability in multiprocessors (Q2943388) (← links)
- A complexity separation between the cache-coherent and distributed shared memory models (Q2943389) (← links)
- From bounded to unbounded concurrency objects and back (Q2943391) (← links)
- The space complexity of long-lived and one-shot timestamp implementations (Q2943392) (← links)
- Locally checkable proofs (Q2943393) (← links)
- Fault-tolerant spanners (Q2943394) (← links)
- Adaptively secure broadcast, revisited (Q2943395) (← links)
- Scalable rational secret sharing (Q2943397) (← links)
- Analyzing consistency properties for fun and profit (Q2943399) (← links)
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions (Q2943400) (← links)
- Optimal-time adaptive strong renaming, with applications to counting (Q2943401) (← links)
- The round complexity of distributed sorting (Q2943403) (← links)
- A tight unconditional lower bound on distributed randomwalk computation (Q2943404) (← links)
- Minimum congestion mapping in a cloud (Q2943405) (← links)
- Conflict on a communication channel (Q2943406) (← links)
- Xheal (Q2943407) (← links)
