default search action
John Reuben
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]John Reuben, Suzanne Lancaster, Dietmar Fey, Stefan Slesazeck:
On-chip READ and WRITE Circuits for Multi-bit Ferroelectric Tunnel Junction Memory. NorCAS 2024: 1-6 - 2023
- [c8]John Reuben, Dietmar Fey, Stefan Slesazeck:
A Reference-less Sense Amplifier to Sense pA Currents in Ferroelectric Tunnel Junction Memories. MOCAST 2023: 1-4 - [c7]Stefan Slesazeck, Suzanne Lancaster, John Reuben, Shima Hosseinzadeh, Dietmar Fey, Thomas Mikolajick:
Hyper Dimensional Computing with Ferroelectric Tunneling Junctions. NANOARCH 2023: 3:1-3:2 - 2022
- [j7]Vijaya Lakshmi, John Reuben, Vikramkumar Pudi:
A Novel In-Memory Wallace Tree Multiplier Architecture Using Majority Logic. IEEE Trans. Circuits Syst. I Regul. Pap. 69(3): 1148-1158 (2022) - [j6]Vijaya Lakshmi, Vikramkumar Pudi, John Reuben:
Inner Product Computation In-Memory Using Distributed Arithmetic. IEEE Trans. Circuits Syst. I Regul. Pap. 69(11): 4546-4557 (2022) - 2021
- [j5]John Reuben, Stefan Pechmann:
Accelerated Addition in Resistive RAM Array Using Parallel-Friendly Majority Gates. IEEE Trans. Very Large Scale Integr. Syst. 29(6): 1108-1121 (2021) - [c6]Dietmar Fey, John Reuben, Stefan Slesazeck:
Comparative study of usefulness of FeFET, FTJ and ReRAM technology for ternary arithmetic. ICECS 2021: 1-6 - [c5]John Reuben, Dietmar Fey:
Carry-free Addition in Resistive RAM Array: n-bit Addition in 22 Memory Cycles. ISVLSI 2021: 157-163 - 2020
- [c4]John Reuben, Stefan Pechmann:
A Parallel-friendly Majority Gate to Accelerate In-memory Computation. ASAP 2020: 93-100 - [c3]Dietmar Fey, John Reuben:
Direct state transfer in MLC based memristive ReRAM devices for ternary computing. ECCTD 2020: 1-5
2010 – 2019
- 2019
- [c2]John Reuben, Dietmar Fey:
A Time-based Sensing Scheme for Multi-level Cell (MLC) Resistive RAM. NORCAS 2019: 1-6 - [p1]John Reuben, Nishil Talati, Nimrod Wald, Rotem Ben Hur, Ameer Haj Ali, Pierre-Emmanuel Gaillardon, Shahar Kvatinsky:
A Taxonomy and Evaluation Framework for Memristive Logic. Handbook of Memristor Networks 2019: 1065-1099 - 2017
- [c1]John Reuben, Rotem Ben Hur, Nimrod Wald, Nishil Talati, Ameer Haj Ali, Pierre-Emmanuel Gaillardon, Shahar Kvatinsky:
Memristive logic: A framework for evaluation and comparison. PATMOS 2017: 1-8 - 2016
- [j4]Kamineni Sumanth Kumar, John Reuben:
Minimal Buffer Insertion Based Low Power Clock Tree Synthesis for 3D Integrated Circuits. J. Circuits Syst. Comput. 25(11): 1650142:1-1650142:17 (2016) - 2014
- [j3]John Reuben, Harish M. Kittur, Mohd Shoaib:
A novel clock generation algorithm for system-on-chip based on least common multiple. Comput. Electr. Eng. 40(7): 2113-2125 (2014) - [j2]V. Mohammed Zackriya, John Reuben, Ashim Harsh, Harish M. Kittur:
Low Power fractional-n frequency Divider with Improved Resolution. J. Circuits Syst. Comput. 23(8) (2014) - 2013
- [j1]John Reuben, V. Mohammed Zackriya, Salma Nashit, Harish M. Kittur:
Capacitance driven clock mesh synthesis to minimize skew and power dissipation. IEICE Electron. Express 10(24): 20130850 (2013)
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-11-27 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint