activity
20192022
most citedInformation-theoretic and algorithmic thresholds for group testing

30 citations · 72 across the 7 of their papers we have counts for

collaborators

8 papers

stat.ML2022★ 6 cited

Statistical and Computational Phase Transitions in Group Testing

Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +2

We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease within a population of size n, based on the outcomes of poo…

cs.DC2022

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…

cs.IT2021★ 2 cited

Note on the offspring distribution for group testing in the linear regime

Oliver Gebhard, Philipp Loick

The group testing problem is concerned with identifying a small set of infected individuals in a large population of people. At our disposal is a testing scheme that can te…

cs.IT2020★ 10 cited

Improved bounds for noisy group testing with constant tests per item

Oliver Gebhard, Oliver Johnson, Philipp Loick +1

The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that allows us to test sev…

cs.DS2020★ 4 cited

Near optimal sparsity-constrained group testing: improved bounds and algorithms

Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk +4

Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the subli…

cs.DM2019★ 20 cited

Optimal group testing

Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +1

In the group testing problem the aim is to identify a small set of infected individuals out of a population size , . We avail ourselves of a test procedure ca…

cs.DM2019

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…

cs.DM2019★ 30 cited

Information-theoretic and algorithmic thresholds for group testing

Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +1

In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multipl…