Venkatesan Guruswami

Venkatesan Guruswami is a Professor in the Department of Mathematics at the University of California, Berkeley. His research focuses on Applied Mathematics, with interests in Theory of Computing, Error-correcting codes, Combinatorics and Discrete Mathematics, Algebra and Computation, and Approximate optimization. He is also affiliated with the Department of Electrical Engineering and Computer Science and the Simons Institute for the Theory of Computing, where he serves as Director. His contact information is venkatg@berkeley.edu, and his personal website is available at https://math.berkeley.edu/people/faculty/venkatesan-guruswami.

Venkatesan Guruswami is a computational complexity theorist and algorithm designer at the University of California, Berkeley. His research spans algorithms, coding theory, and algebraic computation, with a focus on error-correcting codes, list decoding, and hardness of approximation. He has made significant contributions to the design of efficient algorithms for decoding Reed-Solomon and algebraic-geometric codes, as well as the development of expanders and randomness extractors. His work also includes theoretical studies on clustering, learning with noise, and combinatorial optimization problems such as edge-disjoint paths. Guruswami's research bridges theoretical computer science and practical coding applications.