Madhu Sudan

Trace reconstruction combines stats and algorithms to recover lost information from fragments.

Examining how errors impact knowledge accumulation and the importance of checks.

Learn how sparsification helps simplify hypergraphs while retaining key properties.

Exploring methods for correcting errors in linear functions over Boolean cubes.

Learn how hypergraph cut sparsifiers maintain essential features while reducing complexity.

Discover the journey to find the roots in tree-like networks.