![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Vinod Kumar Agrawal
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j8]A. N. Nagamani, Chirag Ramesh
, Vinod Kumar Agrawal:
Design of Optimized Reversible Squaring and Sum-of-Squares Units. Circuits Syst. Signal Process. 37(4): 1753-1776 (2018) - [j7]H. V. Jayashree, Sharan Patil, Vinod Kumar Agrawal:
Design Approaches for Resource and Performance Optimization of Reversible BCD Addition and Unified BCD Addition/Subtraction Circuits. J. Circuits Syst. Comput. 27(3): 1850048:1-1850048:28 (2018) - [j6]A. N. Nagamani
, S. N. Anuktha, N. Nanditha, Vinod Kumar Agrawal:
A Genetic Algorithm-Based Heuristic Method for Test Set Generation in Reversible Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(2): 324-336 (2018) - [c4]A. N. Nagamani, Vijetha Ravichander, Madhumita Harish, Vinod Kumar Agrawal:
DFT methodologies for testing k-CNOT, Fredkin and Peres based reversible circuits. RAIT 2018: 1-6 - 2017
- [j5]H. V. Jayashree, Skanda Kotethota, Vinod Kumar Agrawal:
Reversible circuit design for GCD computation in cryptography algorithms. Int. J. Circuit Theory Appl. 45(2): 242-259 (2017) - [j4]H. V. Jayashree, Himanshu Thapliyal
, Vinod Kumar Agrawal:
Efficient Circuit Design of Reversible Square. Trans. Comput. Sci. 29: 33-46 (2017) - [c3]Mridula J. Deshpande, H. V. Jayashree, Vinod Kumar Agrawal:
Reversible circuit optimization using modified toffoli templates. ICACCI 2017: 344-349 - 2016
- [j3]A. N. Nagamani, S. Ashwin, B. Abhishek, Vinod Kumar Agrawal:
An Exact approach for Complete Test Set Generation of Toffoli-Fredkin-Peres based Reversible Circuits. J. Electron. Test. 32(2): 175-196 (2016) - [j2]A. N. Nagamani, S. Ashwin, B. Abhishek, K. V. Arjun, Vinod Kumar Agrawal:
Design and Analysis of Multiple Parameters Optimized n-Bit Reversible Magnitude Comparators. J. Circuits Syst. Comput. 25(9): 1650112:1-1650112:21 (2016) - [j1]H. V. Jayashree, Himanshu Thapliyal
, Hamid R. Arabnia
, Vinod Kumar Agrawal:
Ancilla-input and garbage-output optimized design of a reversible quantum integer multiplier. J. Supercomput. 72(4): 1477-1493 (2016) - [i1]H. V. Jayashree, Himanshu Thapliyal, Hamid R. Arabnia, Vinod Kumar Agrawal:
Ancilla-Input and Garbage-Output Optimized Design of a Reversible Quantum Integer Multiplier. CoRR abs/1608.01228 (2016) - 2015
- [c2]A. N. Nagamani, H. Vishnu Prasad, Rajendra S. Hathwar, Vinod Kumar Agrawal:
Design of optimized reversible multiplier for high speed DSP application. ICICS 2015: 1-5 - 2014
- [c1]H. V. Jayashree, Himanshu Thapliyal
, Vinod Kumar Agrawal:
Design of Dedicated Reversible Quantum Circuitry for Square Computation. VLSID 2014: 551-556
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint