![](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
Jesse Zhixi Fang
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
2000 – 2009
- 2004
- [c9]Jesse Zhixi Fang:
A Generation Ahead of Microprocessor: Where Software Can Drive uArchitecture To? Asia-Pacific Computer Systems Architecture Conference 2004: 270
1990 – 1999
- 1998
- [c8]Rajiv Gupta
, David A. Berson, Jesse Zhixi Fang:
Path Profile Guided Partial Redundancy Elimination Using Speculation. ICCL 1998: 230-239 - 1997
- [j5]Sarita V. Adve, Doug Burger, Rudolf Eigenmann, Alasdair Rawsthorne, Michael D. Smith, Catherine H. Gebotys, Mahmut T. Kandemir, David J. Lilja, Alok N. Choudhary, Jesse Zhixi Fang, Pen-Chung Yew
:
Changing Interaction of Compiler and Architecture. Computer 30(12): 51-58 (1997) - [j4]Michael S. Schlansker, Thomas M. Conte, James C. Dehnert, Kemal Ebcioglu, Jesse Zhixi Fang, Carol L. Thompson:
Compilers for Instruction-Level Parallelism. Computer 30(12): 63-69 (1997) - [c7]Rajiv Gupta, David A. Berson, Jesse Zhixi Fang:
Path Profile Guided Partial Dead Code Elimation Using Predication. IEEE PACT 1997: 102- - [c6]Rajiv Gupta
, David A. Berson, Jesse Zhixi Fang:
Resource-Sensitive Profile-Directed Data Flow Analysis for Code Optimization. MICRO 1997: 358-368 - 1996
- [j3]Hua Lin, Mi Lu, Jesse Zhixi Fang:
A direct approach for finding loop transformation matrices. J. Comput. Sci. Technol. 11(3): 237-256 (1996) - [c5]Jesse Zhixi Fang:
Compiler Algorithms on If-Conversion, Speculative Predicates Assignment and Predicated Code Optimizations. LCPC 1996: 135-153 - 1994
- [c4]Hua Lin, Mi Lu, Jesse Zhixi Fang:
A New Approach for Finding Loop Transformation Matrices. ICPADS 1994: 386-391 - 1993
- [j2]Jesse Zhixi Fang, Mi Lu:
An Iteration Partition Approach for Cache or Local Memory Thrashing on Parallel Processing. IEEE Trans. Computers 42(5): 529-546 (1993) - 1992
- [j1]Mi Lu, Jesse Zhixi Fang:
A Solution of the Cache Ping-Pong Problem in Multiprocessor Systems. J. Parallel Distributed Comput. 16(2): 158-171 (1992) - 1991
- [c3]Jesse Zhixi Fang, Mi Lu:
A Solution of Cache Ping-Pong Problem in RISC Based Parallel Processing Systems. ICPP (1) 1991: 238-245 - [c2]Jesse Zhixi Fang, Mi Lu:
An Iteration Partition Approach for Cache or Local Memory Thrashing on Parallel Processing. LCPC 1991: 313-327 - [c1]Hua Lin, Mi Lu, Jesse Zhixi Fang:
An optimal algorithm for the longest common subsequence problem. SPDP 1991: 630-639
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 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint