Eric J. Schwabe

Available identifiers

Publication	Date of Publication	Type
A Benes-like theorem for the shuffle-exchange graph	2018-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q5501821	2015-08-14	Paper
Optimizing large data transfers in parity-declustered data layouts	2015-02-20	Paper
Efficient Mappings for Parity-Declustered Data Layouts	2011-03-18	Paper
Efficient data mappings for parity-declustered data layouts	2004-10-27	Paper
On bufferless routing of variable length messages in leveled networks	2003-11-02	Paper
Balancing load versus decreasing communication: Parameterizing the tradeoff	2002-08-14	Paper
Flexible usage of redundancy in disk arrays	2000-01-04	Paper
https://portal.mardi4nfdi.de/entity/Q4250989	1999-06-17	Paper
Real-time emulations of bounded-degree networks	1998-08-13	Paper
Evaluating approximately balanced parity-declustered data layouts for disk arrays	1998-07-22	Paper
Work-preserving emulations of fixed-connection networks	1998-01-22	Paper
Optimal emulations by butterfly-like networks	1998-01-21	Paper
Constant-slowdown simulations of normal hypercube algorithms on the butterfly network	1993-06-29	Paper
Embedding meshes of trees into deBruijn graphs	1993-01-17	Paper
Dynamic Tree Embeddings in Butterflies and Hypercubes	1993-01-16	Paper

This page was built for person: Eric J. Schwabe