default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKartik Mohanram
- > Home > Persons > Kartik Mohanram
Publications
- 2014
[j9]Mihir R. Choudhury, Vikas Chandra, Robert C. Aitken, Kartik Mohanram:
Time-Borrowing Circuit Designs and Hardware Prototyping for Timing Error Resilience. IEEE Trans. Computers 63(2): 497-509 (2014)- 2013
- [j8]Mihir R. Choudhury, Kartik Mohanram:
Low Cost Concurrent Error Masking Using Approximate Logic Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(8): 1163-1176 (2013) - 2011
- [c42]Andrew Zukoski, Mihir R. Choudhury, Kartik Mohanram:
Reliability-driven don't care assignment for logic synthesis. DATE 2011: 1560-1565 - 2010
- [c37]Mihir R. Choudhury, Vikas Chandra, Kartik Mohanram, Robert C. Aitken:
Analytical model for TDDB-based performance degradation in combinational logic. DATE 2010: 423-428 - [c36]Mihir R. Choudhury, Vikas Chandra, Kartik Mohanram, Robert C. Aitken:
TIMBER: Time borrowing and error relaying for online timing error resilience. DATE 2010: 1554-1559 - [c35]Mihir R. Choudhury, Masoud Rostami, Kartik Mohanram:
Dominant critical gate identification for power and yield optimization in logic circuits. ACM Great Lakes Symposium on VLSI 2010: 173-178 - [c32]Mihir R. Choudhury, Kartik Mohanram:
Bi-decomposition of large Boolean functions using blocking edge graphs. ICCAD 2010: 586-591 - 2009
- [j4]Mihir R. Choudhury, Quming Zhou, Kartik Mohanram:
Soft Error Rate Reduction Using Circuit Optimization and Transient Filter Insertion. J. Electron. Test. 25(2-3): 197-207 (2009) - [j3]Mihir R. Choudhury, Kartik Mohanram:
Reliability Analysis of Logic Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(3): 392-405 (2009) - [c31]Mihir R. Choudhury, Kartik Mohanram:
Timing-driven optimization using lookahead logic circuits. DAC 2009: 390-395 - [c30]Mihir R. Choudhury, Kartik Mohanram:
Masking timing errors on speed-paths in logic circuits. DATE 2009: 87-92 - 2008
- [c28]Mihir R. Choudhury, Youngki Yoon, Jing Guo, Kartik Mohanram:
Technology exploration for graphene nanoribbon FETs. DAC 2008: 272-277 - [c27]Mihir R. Choudhury, Kartik Mohanram:
Approximate logic circuits for low overhead, non-intrusive concurrent error detection. DATE 2008: 903-908 - [c25]Quming Zhou, Mihir R. Choudhury, Kartik Mohanram:
Tunable Transient Filters for Soft Error Rate Reduction in Combinational Circuits. ETS 2008: 179-184 - 2007
- [c23]Mihir R. Choudhury, Kyle Ringgenberg, Scott Rixner, Kartik Mohanram:
Interactive presentation: Single-ended coding techniques for off-chip interconnects to commodity memory. DATE 2007: 1072-1077 - [c22]Mihir R. Choudhury, Kartik Mohanram:
Accurate and scalable reliability analysis of logic circuits. DATE 2007: 1454-1459 - 2006
- [c15]Mihir R. Choudhury, Quming Zhou, Kartik Mohanram:
Design optimization for single-event upset robustness using simultaneous dual-VDD and sizing techniques. ICCAD 2006: 204-209 - [c14]Quming Zhou, Mihir R. Choudhury, Kartik Mohanram:
Design Optimization for Robustness to Single Event Upsets. VTS 2006: 202-207
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:05 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:
