3 citations · 8 across the 6 of their papers we have counts for
7 papers
Noisy group testing via spatial coupling
Amin Coja-Oghlan, Max Hahn-Klimroth, Lukas Hintze +4
We study the problem of identifying a small set , , of infected individuals within a large population of size by testing groups of individuals simultaneously.…
A Notion of Feature Importance by Decorrelation and Detection of Trends by Random Forest Regression
Yannick Gerstorfer, Lena Krieg, Max Hahn-Klimroth
In many studies, we want to determine the influence of certain features on a dependent variable. More specifically, we are interested in the strength of the influence -- i.e., is t…
Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes
Max Hahn-Klimroth, Dominik Kaaser, Malin Rau
In the pooled data problem we are given agents with hidden state bits, either or . The hidden states are unknown and can be seen as the underlying ground truth . To u…
Inference of a Rumor's Source in the Independent Cascade Model
Petra Berenbrink, Max Hahn-Klimroth, Dominik Kaaser +2
We consider the so-called Independent Cascade Model for rumor spreading or epidemic processes popularized by Kempe et al.\ [2003]. In this model, a small subset of nodes from a net…
On the Hierarchy of Distributed Majority Protocols
Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard +3
We study the Consensus problem among agents, defined as follows. Initially, each agent holds one of two possible opinions. The goal is to reach a consensus configuration in whi…
Distributed Reconstruction of Noisy Pooled Data
Max Hahn-Klimroth, Dominik Kaaser
In the pooled data problem we are given a set of agents, each of which holds a hidden state bit, either or . A querying procedure returns for a query set the sum of the…
On the Parallel Reconstruction from Pooled Data
Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser +1
In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal , we can query multiple entries at on…