Pages that link to "Item:Q3833606"
From MaRDI portal
The following pages link to Efficient dispersal of information for security, load balancing, and fault tolerance (Q3833606):
Displaying 24 items.
- Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. (Q2583551) (← links)
- Continuously non-malleable secret sharing: joint tampering, plain model and capacity (Q2697864) (← links)
- Internet Voting Protocol Based on Improved Implicit Security (Q2785982) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal (Q3358214) (← links)
- Wide diameter and minimum length of disjoint Menger path systems (Q3367054) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- Optimal Broadcast with Partial Knowledge (Q4210163) (← links)
- On-line secret sharing (Q4608512) (← links)
- On the cost of recomputing: tight bounds on pebbling with faults (Q4632415) (← links)
- On the theory of interconnection networks for parallel computers (Q4632449) (← links)
- Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing (Q4632452) (← links)
- Randomness in distribution protocols (Q4632457) (← links)
- Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme (Q4975177) (← links)
- Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements (Q4983546) (← links)
- Efficient parallel computing with memory faults (Q5055934) (← links)
- Towards a better understanding of pure packet routing (Q5060094) (← links)
- DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES (Q5249013) (← links)
- CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS (Q5249039) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Optimal Broadcast with Partial Knowledge (Q6062521) (← links)
- FRIDA: data availability sampling from FRI (Q6652989) (← links)
