Pages that link to "Item:Q1226470"
From MaRDI portal
The following pages link to On the complexity of an optimal non-blocking commutation scheme without reorganization (Q1226470):
Displaying 14 items.
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
- Cutoff phenomena for random walks on random regular graphs (Q984454) (← links)
- Real-time emulations of bounded-degree networks (Q1128816) (← links)
- On rearrangeable and non-blocking switching networks (Q1250088) (← links)
- Time-space trade-offs in a pebble game (Q1254254) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- Some ``good'' properties of LDA lattices (Q1752293) (← links)
- On the spectral gap and the diameter of Cayley graphs (Q2234376) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Explicit expanding expanders (Q2408170) (← links)
- Explicit Concentrators from Generalized <i>N</i>-Gons (Q3216690) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Expanders and Diffusers (Q3753504) (← links)
- Towards a better understanding of pure packet routing (Q5060094) (← links)
