Eric J. Schwabe

According to our database1, Eric J. Schwabe authored at least 29 papers between 1990 and 2015.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Optimizing large data transfers in parity-declustered data layouts.
J. Comput. Syst. Sci., 2015

2008
A Dynamic Programming Algorithm for De Novo Peptide Sequencing with Variable Scoring.
Proceedings of the Bioinformatics Research and Applications, 2008

2004
Efficient data mappings for parity-declustered data layouts.
Theor. Comput. Sci., 2004

2003
Efficient Mappings for Parity-Declustered Data Layouts.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2001
Balancing Load versus Decreasing Communication: Parameterizing the Tradeoff.
J. Parallel Distributed Comput., 2001

1999
Configuration compression for the Xilinx XC6200 FPGA.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999

Flexible Usage of Redundancy in Disk Arrays.
Theory Comput. Syst., 1999

Efficient Algorithms for Dynamic Allocation of Distributed Memo.
Algorithmica, 1999

1998
Real-Time Emulations of Bounded-Degree Networks.
Inf. Process. Lett., 1998

1997
Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays.
Parallel Comput., 1997

Work-preserving emulations of fixed-connection networks.
J. ACM, 1997

Improved Access to Optimal Bandwidth in Trees.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Worst-case performance of cellular channel assignment policies.
Wirel. Networks, 1996

On Bufferless Routing of Variable Length Messages in Leveled Networks.
IEEE Trans. Computers, 1996

The Cost of Complex Communication on Simple Networks.
J. Parallel Distributed Comput., 1996

Improved Parity-Declustered Layouts for Disk Arrays.
J. Comput. Syst. Sci., 1996

Optimal Emulations by Butterfly-Like Networks.
J. ACM, 1996

Improved algorithms and data structures for solving graph problems in external memory.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Flexible Usage of Parity Storage Space in Disk Arrays.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Balancing Load versus Decreasing Communication: Exploring the Tradeoffs.
Proceedings of the 29th Annual Hawaii International Conference on System Sciences (HICSS-29), 1996

1993
Optimality of a VLSI Decomposition Scheme for the Debruijn Graph.
Parallel Process. Lett., 1993

Constant-Slowdown Simulations of Normal Hypercube Algorithms on the Butterfly Network.
Inf. Process. Lett., 1993

Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and Columns.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
A Benes-like Theorem for the Shuffle-Exchange Graph.
IEEE Trans. Computers, 1992

Dynamic Tree Embeddings in Butterflies and Hypercubes.
SIAM J. Comput., 1992

Embedding Meshes of Trees Into deBruijn Graphs.
Inf. Process. Lett., 1992

1991
Efficient Algorithms for Dynamic Allocation of Distributed Memory
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
On the Computational Equivalence of Hypercube-Derived Networks.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990


  Loading...