default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBehrooz Parhami
- > Home > Persons > Behrooz Parhami
Publications
- 2002
[c41]Chi-Hsiang Yeh, Behrooz Parhami:
ART: Robustness of Meshes and Tori for Parallel and Distributed Computation. ICPP 2002: 463-472- 2001
- [c40]Chi-Hsiang Yeh, Behrooz Parhami:
Parallel Algorithms for Index-Permutation Graphs - An Extension of Cayley Graphs for Multiple Chip-Multiprocessors (MCMP). ICPP 2001: 3-12 - [c39]Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varvarigos, Theodora A. Varvarigou:
RACE: A Software-Based Fault Tolerance Scheme for Systematically Transforming Ordinary Algorithms to Robust Algorithms. IPDPS 2001: 32 - [c38]Chi-Hsiang Yeh, Behrooz Parhami:
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks. IPDPS 2001: 72 - 2000
- [c37]Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Behrooz Parhami:
Multilayer VLSI Layout for Interconnection Networks. ICPP 2000: 33-42 - [c34]Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varvarigos, Hua Lee:
VLSI layout and packaging of butterfly networks. SPAA 2000: 196-205 - 1999
- [c33]Chi-Hsiang Yeh, Behrooz Parhami:
The Index-Permutation Graph Model for Hierarchical Interconnection Networks. ICPP 1999: 48-57 - [c32]Chi-Hsiang Yeh, Behrooz Parhami:
Routing and Embeddings in Cyclic Petersen Networks: An Efficient Extension of the Petersen Graph. ICPP 1999: 258-265 - [c31]Chi-Hsiang Yeh, Behrooz Parhami, Hua Lee, Emmanouel A. Varvarigos:
2.5n-Step Sorting on n*n Meshes in the Presence of o(sqrt(n)) Worst-Case Faults. IPPS/SPDP 1999: 436-440 - [c30]Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varvarigos:
The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks. IPPS/SPDP 1999: 441-445 - 1998
- [j32]Chi-Hsiang Yeh, Behrooz Parhami:
VLSI Layouts of Complete Graphs and Star Graphs. Inf. Process. Lett. 68(1): 39-45 (1998) - [c29]Chi-Hsiang Yeh, Behrooz Parhami:
A New Representation of Graphs and Its Applications to Parallel Processing. ICPADS 1998: 702-709 - [c28]Behrooz Parhami, Chi-Hsiang Yeh:
The Robust-Algorithm Approach to Fault Tolerance on Processor Arrays: Fault Models, Fault Diameter, and Basic Algorithms. IPPS/SPDP 1998: 742-746 - 1997
- [c27]Chi-Hsiang Yeh, Behrooz Parhami:
Optimal Sorting Algorithms on Incomplete Meshes with Arbitrary Fault Patterns. ICPP 1997: 4-11 - [c25]Chi-Hsiang Yeh, Behrooz Parhami:
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures. IPPS 1997: 739- - 1996
- [c24]Chi-Hsiang Yeh, Behrooz Parhami:
Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors. ICPADS 1996: 230-237 - [c23]Chi-Hsiang Yeh, Behrooz Parhami:
Hierarchical Swapped Networks: Efficient Low-Degree Alternatives to Hypercubes and Generalized Hypercubes. ISPAN 1996: 90-96 - [c19]Chi-Hsiang Yeh, Behrooz Parhami:
Cyclic Petersen Networks: Efficient Fixed-Degree Interconnection Networks for Large-Scale Multicomputer System. PDPTA 1996: 549-560 - [c16]Chi-Hsiang Yeh, Behrooz Parhami:
Recursive hierarchical swapped networks: versatile interconnection architectures for highly parallel systems. SPDP 1996: 453-460
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.
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.
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.
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:
