default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax Hahn-Klimroth
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Amin Coja-Oghlan
, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien:
The full rank condition for sparse random matrices. Comb. Probab. Comput. 33(5): 643-707 (2024)- [j10]Max Hahn-Klimroth, Paul W. Dierkes, Matthias W. Kleespies:
An Unsupervised Learning Approach to Evaluate Questionnaire Data - What One Can Learn from Violations of Measurement Invariance. Data Sci. J. 23 (2024) - [j9]Max Hahn-Klimroth, Olaf Parczyk, Yury Person:
Minimum degree conditions for containing an r-regular r-connected spanning subgraph. Eur. J. Comb. 118: 103940 (2024) - [c13]Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
Distributed Pooled Data Intrusion Detection: Lessons Learned from Quantitative Group Testing. ICDCS 2024: 198-208 - [i22]Amin Coja-Oghlan, Max Hahn-Klimroth, Lukas Hintze, Dominik Kaaser, Lena Krieg, Maurice Rolvien, Olga Scheftelowitsch:
Noisy group testing via spatial coupling. CoRR abs/2402.02895 (2024) - [i21]Abdou Majeed Alidou, Júlia Baligács, Max Hahn-Klimroth, Jan Hazla, Lukas Hintze, Olga Scheftelowitsch:
Inevitability of Polarization in Geometric Opinion Exchange. CoRR abs/2402.08446 (2024) - 2023
- [j8]Yannick Gerstorfer, Max Hahn-Klimroth, Lena Krieg:
A Notion of Feature Importance by Decorrelation and Detection of Trends by Random Forest Regression. Data Sci. J. 22 (2023) - [j7]Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Philipp Loick:
Information-theoretic and algorithmic aspects of parallel and distributed reconstruction from pooled data. J. Parallel Distributed Comput. 180: 104718 (2023) - [c12]Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien:
The Full Rank Condition for Sparse Random Matrices. APPROX/RANDOM 2023: 54:1-54:14 - [c11]Max Hahn-Klimroth, Dominik Kaaser:
On Reconstructing the Patient Zero from Sensor Measurements. ICDCS 2023: 1-11 - [c10]Petra Berenbrink, Max Hahn-Klimroth, Dominik Kaaser, Lena Krieg, Malin Rau:
Inference of a rumor's source in the independent cascade model. UAI 2023: 152-162 - [i20]Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes. CoRR abs/2303.00043 (2023) - [i19]Yannick Gerstorfer, Lena Krieg, Max Hahn-Klimroth:
A Notion of Feature Importance by Decorrelation and Detection of Trends by Random Forest Regression. CoRR abs/2303.01156 (2023) - [i18]Max Hahn-Klimroth, Paul W. Dierkes, Matthias W. Kleespies:
An unsupervised learning approach to evaluate questionnaire data - what one can learn from violations of measurement invariance. CoRR abs/2312.06309 (2023) - [i17]Max Hahn-Klimroth, Remco van der Hofstad, Noëla Müller, Connor Riddlesden:
On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data Problem. CoRR abs/2312.14588 (2023) - 2022
- [j6]Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien, Jonathan Scarlett, Nelvin Tan:
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms. IEEE Trans. Inf. Theory 68(5): 3253-3280 (2022) - [c9]Max Hahn-Klimroth, Noëla Müller:
Near optimal efficient decoding from pooled data. COLT 2022: 3395-3409 - [c8]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik:
Statistical and Computational Phase Transitions in Group Testing. COLT 2022: 4764-4781 - [c7]Max Hahn-Klimroth, Dominik Kaaser:
Distributed Reconstruction of Noisy Pooled Data. ICDCS 2022: 89-99 - [c6]Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Philipp Loick:
On the Parallel Reconstruction from Pooled Data. IPDPS 2022: 425-435 - [c5]Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
On the Hierarchy of Distributed Majority Protocols. OPODIS 2022: 23:1-23:19 - [c4]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Manuel Penschuck:
Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study. SEA 2022: 8:1-8:18 - [i16]Max Hahn-Klimroth, Dominik Kaaser:
Distributed Reconstruction of Noisy Pooled Data. CoRR abs/2204.07491 (2022) - [i15]Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
On the Hierarchy of Distributed Majority Protocols. CoRR abs/2205.08203 (2022) - [i14]Petra Berenbrink, Max Hahn-Klimroth, Dominik Kaaser, Lena Krieg, Malin Rau:
Inference of a Rumor's Source in the Independent Cascade Model. CoRR abs/2205.12125 (2022) - [i13]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik:
Statistical and Computational Phase Transitions in Group Testing. CoRR abs/2206.07640 (2022) - 2021
- [j5]Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, Samuel Mohr, Olaf Parczyk:
Random Perturbation of Sparse Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j4]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Optimal group testing. Comb. Probab. Comput. 30(6): 811-848 (2021) - [j3]Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou:
The number of satisfying assignments of random 2-SAT formulas. Random Struct. Algorithms 58(4): 609-647 (2021) - [j2]Amin Coja-Oghlan, Max Hahn-Klimroth:
The Cut Metric for Probability Distributions. SIAM J. Discret. Math. 35(2): 1096-1135 (2021) - [c3]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch:
Inference and Mutual Information on Random Factor Graphs. STACS 2021: 24:1-24:15 - [i12]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Manuel Penschuck:
Efficient and accurate group testing via Belief Propagation: an empirical study. CoRR abs/2105.07882 (2021) - [i11]Max Hahn-Klimroth, Noëla Müller:
Near optimal efficient decoding from pooled data. CoRR abs/2108.04342 (2021) - [i10]Max Hahn-Klimroth, Olaf Parczyk, Yury Person:
Minimum degree conditions for containing an r-regular r-connected subgraph. CoRR abs/2108.07601 (2021) - [i9]Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien:
The full rank condition for sparse random matrices. CoRR abs/2112.14090 (2021) - 2020
- [j1]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Information-Theoretic and Algorithmic Thresholds for Group Testing. IEEE Trans. Inf. Theory 66(12): 7911-7928 (2020) - [c2]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Optimal Group Testing. COLT 2020: 1374-1388 - [i8]Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou:
The random 2-SAT partition function. CoRR abs/2002.03690 (2020) - [i7]Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien:
Optimal group testing under real world restrictions. CoRR abs/2004.11860 (2020) - [i6]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch:
Inference and mutual information on random factor graphs. CoRR abs/2007.07494 (2020)
2010 – 2019
- 2019
- [c1]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Information-Theoretic and Algorithmic Thresholds for Group Testing. ICALP 2019: 43:1-43:14 - [i5]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Information-theoretic and algorithmic thresholds for group testing. CoRR abs/1902.02202 (2019) - [i4]Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Philipp Loick:
Quantitative Group Testing in the Sublinear Regime. CoRR abs/1905.01458 (2019) - [i3]Amin Coja-Oghlan, Max Hahn-Klimroth:
The cut metric for probability distributions. CoRR abs/1905.13619 (2019) - [i2]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Optimal non-adaptive group testing. CoRR abs/1911.02287 (2019) - [i1]Max Hahn-Klimroth, Philipp Loick:
Optimal adaptive group testing. CoRR abs/1911.06647 (2019)
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 2025-01-09 12:52 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:
