default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjay V. Rajopadhye
- > Home > Persons > Sanjay V. Rajopadhye
Publications
- 2020
[j28]Nirmal Prajapati
, Sanjay V. Rajopadhye, Hristo N. Djidjev, Nandakishore Santhi, Tobias Grosser, Rumen Andonov:
Optimization Approach to Accelerator Codesign. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(6): 1300-1313 (2020)- 2017
- [c72]Nirmal Prajapati, Waruna Ranasinghe, Sanjay V. Rajopadhye, Rumen Andonov, Hristo N. Djidjev, Tobias Grosser:
Simple, Accurate, Analytical Time Modeling and Optimal Tile Size Selection for GPGPU Stencils. PPoPP 2017: 163-177 - [i3]Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev, Nandakishore Santhi, Tobias Grosser, Rumen Andonov:
Accelerator Codesign as Non-Linear Optimization. CoRR abs/1712.04892 (2017) - 2015
- [c70]Nirmal Prajapati, Waruna Ranasinghe, Vamshi Tandrapati, Rumen Andonov, Hristo N. Djidjev, Sanjay V. Rajopadhye:
Energy Modeling and Optimization for Tiled Nested-Loop Codes. IPDPS Workshops 2015: 888-895 - 2003
- [j20]Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal Semi-Oblique Tiling. IEEE Trans. Parallel Distributed Syst. 14(9): 944-960 (2003) - 2001
- [c33]Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal semi-oblique tiling. SPAA 2001: 153-162 - 2000
- [j19]Rumen Andonov, Vincent Poirriez, Sanjay V. Rajopadhye:
Unbounded knapsack problem: Dynamic programming revisited. Eur. J. Oper. Res. 123(2): 394-407 (2000) - 1998
- [c28]Rumen Andonov, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal Orthogonal Tiling. Euro-Par 1998: 480-490 - 1997
- [j15]Rumen Andonov, Sanjay V. Rajopadhye:
Optimal Orthogonal Tiling of 2-D Iterations. J. Parallel Distributed Comput. 45(2): 159-165 (1997) - [j11]Rumen Andonov, Sanjay V. Rajopadhye:
Knapsack on VLSI: from Algorithm to Optimal Circuit. IEEE Trans. Parallel Distributed Syst. 8(6): 545-561 (1997) - 1996
- [c24]Rumen Andonov, Hafid Bourzoufi, Sanjay V. Rajopadhye:
Two-dimensional orthogonal tiling: from theory to practice. HiPC 1996: 225-231 - [c23]Florent de Dinechin, Doran Wilde, Sanjay V. Rajopadhye, Rumen Andonov:
A Regular VLSI Array for an Irregular Algorithm. IRREGULAR 1996: 195-200 - 1995
- [j9]Rumen Andonov, Patrice Quinton, Sanjay V. Rajopadhye, Doran Wilde:
A Shift Registered-Based Systolic Array for the Unbounded Knapsack Problem. Parallel Process. Lett. 5: 251-262 (1995) - 1994
- [c18]Rumen Andonov, Sanjay V. Rajopadhye:
A sparse knapsack algo-tech-cuit and its synthesis. ASAP 1994: 302-313 - [c17]Rumen Andonov, Sanjay V. Rajopadhye:
Optimal Tile Sizing. CONPAR 1994: 701-712 - [c16]Rumen Andonov, Patrice Quinton, Sanjay V. Rajopadhye, Doran Wilde:
Pure Systolic Array for a Class of Dynamic Dependency Recurrences. Parcella 1994: 207-214 - 1993
- [c15]Rumen Andonov, Sanjay V. Rajopadhye:
An optimal algo-tech-cuit for the knapsack problem. ASAP 1993: 548-559
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-08-05 21:23 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:
