default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaustav Goswami 0002
Person information
- affiliation: University of California Davis, CA, USA
- affiliation (former): Indian Institute of Information Technology Guwahati, India
Other persons with the same name
- Kaustav Goswami 0001 — Tata Consultancy Services Ltd., Kolkata, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Divyansh Maura
, Tanmay Goel, Kaustav Goswami, Dip Sankar Banerjee, Shirshendu Das:
Variation aware power management for GPU memories. Microprocess. Microsystems 96: 104711 (2023)- [i3]Hari Venugopalan, Kaustav Goswami, Zain ul Abi Din, Jason Lowe-Power, Samuel T. King, Zubair Shafiq:
Centauri: Practical Rowhammer Fingerprinting. CoRR abs/2307.00143 (2023) - 2022
- [c8]Vishesh Mishra, Divy Pandey, Saurabh Singh, Sagar Satapathy, Kaustav Goswami, Babita Jajodia, Dip Sankar Banerjee:
ART-MAC: Approximate Rounding and Truncation based MAC Unit for Fault-Tolerant Applications. ISCAS 2022: 1640-1644 - [c7]Sagar Satapathy, Saurabh Singh, Kaustav Goswami, Vishesh Mishra, Divy Pandey, Dip Sankar Banerjee:
AxLEAP: Enabling Low-Power Approximations Through Unified Power Format. ISCAS 2022: 1645-1649 - [c6]Saurabh Singh, Vishesh Mishra, Sagar Satapathy, Divy Pandey, Kaustav Goswami, Dip Sankar Banerjee, Babita Jajodia:
EFCSA: An Efficient Carry Speculative Approximate Adder with Rectification. ISQED 2022: 1-7 - [c5]Kaustav Goswami, Shirshendu Das, Sagar Satapathy, Dip Sankar Banerjee:
A Case for Amplifying Row Hammer Attacks via Cell-Coupling in DRAM Devices. MEMSYS 2022: 3:1-3:16 - [i2]Kaustav Goswami, Hemanta Kumar Mondal, Shirshendu Das, Dip Sankar Banerjee:
VAR-DRAM: Variation-Aware Framework for Efficient Dynamic Random Access Memory Design. CoRR abs/2201.06853 (2022) - 2021
- [j1]Kaustav Goswami, Dip Sankar Banerjee, Shirshendu Das:
Towards Enhanced System Efficiency while Mitigating Row Hammer. ACM Trans. Archit. Code Optim. 18(4): 40:1-40:26 (2021) - [c4]Shobhit Belwal, Rajat Bhattacharjya, Kaustav Goswami, Dip Sankar Banerjee:
ACLA: An Approximate Carry-Lookahead Adder with Intelligent Carry Judgement and Correction. ISQED 2021: 1-7 - [c3]Tanmay Goel, Divyansh Maura, Kaustav Goswami, Shirshendu Das, Dip Sankar Banerjee:
Towards Row Sensitive DRAM Refresh through Retention Awareness. ISQED 2021: 450-456 - 2020
- [c2]Rajat Bhattacharjya, Vishesh Mishra, Saurabh Singh, Kaustav Goswami, Dip Sankar Banerjee:
An Approximate Carry Estimating Simultaneous Adder with Rectification. ACM Great Lakes Symposium on VLSI 2020: 139-144 - [i1]Rajat Bhattacharjya, Vishesh Mishra, Saurabh Singh, Kaustav Goswami, Dip Sankar Banerjee:
An Approximate Carry Estimating Simultaneous Adder with Rectification. CoRR abs/2008.11591 (2020)
2010 – 2019
- 2019
- [c1]Kaustav Goswami, Hemanta Kumar Mondal, Shirshendu Das, Dip Sankar Banerjee:
State Preserving Dynamic DRAM Bank Re-Configurations for Enhanced Power Efficiency. ISQED 2019: 131-137
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-12 00:07 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:
