default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiang-Fang Chao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j5]Liang-Fang Chao, Andrea S. LaPaugh:
Finding All Minimal Shapes in a Routing Channel. Algorithmica 21(2): 211-244 (1998)- 1997
- [j4]Nelson L. Passos, Edwin Hsing-Mean Sha, Liang-Fang Chao:
Multidimensional interleaving for synchronous circuit design optimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(2): 146-159 (1997) - [j3]Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha:
Rotation scheduling: a loop pipelining algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(3): 229-239 (1997) - [j2]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Scheduling Data-Flow Graphs via Retiming and Unfolding. IEEE Trans. Parallel Distributed Syst. 8(12): 1259-1267 (1997) - [c19]Prasoon Surti, Liang-Fang Chao, Akhilesh Tyagi:
Low power FSM design using Huffman-style encoding. ED&TC 1997: 521-525 - 1996
- [c18]Jian-Feng Shi, Liang-Fang Chao:
Resource-Constrained Algebraic Transformation for Loop Pipelining. Great Lakes Symposium on VLSI 1996: 14-17 - [c17]Lakshmikant Bhupathi, Liang-Fang Chao:
Dichotomy-based Model for FSM Power Minimization. ICCD 1996: 390-395 - 1995
- [j1]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Static scheduling for synthesis of DSP algorithms on various models. J. VLSI Signal Process. 10(3): 207-223 (1995) - [c16]Nelson L. Passos, Edwin Hsing-Mean Sha, Liang-Fang Chao:
Optimizing synchronous systems for multi-dimensional applications. ED&TC 1995: 54-59 - [c15]Jayesh Siddhiwala, Liang-Fang Chao:
Scheduling conditional data-flow graphs with resource sharing. Great Lakes Symposium on VLSI 1995: 94- - [c14]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Rate-optimal scheduling for cyclo-static and periodic schedules. ICASSP 1995: 3231-3234 - [c13]Nelson L. Passos, Edwin Hsing-Mean Sha, Liang-Fang Chao:
Multi-dimensional interleaving for time-and-memory design optimization. ICCD 1995: 440-445 - [c12]Nelson L. Passos, Edwin Hsing-Mean Sha, Liang-Fang Chao:
Memory Efficient Fully Parallel Nested Loop Pipelining. ICPP (2) 1995: 182-185 - [c11]Jayesh Siddhiwala, Liang-Fang Chao:
Path-Based Task Replication for Scheduling with Communication Costs. ICPP (2) 1995: 186-190 - 1994
- [c10]Liang-Fang Chao:
Optimizing cyclic data-flow graphs via associativity. Great Lakes Symposium on VLSI 1994: 6-10 - [c9]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Retiming and Clock Skew for Synchronous Systems. ISCAS 1994: 283-286 - 1993
- [c8]Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha:
Rotation Scheduling: A Loop Pipelining Algorithm. DAC 1993: 566-572 - [c7]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Rate-optimal static scheduling for DSP data-flow programs. Great Lakes Symposium on VLSI 1993: 80-84 - [c6]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Efficient retiming and unfolding. ICASSP (1) 1993: 421-424 - [c5]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Unified Static Scheduling on Various Models. ICPP (2) 1993: 231-235 - [c4]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Static Scheduling of Uniform Nested Loops. IPPS 1993: 254-258 - 1992
- [c3]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Unfolding and retiming data-flow DSP programs for RISC multiprocessor scheduling. ICASSP 1992: 565-568 - [c2]Liang-Fang Chao, Edwin Hsing-Mean Sha:
Retiming and Unfolding Data-Flow Graphs. ICPP (2) 1992: 33-40 - 1991
- [c1]Edwin Hsing-Mean Sha, Liang-Fang Chao:
Design for Easily Applying Test Vectors to Improve Delay Fault Coverage. ICCAD 1991: 500-503
Coauthor Index
aka: Edwin Hsing-Mean Sha
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:53 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:
