default search action
Min Xie 0004
Person information
- affiliation: University of California at Los Angeles (UCLA), Los Angeles, CA, USA
Other persons with the same name
- Min Xie — disambiguation page
- Min Xie 0001
— National University of Singapore, Singapore (and 2 more)
- Min Xie 0002
- Min Xie 0003 — Ministry of Education, Xidian University, Xi'an, China
- Min Xie 0005 — University College London, Suffolk, UK (and 1 more)
- Min Xie 0006
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i1]Jason Cong, Michalis Romesis, Joseph R. Shinnerl, Kenton Sze, Min Xie:
Locality and Utilization in Placement Suboptimality. CoRR abs/2305.16413 (2023)
2000 – 2009
- 2008
- [j5]Jason Cong, Min Xie:
A Robust Mixed-Size Legalization and Detailed Placement Algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(8): 1349-1362 (2008) - 2007
- [j4]Chen Li, Min Xie, Cheng-Kok Koh, Jason Cong, Patrick H. Madden:
Routability-Driven Placement and White Space Allocation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(5): 858-871 (2007) - [p2]Jason Cong, Michalis Romesis, Joseph R. Shinnerl, Kenton Sze, Min Xie:
Locality and Utilization in Placement Suboptimality. Modern Circuit Placement 2007: 13-36 - [p1]Tony F. Chan, Kenton Sze, Joseph R. Shinnerl, Min Xie:
mPL6: Enhanced Multilevel Mixed-Size Placement with Congestion Control. Modern Circuit Placement 2007: 247-288 - 2006
- [c9]Jason Cong, Min Xie:
A robust detailed placement for mixed-size IC designs. ASP-DAC 2006: 188-194 - [c8]Tony F. Chan, Jason Cong, Joseph R. Shinnerl, Kenton Sze, Min Xie:
mPL6: enhanced multilevel mixed-size placement. ISPD 2006: 212-214 - 2005
- [j3]Jason Cong, Jie Fang, Min Xie, Yan Zhang:
MARS-a multilevel full-chip gridless routing system. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(3): 382-394 (2005) - [j2]Jason Cong, Joseph R. Shinnerl, Min Xie, Tim Kong, Xin Yuan:
Large-scale circuit placement. ACM Trans. Design Autom. Electr. Syst. 10(2): 389-430 (2005) - [c7]Tony F. Chan, Jason Cong, Michail Romesis, Joseph R. Shinnerl, Kenton Sze, Min Xie:
mPL6: a robust multilevel mixed-size placement engine. ISPD 2005: 227-229 - 2004
- [j1]Chin-Chih Chang, Jason Cong, Michail Romesis, Min Xie:
Optimality and scalability study of existing placement algorithms. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(4): 537-549 (2004) - [c6]Chen Li, Min Xie, Cheng-Kok Koh, Jason Cong, Patrick H. Madden:
Routability-driven placement and white space allocation. ICCAD 2004: 394-401 - 2003
- [c5]Chin-Chih Chang, Jason Cong, Min Xie:
Optimality and scalability study of existing placement algorithms. ASP-DAC 2003: 621-627 - [c4]Jason Cong, Michail Romesis, Min Xie:
Optimality and Stability Study of Timing-Driven Placement Algorithms. ICCAD 2003: 472-479 - [c3]Jason Cong, Tim Kong, Joseph R. Shinnerl, Min Xie, Xin Yuan:
Large-Scale Circuit Placement: Gap and Promise. ICCAD 2003: 883-890 - [c2]Jason Cong, Michail Romesis, Min Xie:
Optimality, scalability and stability study of partitioning and placement algorithms. ISPD 2003: 88-94 - 2002
- [c1]Jason Cong, Min Xie, Yan Zhang:
An enhanced multilevel routing system. ICCAD 2002: 51-58
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-11-13 23:52 CET 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: