Oliver Gebhard

Img 4309


My name is Oliver Gebhard and I am a PhD-student of Amin Coja-Oghlan. The research is funded by the German Research Fund. Further information about the objectives of the project are available here.

Research Interests

  • Random Structures
  • Algorithms
  • Statistical Inference
  • Probabilistic combinatorics

Research projects


  • Information-Theoretic and Algorithmic Thresholds for Group Testing [Arxiv]                                        (Proceedings: ICALP 2019, Journal: IEEE Transactions on Information Theory 2020)
  • Optimal  Group Testing [Arxiv] (Proceedings: COLT'20)


  • Quantitative Group Testing in the sublinear regime [Arxiv]
  • Near-Optimal  Sparsity-Constrained Group Testing: Improved Bounds and Algorithms [Arxiv]
  • Improved Bounds for noisy Group Testing with constant test per item [Arxiv]


Past events


  • Randon Structures and Algorithms 2019 (ETH Zurich)
  • Workshop on Local Algorithms 2019 (ETH Zurich)
  • 40 years Replica Symmetry Breaking 2019 (Sapienza University Rome)
  • Algorithms UK 2019 (University of Warwick)
  • Games,Optimization and Optimism 2020 (Weizman Institute)
  • Winter School on "Recent progress in glassy systems"  2020 (Les Houches School of Physics)
  • Workshop "Youth in High-Dimensions" 2020 (ICTP Online)


  • Talk at Workshop on Local Algorithms 2019 (ETH Zurich)
  • Talk at Combinatorics Literature Seminar 2020 (University of Illinois)
  • Poster at IEEE European School of Information Theory 2020 (University of Stuttgart)

Organizing Committee:

  • Workshop "Inference Problems: Algorithms and Lower Bounds" 2020 (Goethe University Online)