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 50 items.
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- Coding techniques for handling failures in large disk arrays (Q297238) (← links)
- Multiswapped networks and their topological and algorithmic properties (Q394739) (← links)
- One-to-many node-disjoint paths of hyper-star networks (Q442216) (← links)
- The wide-diameter of \(Z_{n, k}\) (Q505445) (← links)
- Matrix structure and loss-resilient encoding/decoding (Q597244) (← links)
- Tight bounds for FEC-based reliable multicast (Q598189) (← links)
- Enhancing data security in ad hoc networks based on multipath routing (Q666058) (← links)
- Application execution management on the integrade opportunistic grid middleware (Q666132) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- Deterministic P-RAM simulation with constant redundancy (Q756419) (← links)
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341) (← links)
- Data distribution in a peer to peer storage system (Q851166) (← links)
- On the construction of all shortest node-disjoint paths in star networks (Q903371) (← 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)
- Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
- Timed-release computational secret sharing and threshold encryption (Q1692147) (← 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)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← 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)
- Compact proofs of retrievability (Q2392096) (← links)
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes (Q2443019) (← 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)
- On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups (Q2512654) (← links)
- Strong Rabin numbers of folded hypercubes (Q2566009) (← links)
