2008 |
31 | EE | Matthew A. Goto,
Eric J. Schwabe:
A Dynamic Programming Algorithm for De Novo Peptide Sequencing with Variable Scoring.
ISBRA 2008: 171-182 |
2004 |
30 | EE | Eric J. Schwabe,
Ian M. Sutherland:
Efficient data mappings for parity-declustered data layouts.
Theor. Comput. Sci. 325(3): 391-407 (2004) |
2003 |
29 | EE | Eric J. Schwabe,
Ian M. Sutherland:
Efficient Mappings for Parity-Declustered Data Layouts.
COCOON 2003: 252-261 |
2001 |
28 | EE | Valerie E. Taylor,
Eric J. Schwabe,
Bruce K. Holmer,
Michelle R. Hribar:
Balancing Load versus Decreasing Communication: Parameterizing the Tradeoff.
J. Parallel Distrib. Comput. 61(5): 567-580 (2001) |
1999 |
27 | EE | Frank Thomson Leighton,
Eric J. Schwabe:
Efficient Algorithms for Dynamic Allocation of Distributed Memo.
Algorithmica 24(2): 139-171 (1999) |
26 | EE | Scott Hauck,
Zhiyuan Li,
Eric J. Schwabe:
Configuration compression for the Xilinx XC6200 FPGA.
IEEE Trans. on CAD of Integrated Circuits and Systems 18(8): 1107-1113 (1999) |
25 | EE | Eric J. Schwabe,
Ian M. Sutherland:
Flexible Usage of Redundancy in Disk Arrays.
Theory Comput. Syst. 32(5): 561-587 (1999) |
1998 |
24 | EE | Scott Hauck,
Zhiyuan Li,
Eric J. Schwabe:
Configuration Compression for the Xilinx XC6200 FPGA.
FCCM 1998: 138-146 |
23 | EE | Bruce M. Maggs,
Eric J. Schwabe:
Real-Time Emulations of Bounded-Degree Networks.
Inf. Process. Lett. 66(5): 269-276 (1998) |
1997 |
22 | | Vijay Kumar,
Eric J. Schwabe:
Improved Access to Optimal Bandwidth in Trees.
SODA 1997: 437-444 |
21 | EE | Richard R. Koch,
Frank Thomson Leighton,
Bruce M. Maggs,
Satish Rao,
Arnold L. Rosenberg,
Eric J. Schwabe:
Work-preserving emulations of fixed-connection networks.
J. ACM 44(1): 104-147 (1997) |
20 | | Eric J. Schwabe,
Ian M. Sutherland,
Bruce K. Holmer:
Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays.
Parallel Computing 23(4-5): 501-523 (1997) |
1996 |
19 | EE | Valerie E. Taylor,
Bruce K. Holmer,
Eric J. Schwabe,
Michelle R. Hribar:
Balancing Load versus Decreasing Communication: Exploring the Tradeoffs.
HICSS (1) 1996: 585-593 |
18 | EE | Eric J. Schwabe,
Ian M. Sutherland,
Bruce K. Holmer:
Evaluating Approximately Balanced Parity-declustered Data Layouts for Disk Arrays.
IOPADS 1996: 41-54 |
17 | | Eric J. Schwabe,
Ian M. Sutherland:
Flexible Usage of Parity Storage Space in Disk Arrays.
SPAA 1996: 99-108 |
16 | | Sandeep N. Bhatt,
Gianfranco Bilardi,
Geppino Pucci,
Abhiram G. Ranade,
Arnold L. Rosenberg,
Eric J. Schwabe:
On Bufferless Routing of Variable Length Messages in Leveled Networks.
IEEE Trans. Computers 45(6): 714-729 (1996) |
15 | EE | Sandeep N. Bhatt,
Fan R. K. Chung,
Jia-Wei Hong,
Frank Thomson Leighton,
Bojana Obrenic,
Arnold L. Rosenberg,
Eric J. Schwabe:
Optimal Emulations by Butterfly-Like Networks.
J. ACM 43(2): 293-330 (1996) |
14 | | Eric J. Schwabe,
Ian M. Sutherland:
Improved Parity-Declustered Layouts for Disk Arrays.
J. Comput. Syst. Sci. 53(3): 328-343 (1996) |
13 | | David S. Greenberg,
James K. Park,
Eric J. Schwabe:
The Cost of Complex Communication on Simple Networks.
J. Parallel Distrib. Comput. 35(2): 133-141 (1996) |
12 | | Scott Jordan,
Eric J. Schwabe:
Worst-case performance of cellular channel assignment policies.
Wireless Networks 2(4): 265-275 (1996) |
1994 |
11 | EE | Eric J. Schwabe,
Ian M. Sutherland:
Improved Parity-Declustered Layouts for Disk Arrays.
SPAA 1994: 76-84 |
1993 |
10 | | Sandeep N. Bhatt,
Gianfranco Bilardi,
Geppino Pucci,
Abhiram G. Ranade,
Arnold L. Rosenberg,
Eric J. Schwabe:
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).
ESA 1993: 49-60 |
9 | | David S. Greenberg,
James K. Park,
Eric J. Schwabe:
Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and Columns.
SPDP 1993: 276-283 |
8 | | Eric J. Schwabe:
Constant-Slowdown Simulations of Normal Hypercube Algorithms on the Butterfly Network.
Inf. Process. Lett. 45(6): 295-301 (1993) |
7 | | Eric J. Schwabe:
Optimality of a VLSI Decomposition Scheme for the Debruijn Graph.
Parallel Processing Letters 3: 261-265 (1993) |
1992 |
6 | | Eric J. Schwabe:
A Benes-like Theorem for the Shuffle-Exchange Graph.
IEEE Trans. Computers 41(12): 1627-1630 (1992) |
5 | | Eric J. Schwabe:
Embedding Meshes of Trees Into deBruijn Graphs.
Inf. Process. Lett. 43(5): 237-240 (1992) |
4 | | Frank Thomson Leighton,
Mark Newman,
Abhiram G. Ranade,
Eric J. Schwabe:
Dynamic Tree Embeddings in Butterflies and Hypercubes.
SIAM J. Comput. 21(4): 639-654 (1992) |
1991 |
3 | | Frank Thomson Leighton,
Eric J. Schwabe:
Efficient Algorithms for Dynamic Allocation of Distributed Memory
FOCS 1991: 470-479 |
1990 |
2 | EE | Eric J. Schwabe:
On the Computational Equivalence of Hypercube-Derived Networks.
SPAA 1990: 388-397 |
1989 |
1 | EE | Frank Thomson Leighton,
Mark Newman,
Abhiram G. Ranade,
Eric J. Schwabe:
Dynamic Tree Embeddings in Butterflies and Hypercubes.
SPAA 1989: 224-234 |