default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaurabh N. Adya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c11]Love Singhal, Mahesh A. Iyer
, Saurabh N. Adya:
LSC: A Large-Scale Consensus-Based Clustering Algorithm for High-Performance FPGAs. DAC 2017: 30:1-30:6- [c10]Shounak Dhar, Mahesh A. Iyer, Saurabh N. Adya, Love Singhal, Nikolay Rubanov, David Z. Pan:
An Effective Timing-Driven Detailed Placement Algorithm for FPGAs. ISPD 2017: 151-157 - 2016
- [c9]Shounak Dhar, Saurabh N. Adya, Love Singhal, Mahesh A. Iyer, David Z. Pan:
Detailed placement for modern FPGAs using 2D dynamic programming. ICCAD 2016: 9
2000 – 2009
- 2008
- [r1]Saurabh N. Adya, Xiaojian Yang:
Congestion-Driven Physical Design. Handbook of Algorithms for Physical Design Automation 2008 - 2006
- [j5]Saurabh N. Adya, Igor L. Markov, Paul G. Villarrubia:
On whitespace and stability in physical synthesis. Integr. 39(4): 340-362 (2006) - [j4]Jarrod A. Roy, Saurabh N. Adya, David A. Papa, Igor L. Markov:
Min-cut floorplacement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(7): 1313-1326 (2006) - 2005
- [j3]Saurabh N. Adya, Igor L. Markov:
Combinatorial techniques for mixed-size placement. ACM Trans. Design Autom. Electr. Syst. 10(1): 58-90 (2005) - [c8]Hayward H. Chan, Saurabh N. Adya, Igor L. Markov:
Are floorplan representations important in digital design? ISPD 2005: 129-136 - [c7]Jarrod A. Roy, David A. Papa, Saurabh N. Adya, Hayward H. Chan, Aaron N. Ng, James F. Lu, Igor L. Markov:
Capo: robust and scalable open-source min-cut floorplacer. ISPD 2005: 224-226 - 2004
- [b1]Saurabh N. Adya:
Unification of VLSI placement and floorplanning. University of Michigan, USA, 2004 - [j2]Saurabh N. Adya, Mehmet Can Yildiz, Igor L. Markov, Paul Villarrubia, Phiroze N. Parakh, Patrick H. Madden:
Benchmarking for large-scale placement and beyond. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(4): 472-487 (2004) - [c6]David A. Papa, Saurabh N. Adya, Igor L. Markov:
Constructive benchmarking for placement. ACM Great Lakes Symposium on VLSI 2004: 113-118 - [c5]Saurabh N. Adya, S. Chaturvedi, Jarrod A. Roy, David A. Papa, Igor L. Markov:
Unification of partitioning, placement and floorplanning. ICCAD 2004: 550-557 - 2003
- [j1]Saurabh N. Adya, Igor L. Markov:
Fixed-outline floorplanning: enabling hierarchical design. IEEE Trans. Very Large Scale Integr. Syst. 11(6): 1120-1135 (2003) - [c4]Saurabh N. Adya, Igor L. Markov, Paul Villarrubia:
On Whitespace and Stability in Mixed-Size Placement and Physical Synthesis. ICCAD 2003: 311-319 - [c3]Saurabh N. Adya, Mehmet Can Yildiz, Igor L. Markov, Paul Villarrubia, Phiroze N. Parakh, Patrick H. Madden:
Benchmarking for large-scale placement and beyond. ISPD 2003: 95-103 - 2002
- [c2]Saurabh N. Adya, Igor L. Markov:
Consistent placement of macro-blocks using floorplanning and standard-cell placement. ISPD 2002: 12-17 - 2001
- [c1]Saurabh N. Adya, Igor L. Markov:
Fixed-outline Floorplanning through Better Local Search. ICCD 2001: 328-334
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-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:
