![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Chuen-Liang Chen
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c9]I-Chen Wu, Chang-Shing Lee
, Shun-Chin Hsu, Vincenzo Loia, Yaochu Jin
, Chuan-Kang Ting, Shi-Jim Yen, Yung-Gi Wu, Mong-Fong Horng, Chuen-Liang Chen:
General chairs and program chairs message. TAAI 2015: 13-14 - 2012
- [j7]Chien-Chih Chen, Kai-Hsiang Yang, Chuen-Liang Chen, Jan-Ming Ho:
BibPro: A Citation Parser Based on Sequence Alignment. IEEE Trans. Knowl. Data Eng. 24(2): 236-250 (2012) - [c8]Yu-Jung Chang, Chien-Chih Chen, Jan-Ming Ho, Chuen-Liang Chen:
De Novo Assembly of High-Throughput Sequencing Data with Cloud Computing and New Operations on String Graphs. IEEE CLOUD 2012: 155-161 - 2011
- [j6]Chun-Chieh Lin, Chuen-Liang Chen:
Cache Sensitive Code Arrangement for Virtual Machine. Trans. High Perform. Embed. Archit. Compil. 3: 24-42 (2011) - 2010
- [c7]Lendle Tseng, Yue-Sun Kuo, Hsiu-Hui Lee, Chuen-Liang Chen:
XUIB: XML to user interface binding. ACM Symposium on Document Engineering 2010: 51-60
2000 – 2009
- 2008
- [c6]Chun-Chieh Lin, Chuen-Liang Chen:
Object Placement for Fully Associative Cache. EUC (2) 2008: 480-485 - [c5]Chun-Chieh Lin, Chuen-Liang Chen:
Code Arrangement of Embedded Java Virtual Machine for NAND Flash Memory. HiPEAC 2008: 369-383 - 2005
- [j5]Wen-Yang Lin, Chuen-Liang Chen:
On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations. SIAM J. Matrix Anal. Appl. 27(1): 24-45 (2005) - 2000
- [j4]Wen-Yang Lin, Chuen-Liang Chen:
On evaluating elimination tree based parallel sparse cholesky factorizations. Int. J. Comput. Math. 74(3): 361-377 (2000) - [c4]Wen-Yang Lin, Chuen-Liang Chen:
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations. IPDPS 2000: 799-806
1990 – 1999
- 1999
- [c3]Tsung-Tso Kan, Chuen-Liang Chen:
Processor Allocation and Task Scheduling to Minimize Ditributed Sparse Cholesky Faxtorization Time. HPCN Europe 1999: 1292-1295 - 1994
- [j3]Wen-Yang Lin, Chuen-Liang Chen:
A Parallel Algorithm for Solving Tridiagonal Linear Systems on Distributed-Memory Multiprocessors. Int. J. High Speed Comput. 6(3): 375-386 (1994) - 1993
- [c2]Wen-Yang Lin, Chuen-Liang Chen:
Minimum Completion Time Criterion for Parallel Sparse Cholesky Factorization. ICPP (3) 1993: 107-114 - 1991
- [j2]Biing-Feng Wang, Chuen-Liang Chen, Gen-Huey Chen:
A Simple Approach to Implementing Multiplication with Small Tables. Inf. Process. Lett. 37(6): 327-329 (1991)
1980 – 1989
- 1989
- [c1]Chuen-Liang Chen, Chung-Kai Liao:
Analysis of Vector Access Performance on Skewed Interleaved Memory. ISCA 1989: 387-394 - 1986
- [j1]Chuen-Liang Chen, Min-Wen Du:
Multiple Stuck-Fault Detection and Location in Multivalued Linear Circuits. IEEE Trans. Computers 35(12): 1068-1071 (1986)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint