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):
Displayed 43 items.
- Matrix structure and loss-resilient encoding/decoding (Q597244) (← links)
- Tight bounds for FEC-based reliable multicast (Q598189) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- Deterministic P-RAM simulation with constant redundancy (Q756419) (← links)
- Data distribution in a peer to peer storage system (Q851166) (← links)
- Failed disk recovery in double erasure RAID arrays (Q924549) (← links)
- One-to-many node-disjoint paths in \((n,k)\)-star graphs (Q968113) (← links)
- Short containers in Cayley graphs (Q1028103) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- General information dispersal algorithms (Q1274915) (← links)
- Rabin numbers of Butterfly networks (Q1297411) (← links)
- Fault-tolerant routing in circulant networks and cycle prefix networks (Q1305199) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- On strong Menger-connectivity of star graphs (Q1406044) (← links)
- Efficient non-repudiation multicast source authentication schemes. (Q1433965) (← links)
- From Hall's matching theorem to optimal routing on hypercubes (Q1569034) (← links)
- Secure distributed storage and retrieval (Q1575652) (← links)
- On the cost of recomputing: Tight bounds on pebbling with faults (Q1575959) (← links)
- On the total\(_k\)-diameter of connection networks (Q1583253) (← links)
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security (Q1602520) (← links)
- Distributed downloads of bulk, replicated grid data (Q1771264) (← links)
- A lower bound on the encoding length in lossy transmission (Q1818962) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- Asymptotically optimal erasure-resilient codes for large disk arrays. (Q1972905) (← links)
- Wide-diameter and minimum length of fan (Q1978711) (← links)
- Decoding interleaved Reed-Solomon codes over noisy channels (Q2373723) (← links)
- Addendum to ``Scalable secure storage when half the system is faulty'' [inform. comput. 174 (2)(2002) 203-213] (Q2373880) (← links)
- Node-disjoint paths in hierarchical hypercube networks (Q2384539) (← links)
- Analysis of randomized protocols for conflict-free distributed access (Q2461541) (← links)
- A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square (Q2476785) (← links)
- Cheating in visual cryptography (Q2491269) (← links)
- Efficient automatic simulation of parallel computation on networks of workstations (Q2492225) (← links)
- A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square (Q2509233) (← links)
- Strong Rabin numbers of folded hypercubes (Q2566009) (← links)
- Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. (Q2583551) (← 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)