Pages that link to "Item:Q3357537"
From MaRDI portal
The following pages link to Tight bounds for oblivious routing in the hypercube (Q3357537):
Displayed 5 items.
- Parallel parsing of tree adjoining grammars on the connection machine (Q685085) (← links)
- Optimal oblivious routing on \(d\)-dimensional meshes (Q1770370) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- Optimal oblivious routing in polynomial time (Q5917575) (← links)
- Some permutation routing algorithms for low-dimensional hypercubes (Q5958304) (← links)