default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew A. Kennings
- > Home > Persons > Andrew A. Kennings
Publications
- 2020
[j12]Aysa Fakheri Tabrizi
, Nima Karimpour Darav, Logan Rakai, Ismail Bustany, Andrew A. Kennings, Laleh Behjat:
Eh?Predictor: A Deep Learning Framework to Identify Detailed Routing Short Violations From a Placed Netlist. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(6): 1177-1190 (2020)- 2018
- [j11]Nima Karimpour Darav, Ismail S. Bustany, Andrew A. Kennings, David T. Westwick, Laleh Behjat:
Eh?Legalizer: A High Performance Standard-Cell Legalizer Observing Technology Constraints. ACM Trans. Design Autom. Electr. Syst. 23(4): 43:1-43:25 (2018) - [c35]Aysa Fakheri Tabrizi, Nima Karimpour Darav, Shuchang Xu, Logan Rakai, Ismail Bustany, Andrew A. Kennings, Laleh Behjat:
A machine learning framework to identify detailed routing short violations from a placed netlist. DAC 2018: 48:1-48:6 - 2017
- [c33]Nima Karimpour Darav, Ismail S. Bustany, Andrew A. Kennings, Laleh Behjat:
A Fast, Robust Network Flow-based Standard-Cell Legalization Method for Minimizing Maximum Movement. ISPD 2017: 141-148 - [c32]Aysa Fakheri Tabrizi, Nima Karimpour Darav, Logan Rakai, Andrew A. Kennings, Laleh Behjat:
Detailed routing violation prediction during placement using machine learning. VLSI-DAT 2017: 1-4 - 2016
- [j10]Nima Karimpour Darav, Andrew A. Kennings, Aysa Fakheri Tabrizi, David T. Westwick, Laleh Behjat:
Eh?Placer: A High-Performance Modern Technology-Driven Placer. ACM Trans. Design Autom. Electr. Syst. 21(3): 37:1-37:27 (2016) - [c31]Jucemar Monteiro, Nima Karimpour Darav, Guilherme Flach, Mateus Fogaça, Ricardo Augusto da Luz Reis, Andrew A. Kennings, Marcelo O. Johann, Laleh Behjat:
Routing-Aware Incremental Timing-Driven Placement. ISVLSI 2016: 290-295 - 2015
- [c28]Nima Karimpour Darav, Andrew A. Kennings, David T. Westwick, Laleh Behjat:
High Performance Global Placement and Legalization Accounting for Fence Regions. ICCAD 2015: 514-519 - [c27]Aysa Fakheri Tabrizi, Nima Karimpour Darav, Logan M. Rakai, Andrew A. Kennings, William Swartz, Laleh Behjat:
A Detailed Routing-Aware Detailed Placement Technique. ISVLSI 2015: 38-43 - [c26]Nima Karimpour Darav, Amin Farshidi, Aysa Fakheri Tabrizi, Emily Marasco, Amir Karbalaei, Andrew A. Kennings, Ismail S. Bustany, Laleh Behjat:
The impact of industry-organized contests on EDA education. MSE 2015: 21-24 - 2014
- [c24]Andrew A. Kennings, Nima Karimpour Darav, Laleh Behjat:
Detailed placement accounting for technology constraints. VLSI-SoC 2014: 1-6 - 2007
- [j5]Jianhua Li, Laleh Behjat, Andrew A. Kennings:
Net Cluster: A Net-Reduction-Based Clustering Preprocessing Algorithm for Partitioning and Placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(4): 669-679 (2007) - [c11]Kristofer Vorwerk, Andrew A. Kennings, Doris T. Chen, Laleh Behjat:
Floorplan repair using dynamic whitespace management. ACM Great Lakes Symposium on VLSI 2007: 552-557
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:15 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:
