default search action
Fred C. Chow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c14]Hucheng Zhou, Wenguang Chen, Fred C. Chow:
An SSA-based algorithm for optimal speculative code motion under an execution profile. PLDI 2011: 98-108
2000 – 2009
- 2003
- [j3]Jack Liu, Fred C. Chow, Timothy Kong, Rupan Roy:
Variable Instruction Set Architecture and Its Compiler Support. IEEE Trans. Computers 52(7): 881-895 (2003) - 2002
- [c13]Jack Liu, Timothy Kong, Fred C. Chow:
Effective Compilation Support for Variable Instruction Set Architecture. IEEE PACT 2002: 56-67 - [c12]Jack Liu, Fred C. Chow:
A near-optimal instruction scheduler for a tightly constrained, variable instruction set embedded processor. CASES 2002: 9-18
1990 – 1999
- 1999
- [j2]Robert Kennedy, Sun Chan, Shin-Ming Liu, Raymond Lo, Peng Tu, Fred C. Chow:
Partial redundancy elimination in SSA form. ACM Trans. Program. Lang. Syst. 21(3): 627-676 (1999) - 1998
- [c11]Robert Kennedy, Fred C. Chow, Peter Dahl, Shin-Ming Liu, Raymond Lo, Mark Streich:
Strength Reduction via SSAPRE. CC 1998: 144-158 - [c10]Fred C. Chow, Robert Kennedy, Shin-Ming Liu, Raymond Lo, Peng Tu:
Register Promotion by Partial Redundancy Elimination of Loads and Stores. PLDI 1998: 26-37 - 1997
- [c9]Fred C. Chow, Sun Chan, Robert Kennedy, Shin-Ming Liu, Raymond Lo, Peng Tu:
A New Algorithm for Partial Redundancy Elimination based on SSA Form. PLDI 1997: 273-286 - 1996
- [c8]Shin-Ming Liu, Raymond Lo, Fred C. Chow:
Loop induction variable canonicalization in parallelizing compilers. IEEE PACT 1996: 228-237 - [c7]Fred C. Chow, Sun Chan, Shin-Ming Liu, Raymond Lo, Mark Streich:
Effective Representation of Aliases and Indirect Memory Operations in SSA Form. CC 1996: 253-267 - 1994
- [c6]Raymond Lo, Sun Chan, Fred C. Chow, Shin-Ming Liu:
Improving resource utilization of the MIPS R8000 via post-scheduling global instruction distribution. MICRO 1994: 148-152 - 1990
- [j1]Fred C. Chow, John L. Hennessy:
The Priority-Based Coloring Approach to Register Allocation. ACM Trans. Program. Lang. Syst. 12(4): 501-536 (1990)
1980 – 1989
- 1988
- [c5]Fred C. Chow:
Minimizing Register Usage Penalty at Procedure Calls. PLDI 1988: 85-94 - 1987
- [c4]Fred C. Chow, Steven Correll, Mark I. Himelstein, Earl Killian, Larry Weber:
How Many Addressing Modes are Enough? ASPLOS 1987: 117-121 - 1986
- [c3]Fred C. Chow, Mark I. Himelstein, Earl Killian, Larry Weber:
Engineering a RISC Compiler System. COMPCON 1986: 132-137 - 1984
- [c2]Fred C. Chow, John L. Hennessy:
Register allocation by priority-based coloring (with retrospective). Best of PLDI 1984: 91-103 - [c1]Fred C. Chow, John L. Hennessy:
Register allocation by priority-based coloring. SIGPLAN Symposium on Compiler Construction 1984: 222-232
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-24 23:14 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: