Остановите войну!
for scientists:
default search action
Behrooz Parhami
- > Home > Persons > Behrooz Parhami
Publications
- 2004
- [j44]Behrooz Parhami, Ding-Ming Kwai:
Incomplete k-ary n-cube and its derivatives. J. Parallel Distributed Comput. 64(2): 183-190 (2004) - [j43]Behrooz Parhami, Ding-Ming Kwai:
Comparing four classes of torus-based parallel architectures: Networkparameters and communication performance. Math. Comput. Model. 40(7-8): 701-720 (2004) - 2003
- [j42]Behrooz Parhami, Ding-Ming Kwai:
Parallel Architectures and Adaptation Algorithms for Programmable FIR Digital Filters With Fully Pipelined Data and Control Flows. J. Inf. Sci. Eng. 19(1): 59-74 (2003) - 2001
- [j39]Behrooz Parhami, Ding-Ming Kwai:
A Unified Formulation of Honeycomb and Diamond Networks. IEEE Trans. Parallel Distributed Syst. 12(1): 74-80 (2001) - [j38]Ding-Ming Kwai, Behrooz Parhami:
Scalable Linear Array Architecture with Data-Driven Control for Ultrahigh-Speed Vector Quantization. J. VLSI Signal Process. 28(3): 235-243 (2001) - 2000
- [c36]Ding-Ming Kwai, Behrooz Parhami:
Characterization and Generalization of Honeycomb and Diamond Networks. PDPTA 2000 - 1999
- [j37]Behrooz Parhami, Ding-Ming Kwai:
Data-Driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter. IEEE Trans. Parallel Distributed Syst. 10(1): 23-28 (1999) - [j36]Behrooz Parhami, Ding-Ming Kwai:
Periodically Regular Chordal Rings. IEEE Trans. Parallel Distributed Syst. 10(6): 658-672 (1999) - [j35]Behrooz Parhami, Ding-Ming Kwai:
Correction to 'Periodically Regular Chordal Rings'. IEEE Trans. Parallel Distributed Syst. 10(7): 767-768 (1999) - [j34]Ding-Ming Kwai, Behrooz Parhami:
Scalability of Programmable FIR Digital Filters. J. VLSI Signal Process. 21(1): 31-35 (1999) - 1998
- [j33]Ding-Ming Kwai, Behrooz Parhami:
Tight Bounds on the Diameter of Gaussian Cubes. Comput. J. 41(1): 52-56 (1998) - [j31]Ding-Ming Kwai, Behrooz Parhami:
Pruned Three-Dimensional Toroidal Networks. Inf. Process. Lett. 68(4): 179-183 (1998) - 1997
- [j29]Ding-Ming Kwai, Behrooz Parhami:
An on-line fault diagnosis scheme for linear processor arrays. Microprocess. Microsystems 20(7): 423-428 (1997) - [c26]Ding-Ming Kwai, Behrooz Parhami:
A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes. ICPP 1997: 92-95 - 1996
- [j26]Ding-Ming Kwai, Behrooz Parhami:
A Generalization of Hypercubic Networks Based on their Chordal Ring Structures. Parallel Process. Lett. 6(4): 469-477 (1996) - [j23]Ding-Ming Kwai, Behrooz Parhami:
FFT computation with linear processor arrays using a data-driven control scheme. J. VLSI Signal Process. 13(1): 57-66 (1996) - [c20]Ding-Ming Kwai, Behrooz Parhami:
Comparing the Performance Parameters of Two Network Structures for Scalable Massively Parallel Processors. MASCOTS 1996: 273-277 - [c17]Ding-Ming Kwai, Behrooz Parhami:
Periodically regular chordal rings: generality, scalability, and VLSI layout. SPDP 1996: 148-151
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 2024-04-25 01:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint