The following pages link to Eric J. Schwabe (Q202122):
Displayed 17 items.
- Real-time emulations of bounded-degree networks (Q1128816) (← links)
- Embedding meshes of trees into deBruijn graphs (Q1199946) (← links)
- Evaluating approximately balanced parity-declustered data layouts for disk arrays (Q1391511) (← links)
- Item:Q202122 (redirect page) (← links)
- Flexible usage of redundancy in disk arrays (Q1818093) (← links)
- Efficient data mappings for parity-declustered data layouts (Q1884842) (← links)
- Optimizing large data transfers in parity-declustered data layouts (Q2256719) (← links)
- Constant-slowdown simulations of normal hypercube algorithms on the butterfly network (Q2365816) (← links)
- Efficient Mappings for Parity-Declustered Data Layouts (Q3082933) (← links)
- Dynamic Tree Embeddings in Butterflies and Hypercubes (Q4018398) (← links)
- (Q4250989) (← links)
- Optimal emulations by butterfly-like networks (Q4371672) (← links)
- Work-preserving emulations of fixed-connection networks (Q4371700) (← links)
- On bufferless routing of variable length messages in leveled networks (Q4420985) (← links)
- A Benes-like theorem for the shuffle-exchange graph (Q5375378) (← links)
- (Q5501821) (← links)
- Balancing load versus decreasing communication: Parameterizing the tradeoff (Q5943104) (← links)