![](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
Youxin Gao
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
- 2005
- [c12]Muzhou Shao, Youxin Gao, Li-Pen Yuan, Hung-Ming Chen, Martin D. F. Wong
:
Current Calculation on VLSI Signal Interconnects. ISQED 2005: 580-585 - [c11]Muzhou Shao, Youxin Gao, Li-Pen Yuan, Martin D. F. Wong
:
IR Drop and Ground Bounce Awareness Timing Model. ISVLSI 2005: 226-231 - 2003
- [j4]Li-Da Huang, Minghorng Lai, Martin D. F. Wong
, Youxin Gao:
Maze routing with buffer insertion under transition time constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(1): 91-95 (2003) - [c10]Muzhou Shao, D. F. Wong
, Youxin Gao, Huijing Cao, Li-Pen Yuan:
A fast and accurate method for interconnect current calculation. ASP-DAC 2003: 37-42 - [c9]Muzhou Shao, Martin D. F. Wong
, Huijing Cao, Youxin Gao, Li-Pen Yuan, Li-Da Huang, Seokjin Lee:
Explicit gate delay model for timing evaluation. ISPD 2003: 32-38 - 2002
- [c8]Li-Da Huang, Minghorng Lai, D. F. Wong
, Youxin Gao:
Maze Routing with Buffer Insertion under Transition Time Constraints. DATE 2002: 702-707 - [c7]Muzhou Shao, D. F. Wong
, Youxin Gao, Li-Pen Yuan, Huijing Cao:
Shaping interconnect for uniform current density. ICCAD 2002: 254-259 - 2001
- [c6]Youxin Gao, D. F. Wong
:
A fast and accurate delay estimation method for buffered interconnects. ASP-DAC 2001: 533-538 - [c5]Youxin Gao, D. F. Wong
:
A graph based algorithm for optimal buffer insertion under accurate delay models. DATE 2001: 535-539 - 2000
- [c4]Youxin Gao, D. F. Wong
:
Wire-Sizing for Delay Minimization and Ringing Control Using Transmission Line Model. DATE 2000: 512-516
1990 – 1999
- 1999
- [j3]Youxin Gao, D. F. Wong
:
Shaping a VLSI wire to minimize Elmore delay with consideration of coupling capacitance. Integr. 27(2): 165-178 (1999) - [j2]Youxin Gao, Martin D. F. Wong
:
Optimal shape function for a bidirectional wire under Elmore delay model. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(7): 994-999 (1999) - [j1]Youxin Gao, Martin D. F. Wong
:
Wire-sizing optimization with inductance consideration using transmission-line model. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(12): 1759-1767 (1999) - [c3]Youxin Gao, D. F. Wong
:
Optimal Wire Shape with Consideration of Coupling Capacitance under Elmore Delay Model. ASP-DAC 1999: 217-220 - 1998
- [c2]Youxin Gao, D. F. Wong
:
Shaping a VLSI wire to minimize delay using transmission line model. ICCAD 1998: 611-616 - 1997
- [c1]Youxin Gao, D. F. Wong
:
Optimal shape function for a bi-directional wire under Elmore delay model. ICCAD 1997: 622-627
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:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint