Pages that link to "Item:Q3936664"
From MaRDI portal
The following pages link to A Scheme for Fast Parallel Communication (Q3936664):
Displaying 42 items.
- Tiara: a self-stabilizing deterministic skip list and skip graph (Q418743) (← links)
- Parallel methods for initial value problems (Q686538) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Towards a scalable and robust DHT (Q733718) (← links)
- Randomized oblivious integral routing for minimizing power cost (Q897952) (← links)
- A new look at fault-tolerant network routing (Q1099603) (← links)
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- Distributed match-making (Q1107317) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- Communication aspects of networks based on geometric incidence relations (Q1119610) (← links)
- Efficient delay routing (Q1128715) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Optimal routing algorithms for mesh-connected processor arrays (Q1188114) (← links)
- Analysis of minimal path routing schemes in the presence of faults (Q1199428) (← links)
- Embedding grids into hypercubes (Q1201880) (← links)
- A data parallel finite element method for computational fluid dynamics on the Connection Machine system (Q1205078) (← links)
- Constructing disjoint paths on expander graphs (Q1262782) (← links)
- A real-time algorithm for the \((n^{2}-1)\)-puzzle (Q1350227) (← links)
- Randomized routing on generalized hypercubes (Q1351447) (← links)
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs (Q1364476) (← links)
- Faster deterministic sorting through better sampling. (Q1401197) (← links)
- Low time complexity algorithms for path computation in Cayley graphs (Q1735699) (← links)
- Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- Oblivious bounds on the probability of boolean functions (Q2943565) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal (Q3358214) (← links)
- Bsp2omp: A Compiler For Translating Bsp Programs To Openmp (Q3399235) (← links)
- A fast distributed deadlock- detection algorithm for hypercube (Q3806795) (← links)
- On the theory of interconnection networks for parallel computers (Q4632449) (← links)
- Towards a better understanding of pure packet routing (Q5060094) (← links)
- Communication throughput of interconnection networks (Q5096871) (← links)
- Oblivious Routing for Sensor Network Topologies (Q5391122) (← links)
- (Q5874505) (← links)
- On the benefit of supporting virtual channels in wormhole routers (Q5943124) (← links)
- Some permutation routing algorithms for low-dimensional hypercubes (Q5958304) (← links)
- Good permutation codes based on the shuffle-exchange network (Q6076193) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
