default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFook-Luen Heng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j2]Fook-Luen Heng, Ke Zhang, Aanchal Goyal, Harsh Chaudhary, Steven Hirsch, Younghun Kim, Mark A. Lavin, Abhishek Raman:
Integrated analytics system for electric industry asset management. IBM J. Res. Dev. 60(1) (2016)- [j1]Amith Singhee, Ulrich Finkler, Steven Hirsch, Mark A. Lavin, Fook-Luen Heng, Ashok Pon Kumar, Jun Mei Qu, Etienne Pelletier:
A platform for the next generation of smarter energy applications. IBM J. Res. Dev. 60(1) (2016) - 2015
- [c12]Amith Singhee, Mark A. Lavin, Ulrich Finkler, Fook-Luen Heng, Jun Mei Qu, Steven Hirsch:
HAMS: A Memory-Efficient Representation of Power Grids Using Hierarchical and Multi-Scenario Graphs. e-Energy 2015: 171-178
2000 – 2009
- 2009
- [c11]Aditya Bansal, Rama N. Singh, Rouwaida Kanj, Saibal Mukhopadhyay, Jin-Fuw Lee, Emrah Acar, Amith Singhee, Keunwoo Kim, Ching-Te Chuang, Sani R. Nassif, Fook-Luen Heng, Koushik K. Das:
Yield estimation of SRAM circuits using "Virtual SRAM Fab". ICCAD 2009: 631-636 - 2008
- [c10]Aditya Bansal, Rama N. Singh, Saibal Mukhopadhyay, Geng Han, Fook-Luen Heng, Ching-Te Chuang:
Pre-Si estimation and compensation of SRAM layout deficiencies to achieve target performance and yield. ICCD 2008: 457-462 - 2005
- [c9]Chung-Kuan Cheng, Steve Lin, Andrew B. Kahng, Keh-Jeng Chang, Vijay Pitchumani, Toshiyuki Shibuya, Roberto Suaya, Zhiping Yu, Fook-Luen Heng, Don MacMillen:
Panel I: who is responsible for the design for manufacturability issues in the era of nano-technologies? ASP-DAC 2005 - [c8]Xin Yuan, Kevin W. McCullen
, Fook-Luen Heng, Robert F. Walker, Jason Hibbeler, Robert J. Allen, Rani R. Narayan:
Technology migration technique for designs with strong RET-driven layout restrictions. ISPD 2005: 175-182 - 2004
- [c7]Puneet Gupta, Fook-Luen Heng:
Toward a systematic-variation aware timing methodology. DAC 2004: 321-326 - [c6]Alexey Lvov, Fook-Luen Heng:
A graph based simplex method for the integer minimum perturbation problem with sum and difference constraints. ACM Great Lakes Symposium on VLSI 2004: 67-72 - [c5]Mark A. Lavin, Fook-Luen Heng, Gregory A. Northrop:
Backend CAD flows for "restrictive design rules". ICCAD 2004: 739-746 - 2001
- [c4]Lars Liebmann, Jennifer Lund, Fook-Luen Heng, Ioana Graur:
Enabling Alternating Phase Shifted Mask Designs for a Full Logic Gate Level: Design Rules and Design Rule Checking. DAC 2001: 79-84 - [c3]Fook-Luen Heng, Lars Liebmann, Jennifer Lund:
Application of automated design migration to alternating phase shift mask design. ISPD 2001: 38-43
1990 – 1999
- 1998
- [c2]Zhan Chen, Fook-Luen Heng:
A Fast Minimum Layout Perturbation Algorithm for Electromigration Reliability Enhancement. DFT 1998: 56-63 - 1997
- [c1]Fook-Luen Heng, Zhan Chen, Gustavo E. Téllez:
A VLSI artwork legalization technique based on a new criterion of minimum layout perturbation. ISPD 1997: 116-121
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-10-07 21:18 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:
