Michael Lass

Orcid: 0000-0002-5708-7632

According to our database1, Michael Lass authored at least 16 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
3
2
1
1
1
1
3
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Computation of the Ninth Dedekind Number Using FPGA Supercomputing.
ACM Trans. Reconfigurable Technol. Syst., September, 2024

Characterizing Microheterogeneity in Liquid Mixtures via Local Density Fluctuations.
Entropy, April, 2024

Scalable quantum detector tomography by high-performance computing.
CoRR, 2024

2023
Breaking the exascale barrier for the electronic structure problem in <i>ab-initio</i> molecular dynamics.
Int. J. High Perform. Comput. Appl., September, 2023

A computation of D(9) using FPGA Supercomputing.
CoRR, 2023

2022
Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations.
PhD thesis, 2022

Towards electronic structure-based <i>ab-initio</i> molecular dynamics simulations with hundreds of millions of atoms.
Parallel Comput., 2022

2021
Enabling Electronic Structure-Based Ab-Initio Molecular Dynamics Simulations with Hundreds of Millions of Atoms.
CoRR, 2021

2020
Accurate Sampling with Noisy Forces from Approximate Computing.
Comput., 2020

A submatrix-based method for approximate matrix function evaluation in the quantum chemistry code CP2K.
Proceedings of the International Conference for High Performance Computing, 2020

2018
Using Approximate Computing for the Calculation of Inverse Matrix <i>p</i>th Roots.
IEEE Embed. Syst. Lett., 2018

A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices.
Proceedings of the Platform for Advanced Scientific Computing Conference, 2018

2017
Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs.
ACM Trans. Reconfigurable Technol. Syst., 2017

A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices.
CoRR, 2017

Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots.
CoRR, 2017

2016
Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension.
Proceedings of the 41st IEEE Conference on Local Computer Networks, 2016


  Loading...