default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael P. Frank
Person information
- affiliation: Sandia National Laboratories, Albuquerque, NM, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Xuan Hu
, Can Cui, Samuel Liu, Felipe García-Sánchez, Wesley H. Brigner, Benjamin W. Walker, Alexander J. Edwards, T. Patrick Xiao, Christopher H. Bennett, Naimul Hassan, Michael P. Frank, Jean Anne C. Incorvia, Joseph S. Friedman:
Magnetic skyrmions and domain walls for logical and neuromorphic computing. Neuromorph. Comput. Eng. 3(2): 22003 (2023)- [i11]Benjamin W. Walker, Alexander J. Edwards, Xuan Hu, Michael P. Frank, Felipe García-Sánchez, Joseph S. Friedman:
Near-Landauer Reversible Skyrmion Logic with Voltage-Based Propagation. CoRR abs/2301.10700 (2023) - 2022
- [c21]Christopher Cordi, Michael P. Frank, Kasimir Gabert, Carollan Helinski, Ryan C. Kao, Vladimir Kolesnikov, Abrahim Ladha, Nicholas D. Pattengale:
Auditable, Available and Resilient Private Computation on the Blockchain via MPC. CSCML 2022: 281-299 - [c20]Michael P. Frank, Rupert M. Lewis:
Ballistic Asynchronous Reversible Computing in Superconducting Circuits. ICRC 2022: 30-35 - [i10]Xuan Hu, Benjamin W. Walker, Felipe García-Sánchez, Alexander J. Edwards, Peng Zhou, Jean Anne C. Incorvia, Alexandru Paler, Michael P. Frank, Joseph S. Friedman:
Logical and Physical Reversibility of Conservative Skyrmion Logic. CoRR abs/2203.13912 (2022) - [i9]Christopher Cordi, Michael P. Frank, Kasimir Gabert, Carollan Helinski, Ryan C. Kao, Vladimir Kolesnikov, Abrahim Ladha, Nicholas D. Pattengale:
Auditable, Available and Resilient Private Computation on the Blockchain via MPC. IACR Cryptol. ePrint Arch. 2022: 398 (2022) - 2021
- [j6]Michael P. Frank, Karpur Shukla:
Quantum Foundations of Classical Reversible Computing. Entropy 23(6): 701 (2021) - [i8]Michael P. Frank, Karpur Shukla:
Quantum Foundations of Classical Reversible Computing. CoRR abs/2105.00065 (2021) - 2020
- [c19]Michael P. Frank, Robert W. Brocato, Thomas M. Conte, Alexander H. Hsia, Anirudh Jain, Nancy A. Missert, Karpur Shukla, Brian D. Tierney:
Special Session: Exploring the Ultimate Limits of Adiabatic Circuits. ICCD 2020: 21-24 - [c18]Michael P. Frank, Robert W. Brocato, Brian D. Tierney, Nancy A. Missert, Alexander H. Hsia:
Reversible Computing with Fast, Fully Static, Fully Adiabatic CMOS. ICRC 2020: 1-8 - [i7]Michael P. Frank, Robert W. Brocato, Brian D. Tierney, Nancy A. Missert, Alexander H. Hsia:
Reversible Computing with Fast, Fully Static, Fully Adiabatic CMOS. CoRR abs/2009.00448 (2020)
2010 – 2019
- 2019
- [c17]Alwin Zulehner, Michael P. Frank, Robert Wille:
Design automation for adiabatic circuits. ASP-DAC 2019: 669-674 - [i6]Michael P. Frank:
Physical Foundations of Landauer's Principle. CoRR abs/1901.10327 (2019) - [i5]Tom Conte, Erik DeBenedictis, Natesh Ganesh, Todd Hylton, John Paul Strachan, R. Stanley Williams, Alexander A. Alemi, Lee Altenberg, Gavin E. Crooks, James P. Crutchfield, Lídia del Rio, Josh Deutsch, Michael Robert DeWeese, Khari Douglas, Massimiliano Esposito, Michael P. Frank, Robert Fry, Peter Harsha, Mark D. Hill, Christopher T. Kello, Jeff Krichmar, Suhas Kumar, Shih-Chii Liu, Seth Lloyd, Matteo Marsili, Ilya Nemenman, Alex Nugent, Norman H. Packard, Dana Randall, Peter Sadowski, Narayana Santhanam, Robert Shaw, Adam Z. Stieg, Elan Stopnitzky, Christof Teuscher, Chris Watkins, David H. Wolpert, J. Joshua Yang, Yan Yufik:
Thermodynamic Computing. CoRR abs/1911.01968 (2019) - 2018
- [j5]Erik P. DeBenedictis, Michael P. Frank:
The National Quantum Initiative Will Also Benefit Classical Computers [Rebooting Computing]. Computer 51(12): 69-73 (2018) - [j4]Bobin Deng, Sriseshan Srikanth, Eric R. Hein, Thomas M. Conte, Erik DeBenedictis, Jeanine E. Cook, Michael P. Frank:
Extending Moore's Law via Computationally Error-Tolerant Computing. ACM Trans. Archit. Code Optim. 15(1): 8:1-8:27 (2018) - [c16]Sriseshan Srikanth, Paul G. Rabbat, Eric R. Hein, Bobin Deng, Thomas M. Conte, Erik DeBenedictis, Jeanine E. Cook, Michael P. Frank:
Memory System Design for Ultra Low Power, Computationally Error Resilient Processor Microarchitectures. HPCA 2018: 696-709 - [c15]Michael P. Frank:
Reversible Computing as a Path Towards Unbounded Energy Efficiency: Challenges and Opportunities Invited Talk. ICRC 2018: 1 - [c14]Michael P. Frank:
Physical Foundations of Landauer's Principle. RC 2018: 3-33 - [i4]Michael P. Frank:
Back to the Future: The Case for Reversible Computing. CoRR abs/1803.02789 (2018) - [i3]Michael P. Frank:
Generalized Reversible Computing. CoRR abs/1806.10183 (2018) - [i2]Alwin Zulehner, Michael P. Frank, Robert Wille:
Design Automation for Adiabatic Circuits. CoRR abs/1809.02421 (2018) - 2017
- [j3]Erik P. DeBenedictis, Jesse K. Mee, Michael P. Frank:
The Opportunities and Controversies of Reversible Computing. Computer 50(6): 76-80 (2017) - [c13]Michael P. Frank:
Asynchronous Ballistic Reversible Computing. ICRC 2017: 1-8 - [c12]Michael P. Frank:
Foundations of Generalized Reversible Computing. RC 2017: 19-34 - [c11]James Lyke, Jesse K. Mee, Arthur H. Edwards, Andrew Pineda, Erik DeBenedictis, Michael P. Frank:
On the energy consequences of information for spacecraft systems. WiSEE 2017: 104-109 - [i1]Michael P. Frank, M. Josephine Ammer:
Relativized Separation of Reversible and Irreversible Space-Time Complexity Classes. CoRR abs/1708.08480 (2017) - 2016
- [c10]Sapan Agarwal, Jeanine E. Cook, Erik DeBenedictis, Michael P. Frank, Gert Cauwenberghs, Sriseshan Srikanth, Bobin Deng, Eric R. Hein, Paul G. Rabbat, Thomas M. Conte:
Energy efficiency limits of logic and memory. ICRC 2016: 1-8 - [c9]Erik P. DeBenedictis, Michael P. Frank, Natesh Ganesh, Neal G. Anderson:
A path toward ultra-low-energy computing. ICRC 2016: 1-8 - [c8]Michael P. Frank, Erik P. DeBenedictis:
A novel operational paradigm for thermodynamically reversible logic: Adibatic transformation of chaotic nonlinear dynamical circuits. ICRC 2016: 1-8
2000 – 2009
- 2009
- [c7]Michael P. Frank, Uwe Meyer-Bäse, Irinel Chiorescu, Liviu Oniciuc, Robert A. van Engelen:
Space-efficient simulation of quantum computers. ACM Southeast Regional Conference 2009 - 2005
- [j2]Michael P. Frank:
On the Interpretation of Energy as the Rate of Quantum Computation. Quantum Inf. Process. 4(4): 283-334 (2005) - [c6]Michael P. Frank:
Introduction to reversible computing: motivation, progress, and challenges. Conf. Computing Frontiers 2005: 385-390 - [c5]Michael P. Frank:
Approaching the Physical Limits of Computing. ISMVL 2005: 168-185 - 2004
- [c4]Venkiteswaran Anantharam, Maojiao He, Krishna Natarajan, Huikai Xie, Michael P. Frank:
Driving Fully-Adiabatic Logic Circuits Using Custom High-Q MEMS Resonators. ESA/VLSI 2004: 5-11 - 2003
- [c3]Michael P. Frank:
Common Mistakes in Adiabatic Logic Design and How to Avoid Them. Embedded Systems and Applications 2003: 216-222 - [c2]C. Chaitanya, Michael P. Frank:
Automated Negotiations and Use in O.C.E.A.N. IICAI 2003: 226-235 - [c1]Pradeep Padala, Cyrus Harrison, Nicholas Pelfort, Erwin Jansen, Michael P. Frank, Chaitanya Chokkareddy:
OCEAN: The Open Computation Exchange and Arbitration Network, A Market Approach to Meta Computing. ISPDC 2003: 185-192 - 2002
- [j1]Michael P. Frank:
The physical limits of computing. Comput. Sci. Eng. 4(3): 16-26 (2002)
1990 – 1999
- 1999
- [b1]Michael P. Frank:
Reversibility for efficient computing. Massachusetts Institute of Technology, Cambridge, MA, USA, 1999
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-10-07 21:23 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:
