Max Hahn-Klimroth

According to our database, Max Hahn-Klimroth authored at least 31 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

An Unsupervised Learning Approach to Evaluate Questionnaire Data - What One Can Learn from Violations of Measurement Invariance.

Max Hahn-Klimroth, Paul W. Dierkes, Matthias W. Kleespies

Data Sci. J., February, 2024

Minimum degree conditions for containing an r-regular r-connected spanning subgraph.

Max Hahn-Klimroth, Olaf Parczyk, Yury Person

Eur. J. Comb., 2024

Inevitability of Polarization in Geometric Opinion Exchange.

Abdou Majeed Alidou, Júlia Baligács, Max Hahn-Klimroth, Jan Hazla, Lukas Hintze, Olga Scheftelowitsch

CoRR, 2024

Noisy group testing via spatial coupling.

Amin Coja-Oghlan, Max Hahn-Klimroth, Lukas Hintze, Dominik Kaaser, Lena Krieg, Maurice Rolvien, Olga Scheftelowitsch

CoRR, 2024

2023

A Notion of Feature Importance by Decorrelation and Detection of Trends by Random Forest Regression.

Yannick Gerstorfer, Max Hahn-Klimroth, Lena Krieg

Data Sci. J., January, 2023

Information-theoretic and algorithmic aspects of parallel and distributed reconstruction from pooled data.

Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Philipp Loick

J. Parallel Distributed Comput., 2023

On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data Problem.

Max Hahn-Klimroth, Remco van der Hofstad, Noëla Müller, Connor Riddlesden

CoRR, 2023

Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes.

Max Hahn-Klimroth, Dominik Kaaser, Malin Rau

CoRR, 2023

Inference of a rumor's source in the independent cascade model.

Petra Berenbrink, Max Hahn-Klimroth, Dominik Kaaser, Lena Krieg, Malin Rau

Proceedings of the Uncertainty in Artificial Intelligence, 2023

On Reconstructing the Patient Zero from Sensor Measurements.

Max Hahn-Klimroth, Dominik Kaaser

Proceedings of the 43rd IEEE International Conference on Distributed Computing Systems, 2023

The Full Rank Condition for Sparse Random Matrices.

Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien

Proceedings of the Approximation, 2023

2022

Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms.

Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien, Jonathan Scarlett, Nelvin Tan

IEEE Trans. Inf. Theory, 2022

Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study.

Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Manuel Penschuck

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

On the Hierarchy of Distributed Majority Protocols.

Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Malin Rau

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

On the Parallel Reconstruction from Pooled Data.

Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Philipp Loick

Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

Distributed Reconstruction of Noisy Pooled Data.

Max Hahn-Klimroth, Dominik Kaaser

Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

Near optimal efficient decoding from pooled data.

Max Hahn-Klimroth, Noëla Müller

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Statistical and Computational Phase Transitions in Group Testing.

Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

The Cut Metric for Probability Distributions.

Amin Coja-Oghlan, Max Hahn-Klimroth

SIAM J. Discret. Math., 2021

The number of satisfying assignments of random 2-SAT formulas.

Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou

Random Struct. Algorithms, 2021

Optimal group testing.

Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick

Comb. Probab. Comput., 2021

The full rank condition for sparse random matrices.

Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien

CoRR, 2021

Minimum degree conditions for containing an r-regular r-connected subgraph.

Max Hahn-Klimroth, Olaf Parczyk, Yury Person

CoRR, 2021

Random Perturbation of Sparse Graphs.

Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, Samuel Mohr, Olaf Parczyk

Electron. J. Comb., 2021

Inference and Mutual Information on Random Factor Graphs.

Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020

Information-Theoretic and Algorithmic Thresholds for Group Testing.

Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick

IEEE Trans. Inf. Theory, 2020

Optimal group testing under real world restrictions.

Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien

CoRR, 2020

The random 2-SAT partition function.

Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou

CoRR, 2020

2019

Optimal adaptive group testing.

Max Hahn-Klimroth, Philipp Loick

CoRR, 2019

Optimal non-adaptive group testing.

Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick

CoRR, 2019

Quantitative Group Testing in the Sublinear Regime.

Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Philipp Loick

CoRR, 2019