Eric J. Schwabe - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2015

Optimizing large data transfers in parity-declustered data layoutsEric J. Schwabe, Ian M. Sutherland. jcss, 81(4):671-691, 2015. [doi]

2008

A Dynamic Programming Algorithm for De Novo Peptide Sequencing with Variable ScoringMatthew A. Goto, Eric J. Schwabe. isbra 2008: 171-182 [doi]

2004

Efficient data mappings for parity-declustered data layoutsEric J. Schwabe, Ian M. Sutherland. TCS, 325(3):391-407, 2004. [doi]

2003

Efficient Mappings for Parity-Declustered Data LayoutsEric J. Schwabe, Ian M. Sutherland. cocoon 2003: 252-261 [doi]

2001

Balancing Load versus Decreasing Communication: Parameterizing the TradeoffValerie E. Taylor, Eric J. Schwabe, Bruce K. Holmer, Michelle R. Hribar. jpdc, 61(5):567-580, 2001. [doi]

1999

Configuration compression for the Xilinx XC6200 FPGAScott Hauck, Zhiyuan Li, Eric J. Schwabe. tcad, 18(8):1107-1113, 1999. [doi]

Efficient Algorithms for Dynamic Allocation of Distributed MemoFrank Thomson Leighton, Eric J. Schwabe. algorithmica, 24(2):139-171, 1999. [doi]

Flexible Usage of Redundancy in Disk ArraysEric J. Schwabe, Ian M. Sutherland. mst, 32(5):561-587, 1999. [doi]

1998

Configuration Compression for the Xilinx XC6200 FPGAScott Hauck, Zhiyuan Li, Eric J. Schwabe. fccm 1998: 138-146 [doi]

Real-Time Emulations of Bounded-Degree NetworksBruce M. Maggs, Eric J. Schwabe. ipl, 66(5):269-276, 1998. [doi]

1997

Work-preserving emulations of fixed-connection networksRichard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe. JACM, 44(1):104-147, 1997. [doi]

Improved Access to Optimal Bandwidth in TreesVijay Kumar, Eric J. Schwabe. soda 1997: 437-444

Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk ArraysEric J. Schwabe, Ian M. Sutherland, Bruce K. Holmer. pc, 23(4-5):501-523, 1997.

1996

Optimal Emulations by Butterfly-Like NetworksSandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe. JACM, 43(2):293-330, 1996. [doi]

On Bufferless Routing of Variable Length Messages in Leveled NetworksSandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe. TC, 45(6):714-729, 1996.

The Cost of Complex Communication on Simple NetworksDavid S. Greenberg, James K. Park, Eric J. Schwabe. jpdc, 35(2):133-141, 1996.

Worst-case performance of cellular channel assignment policiesScott Jordan, Eric J. Schwabe. winet, 2(4):265-275, 1996.

Improved algorithms and data structures for solving graph problems in external memoryVijay Kumar, Eric J. Schwabe. spdp 1996: 169-176 [doi]

Improved Parity-Declustered Layouts for Disk ArraysEric J. Schwabe, Ian M. Sutherland. jcss, 53(3):328-343, 1996.

Flexible Usage of Parity Storage Space in Disk ArraysEric J. Schwabe, Ian M. Sutherland. spaa 1996: 99-108

Evaluating Approximately Balanced Parity-declustered Data Layouts for Disk ArraysEric J. Schwabe, Ian M. Sutherland, Bruce K. Holmer. iopads 1996: 41-54 [doi]

Balancing Load versus Decreasing Communication: Exploring the TradeoffsValerie E. Taylor, Bruce K. Holmer, Eric J. Schwabe, Michelle R. Hribar. hicss 1996: 585-593 [doi]

1994

Improved Parity-Declustered Layouts for Disk ArraysEric J. Schwabe, Ian M. Sutherland. spaa 1994: 76-84 [doi]

1993

On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract)Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe. esa 1993: 49-60

Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and ColumnsDavid S. Greenberg, James K. Park, Eric J. Schwabe. spdp 1993: 276-283

Optimality of a VLSI Decomposition Scheme for the Debruijn GraphEric J. Schwabe. ppl, 3:261-265, 1993.

Constant-Slowdown Simulations of Normal Hypercube Algorithms on the Butterfly NetworkEric J. Schwabe. ipl, 45(6):295-301, 1993.

1992

Dynamic Tree Embeddings in Butterflies and HypercubesFrank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe. SICOMP, 21(4):639-654, 1992.

A Benes-like Theorem for the Shuffle-Exchange GraphEric J. Schwabe. TC, 41(12):1627-1630, 1992.

Embedding Meshes of Trees Into deBruijn GraphsEric J. Schwabe. ipl, 43(5):237-240, 1992.

1991

Efficient Algorithms for Dynamic Allocation of Distributed MemoryFrank Thomson Leighton, Eric J. Schwabe. focs 1991: 470-479

1990

On the Computational Equivalence of Hypercube-Derived NetworksEric J. Schwabe. spaa 1990: 388-397 [doi]

1989

Dynamic Tree Embeddings in Butterflies and HypercubesFrank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe. spaa 1989: 224-234 [doi]

Sign in or sign up to see more results.

runs on WebDSL