Pages that link to "Item:Q3357537"
From MaRDI portal
The following pages link to Tight bounds for oblivious routing in the hypercube (Q3357537):
Displaying 13 items.
- Parallel parsing of tree adjoining grammars on the connection machine (Q685085) (← links)
- Optimal oblivious routing on \(d\)-dimensional meshes (Q1770370) (← links)
- Optimal permutation routing for low-dimensional hypercubes (Q3057142) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- On the theory of interconnection networks for parallel computers (Q4632449) (← links)
- Towards a better understanding of pure packet routing (Q5060094) (← links)
- (Q5075823) (← links)
- Oblivious Routing for Sensor Network Topologies (Q5391122) (← links)
- (Q5874505) (← links)
- Optimal oblivious routing in polynomial time (Q5917575) (← links)
- Some permutation routing algorithms for low-dimensional hypercubes (Q5958304) (← links)
- Communication in parallel systems (Q6560186) (← links)
