Pages that link to "Item:Q3823119"
From MaRDI portal
The following pages link to Fault Tolerance in Networks of Bounded Degree (Q3823119):
Displaying 50 items.
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Reliable communication over partially authenticated networks (Q1292432) (← links)
- Fast consensus in networks of bounded degree. (Q1312604) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- Dynamic monopolies of constant size (Q1850560) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Efficient constructions for almost-everywhere secure computation (Q2119011) (← links)
- Instant block confirmation in the sleepy model (Q2147229) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- Lower bound for scalable Byzantine agreement (Q2377258) (← links)
- Agreement in synchronous networks with ubiquitous faults (Q2382676) (← links)
- Secure multi-party computation in large networks (Q2401120) (← 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)
- Stability of a peer-to-peer communication system (Q2943409) (← links)
- Tight bounds on information dissemination in sparse mobile networks (Q2943410) (← links)
- Time-efficient randomized multiple-message broadcast in radio networks (Q2943411) (← links)
- Faster information dissemination in dynamic networks via network coding (Q2943412) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Dynamics of random graphs with bounded degrees (Q3301221) (← links)
- Fault-Tolerant Consensus with an Abstract MAC Layer. (Q5090931) (← links)
- The complexity of open k-monopolies in graphs for negative k (Q5106671) (← links)
