default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Lass
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Michael Lass
, Tobias Kenter, Christian Plessl, Martin Brehm:
Characterizing Microheterogeneity in Liquid Mixtures via Local Density Fluctuations. Entropy 26(4): 322 (2024)- [j6]Lennart Van Hirtum, Patrick De Causmaecker, Jens Goemaere, Tobias Kenter, Heinrich Riebler, Michael Lass, Christian Plessl:
A Computation of the Ninth Dedekind Number Using FPGA Supercomputing. ACM Trans. Reconfigurable Technol. Syst. 17(3): 40:1-40:28 (2024) - [i7]Timon Schapeler, Robert Schade, Michael Lass, Christian Plessl, Tim J. Bartley:
Scalable quantum detector tomography by high-performance computing. CoRR abs/2404.02844 (2024) - 2023
- [j5]Robert Schade, Tobias Kenter, Hossam Elgabarty, Michael Lass, Thomas D. Kühne, Christian Plessl:
Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics. Int. J. High Perform. Comput. Appl. 37(5): 530-538 (2023) - [i6]Lennart Van Hirtum, Patrick De Causmaecker, Jens Goemaere, Tobias Kenter, Heinrich Riebler, Michael Lass, Christian Plessl:
A computation of D(9) using FPGA Supercomputing. CoRR abs/2304.03039 (2023) - 2022
- [b1]Michael Lass:
Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations. University of Paderborn, Germany, 2022 - [j4]Robert Schade, Tobias Kenter, Hossam Elgabarty, Michael Lass, Ole Schütt, Alfio Lazzaro, Hans Pabst, Stephan Mohr, Jürg Hutter, Thomas D. Kühne, Christian Plessl:
Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms. Parallel Comput. 111: 102920 (2022) - 2021
- [i5]Robert Schade, Tobias Kenter, Hossam Elgabarty, Michael Lass, Ole Schütt, Alfio Lazzaro, Hans Pabst, Stephan Mohr, Jürg Hutter, Thomas D. Kühne, Christian Plessl:
Enabling Electronic Structure-Based Ab-Initio Molecular Dynamics Simulations with Hundreds of Millions of Atoms. CoRR abs/2104.08245 (2021) - 2020
- [j3]Varadarajan Rengaraj, Michael Lass, Christian Plessl, Thomas D. Kühne:
Accurate Sampling with Noisy Forces from Approximate Computing. Comput. 8(2): 39 (2020) - [c3]Michael Lass, Robert Schade, Thomas D. Kühne, Christian Plessl:
A submatrix-based method for approximate matrix function evaluation in the quantum chemistry code CP2K. SC 2020: 80 - [i4]Michael Lass, Robert Schade, Thomas D. Kühne, Christian Plessl:
A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K. CoRR abs/2004.10811 (2020)
2010 – 2019
- 2019
- [i3]Varadarajan Rengaraj, Michael Lass, Christian Plessl, Thomas D. Kühne:
Accurate Sampling with Noisy Forces from Approximate Computing. CoRR abs/1907.08497 (2019) - 2018
- [j2]Michael Lass, Thomas D. Kühne, Christian Plessl:
Using Approximate Computing for the Calculation of Inverse Matrix pth Roots. IEEE Embed. Syst. Lett. 10(2): 33-36 (2018) - [c2]Michael Lass, Stephan Mohr, Hendrik Wiebeler, Thomas D. Kühne, Christian Plessl:
A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. PASC 2018: 7:1-7:11 - 2017
- [j1]Heinrich Riebler, Michael Lass, Robert Mittendorf, Thomas Löcke, Christian Plessl:
Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs. ACM Trans. Reconfigurable Technol. Syst. 10(3): 24:1-24:23 (2017) - [i2]Michael Lass, Thomas D. Kühne, Christian Plessl:
Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. CoRR abs/1703.02283 (2017) - [i1]Michael Lass, Stephan Mohr, Thomas D. Kühne, Christian Plessl:
A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. CoRR abs/1710.10899 (2017) - 2016
- [c1]Michael Lass, Dominik Leibenger, Christoph Sorge:
Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension. LCN 2016: 1-9
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-07 21: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
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:
