Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time

Explore a 22-minute IEEE conference talk delving into combinatorial group testing and sparse recovery schemes, focusing on achieving near-optimal decoding time. Learn about the research conducted by Mahdi Cheraghchi from the University of Michigan-Ann Arbor and Vasileios Nakos from Saarland University, as they present their findings on innovative approaches to optimize these critical areas of study. Gain insights into the latest advancements in algorithmic efficiency and their potential applications in various fields of computer science and information theory.

Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time