Lass M. Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations. Universität Paderborn; 2022. doi:10.17619/UNIPB/1-1281
LibreCat: /record/32414
DOI: 10.17619/UNIPB/1-1281

Schade R, Kenter T, Elgabarty H, et al. Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms. Parallel Computing. 2022;111. doi:10.1016/j.parco.2022.102920
LibreCat: /record/33684
DOI: 10.1016/j.parco.2022.102920

Kühne T, Iannuzzi M, Ben MD, et al. CK: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations. The Journal of Chemical Physics. 2020;152(19). doi:10.1063/5.0007045
LibreCat: /record/16277
DOI: 10.1063/5.0007045
arXiv: 2003.03868

Lass M, Schade R, Kühne T, Plessl C. A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CK. In: Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE Computer Society; 2020:1127-1140. doi:10.1109/SC41405.2020.00084
LibreCat: /record/16898
DOI: 10.1109/SC41405.2020.00084
arXiv: 2004.10811

Rengaraj V, Lass M, Plessl C, Kühne T. Accurate Sampling with Noisy Forces from Approximate Computing. Computation. 2020;8(2). doi:10.3390/computation8020039
LibreCat: /record/12878
DOI: 10.3390/computation8020039
arXiv: 1907.08497

Richters D, Lass M, Walther A, Plessl C, Kühne T. A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. Communications in Computational Physics. 2019;25(2):564-585. doi:10.4208/cicp.OA-2018-0053
LibreCat: /record/21
DOI: 10.4208/cicp.OA-2018-0053
arXiv: 1703.02456

Lass M, Kühne T, Plessl C. Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. Embedded Systems Letters. 2018;10(2):33-36. doi:10.1109/LES.2017.2760923
LibreCat: /record/20
DOI: 10.1109/LES.2017.2760923
arXiv: 1703.02283

Lass M, Mohr S, Wiebeler H, Kühne T, Plessl C. A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. In: Proc. Platform for Advanced Scientific Computing (PASC) Conference. ACM; 2018. doi:10.1145/3218176.3218231
LibreCat: /record/1590
DOI: 10.1145/3218176.3218231
arXiv: 1710.10899

Riebler H, Lass M, Mittendorf R, Löcke T, Plessl C. Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs. ACM Transactions on Reconfigurable Technology and Systems (TRETS). 2017;10(3):24:1-24:23. doi:10.1145/3053687
LibreCat: /record/18
DOI: 10.1145/3053687

Lass M, Leibenger D, Sorge C. Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension. In: Proc. 41st Conference on Local Computer Networks (LCN). IEEE; 2016. doi:10.1109/lcn.2016.11
LibreCat: /record/19
DOI: 10.1109/lcn.2016.11

Lass M, Kühne T, Plessl C. Using Approximate Computing in Scientific Codes. In: Workshop on Approximate Computing (AC). ; 2016.
LibreCat: /record/25

Lass M. Localization and Analysis of Code Paths Suitable for Acceleration Using Approximate Computing. Paderborn: Paderborn University; 2015.
LibreCat: /record/1794

Lass M. Sichere Speicherung Vertraulicher Daten in Verteilten Versionskontrollsystemen. Paderborn: Paderborn University; 2013.
LibreCat: /record/1795