Lukas Hübner
Lukas Hübner
Karlsruhe Institute of Technology (KIT) and Heidelberg Institute of Theoretical Studies (HITS)
Verified email at
Cited by
Cited by
Phylogenetic analysis of SARS-CoV-2 data is difficult
B Morel, P Barbera, L Czech, B Bettisworth, L Hübner, S Lutteropp, ...
bioRxiv, 2020
Data Distribution for Phylogenetic Inference with Site Repeats via Judicious Hypergraph Partitioning
I Baar, L Hübner, P Oettig, A Zapletal, S Schlag, A Stamatakis, B Morel
2019 IEEE International Parallel and Distributed Processing Symposium …, 2019
Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG
L Hübner, AM Kozlov, D Hespe, P Sanders, A Stamatakis
Bioinformatics 37 (22), 4056-4063, 2021
The Free Lunch is not over yet—systematic exploration of numerical thresholds in maximum likelihood phylogenetic inference
J Haag, L Hübner, AM Kozlov, A Stamatakis
Bioinformatics Advances 3 (1), vbad124, 2023
KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI
D Hespe, L Hübner, F Kurpicz, P Sanders, M Schimek, D Seemaier, ...
arXiv preprint arXiv:2404.05610, 2024
Load-balance and Fault-tolerance for Massively Parallel Phylogenetic Inference
KL Hübner
Karlsruher Institut für Technologie (KIT), 2020
Brief Announcement:(Near) Zero-Overhead C++ Bindings for MPI
D Hespe, L Hübner, F Kurpicz, P Sanders, M Schimek, D Seemaier, ...
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024
Memoization on Shared Subtrees Accelerates Computations on Genealogical Forests
L Hübner, A Stamatakis
bioRxiv, 2024.05. 23.595533, 2024
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms
L Hübner, D Hespe, P Sanders, A Stamatakis
2022 IEEE/ACM 12th Workshop on Fault Tolerance for HPC at eXtreme Scale …, 2022
Scalable discrete algorithms for big data applications
D Hespe, L Hübner, L Hübschle-Schneider, P Sanders, D Schreiber
International Conference on High Performance Computing in Science and …, 2021
The system can't perform the operation now. Try again later.
Articles 1–10