Остановите войну!
for scientists:
default search action
C. T. Howard Ho
- > Home > Persons > C. T. Howard Ho
Publications
- 1995
- [j22]S. Lennart Johnsson, Ching-Tien Ho:
On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes. IEEE Trans. Computers 44(1): 47-53 (1995) - 1994
- [j17]S. Lennart Johnsson, Ching-Tien Ho:
Optimal communication channel utilization for matrix transposition and related permutations on binary cubes. Discret. Appl. Math. 53(1-3): 251-274 (1994) - [j16]Ching-Tien Ho, S. Lennart Johnsson:
Embedding hyperpyramids into hypercubes. IBM J. Res. Dev. 38(1): 31-46 (1994) - [j15]Ching-Tien Ho, M. T. Raghunath, S. Lennart Johnsson:
An Efficient Algorithms for Gray-to-Binary Permutation on Hypercubes. J. Parallel Distributed Comput. 20(1): 114-120 (1994) - [j14]S. Lennart Johnsson, Ching-Tien Ho:
Binary Cube Emulation of Butterfly Networks Encoded by Grad Code. J. Parallel Distributed Comput. 20(3): 261-279 (1994) - 1992
- [j7]Ching-Tien Ho, M. T. Raghunath:
Efficient communication primitives on hypercubes. Concurr. Pract. Exp. 4(6): 427-457 (1992) - [j6]S. Lennart Johnsson, Ching-Tien Ho:
Generalized Shuffle Permutations on Boolean Cubes. J. Parallel Distributed Comput. 16(1): 1-14 (1992) - [c16]Ching-Tien Ho, M. T. Raghunath:
Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes. ICPP (3) 1992: 55-59 - 1990
- [j3]Ching-Tien Ho, S. Lennart Johnsson:
Embedding Meshes in Boolean Cubes by Graph Decomposition. J. Parallel Distributed Comput. 8(4): 325-339 (1990) - [j2]Ching-Tien Ho, S. Lennart Johnsson:
Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors. SIAM J. Sci. Comput. 11(3): 563-592 (1990) - [c8]Ching-Tien Ho, S. Lennart Johnsson:
Embedding Three-Dimensional Meshes in Boolean Cubes by Graph Decomposition. ICPP (3) 1990: 319-326 - 1989
- [j1]S. Lennart Johnsson, Ching-Tien Ho:
Optimum Broadcasting and Personalized Communication in Hypercubes. IEEE Trans. Computers 38(9): 1249-1268 (1989) - [c7]Ching-Tien Ho, S. Lennart Johnsson:
Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors. PPSC 1989: 96-98 - [c6]Ching-Tien Ho, S. Lennart Johnsson:
Dilation d embedding of a hyper-pyramid into a hypercube. SC 1989: 294-303 - 1988
- [c5]Ching-Tien Ho, S. Lennart Johnsson:
Optimal algorithms for stable dimension permutations on Boolean cubes. C³P 1988: 725-736 - [c4]S. Lennart Johnsson, Ching-Tien Ho:
Expressing Boolean cube matrix algorithms in shared memory primitives. C³P 1988: 1599-1609 - 1987
- [c3]Ching-Tien Ho, S. Lennart Johnsson:
On the Embedding of Arbitrary Meshes in Boolean Cubes With Expansion Two Dilation Two. ICPP 1987: 188-191 - [c2]S. Lennart Johnsson, Ching-Tien Ho:
Algorithms for Matrix Transposition on Boolean n-Cube Configured Ensemble Architectures. ICPP 1987: 621-629 - 1986
- [c1]Ching-Tien Ho, S. Lennart Johnsson:
Distributed Routing Algorithms for Broadcasting and Personalized Communication in Hypercubes. ICPP 1986: 640-648
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 2023-10-02 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint