default search action
Vijay Sundararajan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [r2]Vijay Sundararajan:
Gate Sizing. Encyclopedia of Algorithms 2016: 811-814
2000 – 2009
- 2008
- [c14]Vikram Chandrasekhar, Zukang Shen, Vijay Sundararajan:
Optimal power allocation for sum capacity of a slotted three-cell system. ICASSP 2008: 3161-3164 - [r1]Vijay Sundararajan:
Gate Sizing. Encyclopedia of Algorithms 2008 - 2004
- [j4]Vijay Sundararajan, Sachin S. Sapatnekar
, Keshab K. Parhi
A new approach for integration of min-area retiming and min-delay padding for simultaneously addressing short-path and long-path constraints. ACM Trans. Design Autom. Electr. Syst. 9(3): 273-289 (2004) - 2003
- [j3]Vijay Sundararajan, Keshab K. Parhi
Synthesis of minimum-area folded architectures for rectangular multidimensional multirate DSP systems. IEEE Trans. Signal Process. 51(7): 1954-1965 (2003) - 2002
- [j2]Vijay Sundararajan, Sachin S. Sapatnekar
Fast and exact transistor sizing based on iterative relaxation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(5): 568-581 (2002) - 2001
- [j1]Michael E. Zervakis, Vijay Sundararajan, Keshab K. Parhi
Vector processing of wavelet coefficients for robust image denoising. Image Vis. Comput. 19(7): 435-450 (2001) - [c13]Imed Ben Dhaou
Energy efficient signaling in DSM CMOS technology. ISCAS (5) 2001: 411-414 - [c12]Imed Ben Dhaou
Energy Efficient Signaling in Deep Submicron CMOS Technology. ISQED 2001: 319-324 - 2000
- [c11]Vijay Sundararajan, Keshab K. Parhi
Synthesis of low power folded programmable coefficient FIR digital filters (short paper). ASP-DAC 2000: 153-156 - [c10]Vijay Sundararajan, Keshab K. Parhi
Data transmission over a bus with peak-limited transition activity. ASP-DAC 2000: 221-224 - [c9]Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K. Parhi
MINFLOTRANSIT: min-cost flow based transistor sizing tool. DAC 2000: 649-664 - [c8]Vijay Sundararajan, Keshab K. Parhi
Reducing bus transition activity by limited weight coding with codeword slimming. ACM Great Lakes Symposium on VLSI 2000: 13-16 - [c7]Vijay Sundararajan, Keshab K. Parhi
A novel multiply multiple accumulator component for low power PDSP design. ICASSP 2000: 3247-3250
1990 – 1999
- 1999
- [c6]Vijay Sundararajan, Keshab K. Parhi
Low Power Gate Resizing of Combinational Circuits by Buffer-Redistribution. ARVLSI 1999: 170-185 - [c5]Vijay Sundararajan, Keshab K. Parhi
Synthesis of Low Power CMOS VLSI Circuits Using Dual Supply Voltages. DAC 1999: 72-75 - [c4]Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K. Parhi:
Marsh: min-area retiming with setup and hold constraints. ICCAD 1999: 2-6 - [c3]Vijay Sundararajan, Keshab K. Parhi
Low power synthesis of dual threshold voltage CMOS VLSI circuits. ISLPED 1999: 139-144 - 1998
- [c2]Vijay Sundararajan, Keshab K. Parhi
Synthesis of folded, pipelined architectures for multi-dimensional multirate systems. ICASSP 1998: 3089-3092 - 1997
- [c1]Michael E. Zervakis, Vijay Sundararajan, Keshab K. Parhi
A Wavelet-Domain Algorithm for Denoising in the Presence of Noise Outliers. ICIP (1) 1997: 632-635
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-08-05 20:19 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: