Pages that link to "Item:Q1339875"
From MaRDI portal
The following pages link to On optimal broadcasting in faulty hypercubes (Q1339875):
Displaying 25 items.
- Optimal broadcasting for locally twisted cubes (Q413259) (← links)
- Hierarchical spanning trees and distributing on incomplete hypercubes (Q808225) (← links)
- Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes (Q852884) (← links)
- Rapid almost-complete broadcasting in faulty networks (Q1008737) (← links)
- How robust is the n-cube? (Q1104728) (← links)
- Broadcasting in a hypercube when some calls fail (Q1182079) (← links)
- Efficient broadcasting with linearly bounded faults (Q1281388) (← links)
- Symmetric flows and broadcasting in hypercubes (Q1296143) (← links)
- Reliable broadcasting (Q1339885) (← links)
- Optimal broadcasting in injured hypercubes using directed safety levels. (Q1414737) (← links)
- Dynamic faults have small effect on broadcasting in hypercubes. (Q1427194) (← links)
- Optimal broadcasting in faulty trees (Q1577006) (← links)
- Round robin is optimal for fault-tolerant broadcasting on wireless networks (Q1878699) (← links)
- A note on optimal time broadcast in faulty hypercubes (Q1892869) (← links)
- Dimension ordering and broadcast algorithms in faulty SIMD hypercubes (Q1923384) (← links)
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← links)
- Broadcasting in hypercubes and star graphs with dynamic faults. (Q2583571) (← links)
- A fully decentralized and oblivious multi-node broadcast algorithm in hypercubes (Q2751886) (← links)
- Deterministic Models of Communication Faults (Q3599115) (← links)
- Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures (Q4419654) (← links)
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices (Q4639925) (← links)
- (Q4796195) (← links)
- Fault—tolerant hypercube broadcasting via information dispersal (Q5289370) (← links)
- Minimizing message complexity of partially replicated data on hypercubes (Q5689820) (← links)
- Broadcasting in hypercubes with randomly distributed Byzantine faults (Q6084558) (← links)
