default search action
Gang Wu 0002
Person information
- affiliation: Synopsys, Inc., Hillsboro, OR, USA
- affiliation (PhD): Iowa State University, Department of Electrical and Computer Engineering, Ames, IA, USA
Other persons with the same name
- Gang Wu — disambiguation page
- Gang Wu 0001 — University of Electronic Science and Technology of China, National Key Lab of Science and Technology on Communications, Chengdu, China (and 3 more)
- Gang Wu 0003 — Nanjing University of Finance and Economics, Institute of Multimedia Computing Technology, China (and 1 more)
- Gang Wu 0004 — Nanjing University of Aeronautics and Astronautics, Center for More-Electric-Aircraft Power Systems, China
- Gang Wu 0005 — University of California at Santa Barbara, CA, USA
- Gang Wu 0006 — University of Chinese Academy of Sciences, School of Mathematical Sciences, Beijing, China
- Gang Wu 0007 — Northeastern University, School of Computer Science and Engineering, China (and 1 more)
- Gang Wu 0008 — Shanghai Jiao Tong University, China
- Gang Wu 0009 — China National Institute of Standardization, Beijing, China
- Gang Wu 0010 — Harbin Institute of Technology, School of Computer Science and Technology, Harbin, China
- Gang Wu 0011 — University of Science and Technology of China, Department of Automation, Hefei, China
- Gang Wu 0012 — Nokia, Wireless Modem System Research, Devices Research and Development, Shanghai, China (and 1 more)
- Gang Wu 0013 — Adobe Inc., Adobe Research, San Jose, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j2]Gang Wu, Chris Chu:
Two Approaches for Timing-Driven Placement by Lagrangian Relaxation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 36(12): 2093-2105 (2017) - [c6]Gang Wu, Chris Chu:
A Fast Incremental Cycle Ratio Algorithm. ISPD 2017: 75-82 - 2016
- [j1]Gang Wu, Chris Chu:
Detailed Placement Algorithm for VLSI Design With Double-Row Height Standard Cells. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35(9): 1569-1573 (2016) - [c5]Gang Wu, Yue Xu, Dean Wu, Manoj Ragupathy, Yu-Yen Mo, Chris C. N. Chu:
Flip-flop clustering by weighted K-means algorithm. DAC 2016: 82:1-82:6 - [c4]Gang Wu, Chris C. N. Chu:
Simultaneous slack matching, gate sizing and repeater insertion for asynchronous circuits. DATE 2016: 1042-1047 - 2015
- [c3]Gang Wu, Ankur Sharma, Chris C. N. Chu:
Gate Sizing and Vth Assignment for Asynchronous Circuits Using Lagrangian Relaxation. ASYNC 2015: 53-60 - [c2]Tao Lin, Chris C. N. Chu, Gang Wu:
POLAR 3.0: An Ultrafast Global Placement Engine. ICCAD 2015: 520-527 - 2014
- [c1]Gang Wu, Tao Lin, Hsin-Ho Huang, Chris Chu, Peter A. Beerel:
Asynchronous circuit placement by lagrangian relaxation. ICCAD 2014: 641-646
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-12-17 21:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint