


default search action
Sachin Patkar
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c5]Somnath Mondal, Sachin Patkar, T. K. Pal:
Hardware implementation of Ring-LWE lattice cryptography with BCH and Gray coding based error correction. VLSID 2023: 1-6
2010 – 2019
- 2014
- [j3]Swadesh Choudhary, Hrishikesh Sharma
, Sachin Patkar:
Optimal Folding of Data Flow graphs Based on Finite Projective Geometry using Vector Space Partitioning. Discret. Math. Algorithms Appl. 6(1) (2014) - [c4]Hrishikesh Sharma
, S. Sivasubramanian, Sachin Patkar:
Optimal communication scheduling for iterative decoding of irregular codes. NCC 2014: 1-5 - 2013
- [j2]Swadesh Choudhary, Hrishikesh Sharma
, Sachin Patkar:
Optimal Folding of Data Flow graphs Based on Finite Projective Geometry using Vector Space Partitioning. Discret. Math. Algorithms Appl. 5(4) (2013) - [j1]Hrishikesh Sharma
, Sachin Patkar:
A design methodology for optimally folded, pipelined architectures in VLSI applications using projective space lattices. Microprocess. Microsystems 37(6-7): 674-683 (2013) - [c3]Saurabh Agrawal, Debapratim Ghosh, Abhishek Kamath, Kaushlesh Sharma, Sneha Mistry, Madhumita Date, Sachin Patkar, Dinesh Sharma:
An introductory lab course in Digital Design: On-line and on-site laboratory solution. EDUCON 2013: 716-722 - 2012
- [i4]Swadesh Choudhary, Hrishikesh Sharma, B. S. Adiga, Sachin Patkar:
Expander-like Codes based on Finite Projective Geometry. CoRR abs/1209.3460 (2012) - 2011
- [c2]Subhasis Das, Sachin Patkar:
A Compact Gaussian Random Number Generator for Small Word Lengths. ARC 2011: 88-93 - [c1]Hrishikesh Sharma, Subhasis Das, Rewati Raman Raut, Sachin Patkar:
High Throughput Memory-efficient VLSI Designs for Structured LDPC Decoding. PECCS 2011: 518-521 - [i3]Swadesh Choudhary, Hrishikesh Sharma, Sachin Patkar:
Optimal Folding of Data Flow Graphs based on Finite Projective Geometry using Lattice Embedding. CoRR abs/1107.0118 (2011) - [i2]Shreeniwas Sapre, Hrishikesh Sharma, Abhishek Patil, B. S. Adiga, Sachin Patkar:
Finite Projective Geometry based Fast, Conflict-free Parallel Matrix Computations. CoRR abs/1107.1127 (2011) - [i1]Hrishikesh Sharma, Sachin Patkar:
A Design Methodology for Folded, Pipelined Architectures in VLSI Applications using Projective Space Lattices. CoRR abs/1108.3970 (2011)
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 2025-01-09 13:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint