default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric J. Schwabe
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j19]Eric J. Schwabe, Ian M. Sutherland:
Optimizing large data transfers in parity-declustered data layouts. J. Comput. Syst. Sci. 81(4): 671-691 (2015)
2000 – 2009
- 2008
- [c14]Matthew A. Goto, Eric J. Schwabe:
A Dynamic Programming Algorithm for De Novo Peptide Sequencing with Variable Scoring. ISBRA 2008: 171-182 - 2004
- [j18]Eric J. Schwabe, Ian M. Sutherland:
Efficient data mappings for parity-declustered data layouts. Theor. Comput. Sci. 325(3): 391-407 (2004) - 2003
- [c13]Eric J. Schwabe, Ian M. Sutherland:
Efficient Mappings for Parity-Declustered Data Layouts. COCOON 2003: 252-261 - 2001
- [j17]Valerie E. Taylor, Eric J. Schwabe, Bruce K. Holmer, Michelle R. Hribar:
Balancing Load versus Decreasing Communication: Parameterizing the Tradeoff. J. Parallel Distributed Comput. 61(5): 567-580 (2001)
1990 – 1999
- 1999
- [j16]Frank Thomson Leighton, Eric J. Schwabe:
Efficient Algorithms for Dynamic Allocation of Distributed Memo. Algorithmica 24(2): 139-171 (1999) - [j15]Eric J. Schwabe, Ian M. Sutherland:
Flexible Usage of Redundancy in Disk Arrays. Theory Comput. Syst. 32(5): 561-587 (1999) - [j14]Scott Hauck, Zhiyuan Li, Eric J. Schwabe:
Configuration compression for the Xilinx XC6200 FPGA. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(8): 1107-1113 (1999) - 1998
- [j13]Bruce M. Maggs, Eric J. Schwabe:
Real-Time Emulations of Bounded-Degree Networks. Inf. Process. Lett. 66(5): 269-276 (1998) - [c12]Scott Hauck, Zhiyuan Li, Eric J. Schwabe:
Configuration Compression for the Xilinx XC6200 FPGA. FCCM 1998: 138-146 - 1997
- [j12]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) - [j11]Eric J. Schwabe, Ian M. Sutherland, Bruce K. Holmer:
Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays. Parallel Comput. 23(4-5): 501-523 (1997) - [c11]Vijay Kumar, Eric J. Schwabe:
Improved Access to Optimal Bandwidth in Trees. SODA 1997: 437-444 - 1996
- [j10]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) - [j9]Eric J. Schwabe, Ian M. Sutherland:
Improved Parity-Declustered Layouts for Disk Arrays. J. Comput. Syst. Sci. 53(3): 328-343 (1996) - [j8]David S. Greenberg, James K. Park, Eric J. Schwabe:
The Cost of Complex Communication on Simple Networks. J. Parallel Distributed Comput. 35(2): 133-141 (1996) - [j7]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) - [j6]Scott Jordan, Eric J. Schwabe:
Worst-case performance of cellular channel assignment policies. Wirel. Networks 2(4): 265-275 (1996) - [c10]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 - [c9]Eric J. Schwabe, Ian M. Sutherland, Bruce K. Holmer:
Evaluating Approximately Balanced Parity-declustered Data Layouts for Disk Arrays. IOPADS 1996: 41-54 - [c8]Eric J. Schwabe, Ian M. Sutherland:
Flexible Usage of Parity Storage Space in Disk Arrays. SPAA 1996: 99-108 - [c7]Vijay Kumar, Eric J. Schwabe:
Improved algorithms and data structures for solving graph problems in external memory. SPDP 1996: 169-176 - 1994
- [c6]Eric J. Schwabe, Ian M. Sutherland:
Improved Parity-Declustered Layouts for Disk Arrays. SPAA 1994: 76-84 - 1993
- [j5]Eric J. Schwabe:
Constant-Slowdown Simulations of Normal Hypercube Algorithms on the Butterfly Network. Inf. Process. Lett. 45(6): 295-301 (1993) - [j4]Eric J. Schwabe:
Optimality of a VLSI Decomposition Scheme for the Debruijn Graph. Parallel Process. Lett. 3: 261-265 (1993) - [c5]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 - [c4]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 - 1992
- [j3]Eric J. Schwabe:
Embedding Meshes of Trees Into deBruijn Graphs. Inf. Process. Lett. 43(5): 237-240 (1992) - [j2]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) - [j1]Eric J. Schwabe:
A Benes-like Theorem for the Shuffle-Exchange Graph. IEEE Trans. Computers 41(12): 1627-1630 (1992) - 1991
- [c3]Frank Thomson Leighton, Eric J. Schwabe:
Efficient Algorithms for Dynamic Allocation of Distributed Memory. FOCS 1991: 470-479 - 1990
- [c2]Eric J. Schwabe:
On the Computational Equivalence of Hypercube-Derived Networks. SPAA 1990: 388-397
1980 – 1989
- 1989
- [c1]Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe:
Dynamic Tree Embeddings in Butterflies and Hypercubes. SPAA 1989: 224-234
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
