Pages that link to "Item:Q3765230"
From MaRDI portal
The following pages link to Efficient Schemes for Parallel Communication (Q3765230):
Displaying 21 items.
- The generalized packet routing problem (Q580964) (← links)
- Scheduling trains with small stretch on a unidirectional line (Q831686) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- Communication aspects of networks based on geometric incidence relations (Q1119610) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds (Q2078614) (← links)
- Optimal cover time for a graph-based coupon collector process (Q2434930) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- (Q3709880) (← links)
- (Q4390707) (← links)
- Delay-insensitive pipelined communication on parallel buses (Q4419697) (← links)
- On the theory of interconnection networks for parallel computers (Q4632449) (← links)
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)
- Stochastic analysis of dynamic processes (Q5055922) (← links)
- Towards a better understanding of pure packet routing (Q5060094) (← links)
- Communication throughput of interconnection networks (Q5096871) (← links)
- Shared memory simulations with triple-logarithmic delay (Q6102290) (← links)
