default search action
Mohammad Mehdi Sharifi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Mengyuan Li, Shiyi Liu, Mohammad Mehdi Sharifi, X. Sharon Hu:
CAMASim: A Comprehensive Simulation Framework for Content-Addressable Memory based Accelerators. CoRR abs/2403.03442 (2024) - 2023
- [j2]Liu Liu
, Ann Franchesca Laguna, Ramin Rajaei
A Reconfigurable FeFET Content Addressable Memory for Multi-State Hamming Distance. IEEE Trans. Circuits Syst. I Regul. Pap. 70(6): 2356-2369 (2023) - [c9]Michael T. Niemier, Xiaobo Sharon Hu, Liu Liu, Mohammad Mehdi Sharifi, Ian O'Connor, David Atienza, Giovanni Ansaloni, Can Li, Asif Khan, Daniel C. Ralph:
Cross Layer Design for the Predictive Assessment of Technology-Enabled Architectures. DATE 2023: 1-10 - [c8]Ann Franchesca Laguna, Mohammad Mehdi Sharifi, Dayane Reis, Liu Liu, Andrew Hennessee, Clayton O'Dell, Ian O'Connor, Michael T. Niemier, X. Sharon Hu:
Invited Paper: Algorithm/Hardware Co-Design for Few-Shot Learning at the Edge. ICCAD 2023: 1-9 - 2022
- [j1]Arman Kazemi
FeFET Multi-Bit Content-Addressable Memories for In-Memory Nearest Neighbor Search. IEEE Trans. Computers 71(10): 2565-2576 (2022) - [c7]Liu Liu
Eva-CAM: A Circuit/Architecture-Level Evaluation Tool for General Content Addressable Memories. DATE 2022: 1173-1176 - 2021
- [c6]Arman Kazemi, Mohammad Mehdi Sharifi
In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories. DATE 2021: 1084-1089 - [c5]Hussam Amrouch, Di Gao, Xiaobo Sharon Hu
ICCAD Tutorial Session Paper Ferroelectric FET Technology and Applications: From Devices to Systems. ICCAD 2021: 1-8 - [c4]Arman Kazemi, Shubham Sahay
A Flash-Based Multi-Bit Content-Addressable Memory with Euclidean Squared Distance. ISLPED 2021: 1-6 - [c3]Arman Kazemi, Mohammad Mehdi Sharifi
MIMHD: Accurate and Efficient Hyperdimensional Inference Using Multi-Bit In-Memory Computing. ISLPED 2021: 1-6 - [c2]Mohammad Mehdi Sharifi
Application-driven Design Exploration for Dense Ferroelectric Embedded Non-volatile Memories. ISLPED 2021: 1-6 - [i3]Mohammad Mehdi Sharifi, Lillian Pentecost, Ramin Rajaei, Arman Kazemi, Qiuwen Lou, Gu-Yeon Wei, David Brooks, Kai Ni, X. Sharon Hu, Michael T. Niemier, Marco Donato:
Application-driven Design Exploration for Dense Ferroelectric Embedded Non-volatile Memories. CoRR abs/2106.11757 (2021) - [i2]Arman Kazemi, Mohammad Mehdi Sharifi, Zhuowen Zou, Michael T. Niemier, X. Sharon Hu, Mohsen Imani:
MIMHD: Accurate and Efficient Hyperdimensional Inference Using Multi-Bit In-Memory Computing. CoRR abs/2106.12029 (2021) - 2020
- [c1]Mohammad Mehdi Sharifi
A Novel TIGFET-based DFF Design for Improved Resilience to Power Side-Channel Attacks. DATE 2020: 1253-1258 - [i1]Arman Kazemi, Mohammad Mehdi Sharifi, Ann Franchesca Laguna, Franz Müller, Ramin Rajaei, Ricardo Olivo, Thomas Kämpfe, Michael T. Niemier, Xiaobo Sharon Hu:
In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories. CoRR abs/2011.07095 (2020)
Coauthor Index
aka: X. Sharon Hu
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-25 05:58 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: