default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael (Shan-Hui) Ho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j8]Minyi Guo, Weng-Long Chang, Bo Jiang, Shu-Chien Huang
, Sien-Tang Tsai, Michael (Shan-Hui) Ho:
Communication-free data alignment for arrays with exponential references in parallelizing compilers for scalable parallel systems. J. Supercomput. 60(1): 4-30 (2012)- [j7]Weng-Long Chang, Kawuu Weicheng Lin, Ju-Chin Chen, Chih-Chiang Wang, Lai Chin Lu, Minyi Guo, Michael (Shan-Hui) Ho:
Molecular solutions of the RSA public-key cryptosystem on a DNA-based computer. J. Supercomput. 61(3): 642-672 (2012) - 2011
- [j6]Weng-Long Chang, Shu-Chien Huang, Kawuu Weicheng Lin, Michael (Shan-Hui) Ho:
Fast parallel DNA-based algorithms for molecular computation: discrete logarithm. J. Supercomput. 56(2): 129-163 (2011) - 2010
- [c6]Michael (Shan-Hui) Ho, Kun-Yu Hung, Chaochang Chiu:
Constructing molecular parallel subtractor and modular with basic bio-logic operations in the Adleman-Lipton model. BIC-TA 2010: 213-218
2000 – 2009
- 2007
- [i1]Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo:
Constructing Bio-molecular Databases on a DNA-based Computer. CoRR abs/0712.1863 (2007) - 2006
- [j5]Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo, Chengfei Liu:
Fast parallel bio-molecular solutions: the set-basis problem. Int. J. Comput. Sci. Eng. 2(1/2): 72-80 (2006) - 2005
- [c5]Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo, Xiaohong Jiang, Jingling Xue, Minglu Li:
Fast Parallel DNA-Based Algorithms for Molecular Computation: Determining a Prime Number. ICITA (1) 2005: 447-452 - [c4]Weng-Long Chang, Minyi Guo, Michael (Shan-Hui) Ho, Sien-Tang Tsai:
Communication-Free Data Alignment for Arrays with Exponential References Using Elementary Linear Algebra. ISPA 2005: 454-466 - 2004
- [j4]Weng-Long Chang, Minyi Guo, Michael (Shan-Hui) Ho:
Towards solution of the set-splitting problem on gel-based DNA computing. Future Gener. Comput. Syst. 20(5): 875-885 (2004) - [j3]Michael (Shan-Hui) Ho, Weng-Long Chang, Minyi Guo, Laurence Tianruo Yang:
Fast Parallel Solution for Set-Packing and Clique Problems by DNA-Based Computing. IEICE Trans. Inf. Syst. 87-D(7): 1782-1788 (2004) - [j2]Weng-Long Chang, Chih-Ping Chu, Michael (Shan-Hui) Ho:
Exploitation of parallelism to nested loops with dependence cycles. J. Syst. Archit. 50(12): 729-742 (2004) - [j1]Minyi Guo, Michael (Shan-Hui) Ho, Weng-Long Chang:
Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing. Parallel Comput. 30(9-10): 1109-1125 (2004) - [c3]Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo:
Fast Parallel Molecular Algorithms for DNA-based Computation: Factoring Integers. BIBE 2004: 125-133 - 2003
- [c2]Michael (Shan-Hui) Ho, Weng-Long Chang, Minyi Guo:
Molecular Fast Solution for Set-basis Problem on Sticker-based Model. ICPP Workshops 2003: 205-212 - [c1]Weng-Long Chang, Minyi Guo, Michael (Shan-Hui) Ho:
Solving the Set-Splitting Problem in Sticker-Based Model and the Adleman-Lipton Model. ISPA 2003: 185-196
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 2024-04-25 05:51 CEST 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:
