Venkatesan Guruswami

Venkatesan Guruswami
Name	Venkatesan Guruswami
Nationality	Indian
Fields	Theoretical computer science, Coding theory, Complexity theory
Workplaces	Carnegie Mellon University, Microsoft Research, University of California Berkeley
Alma mater	Indian Institute of Technology Madras, Massachusetts Institute of Technology
Doctoral advisor	Madhu Sudan
Known for	Guruswami–Sudan algorithm, list decoding, coding theory
Awards	IEEE Information Theory Society Paper Award, ACM Fellow

Venkatesan Guruswami is a theoretical computer scientist known for foundational work in coding theory, algorithms, and computational complexity. He has contributed substantially to list decoding, error-correcting codes, and probabilistically checkable proofs through research at leading institutions and collaborations with prominent researchers. His work has impacted practical and theoretical aspects of information transmission studied by scholars and practitioners across Carnegie Mellon University, Microsoft Research, University of California, Berkeley, Madhu Sudan, and the broader IEEE Information Theory Society community.

Early life and education

Guruswami completed undergraduate studies at Indian Institute of Technology Madras before pursuing graduate research at the Massachusetts Institute of Technology under the supervision of Madhu Sudan, earning a Ph.D. His formative years included interaction with scholars at Tata Institute of Fundamental Research, exposure to seminars at International Congress of Mathematicians, and participation in workshops organized by the Simons Institute for the Theory of Computing. During this period he collaborated informally with researchers from Stanford University, University of California, Berkeley, Princeton University, and Harvard University.

Academic career and positions

Guruswami has held faculty and research positions at institutions including Carnegie Mellon University and a visiting appointment at Microsoft Research. He served in roles engaging with programs at the Simons Institute for the Theory of Computing, the Institute for Advanced Study, and research exchanges with groups at ETH Zurich, École Polytechnique Fédérale de Lausanne, University of Cambridge, and Oxford University. He has been involved in mentoring students affiliated with Princeton University, University of Toronto, Columbia University, and collaborative projects with teams at Google Research and laboratories at Bell Labs. His teaching, advising, and departmental service connected him to networks at Indian Institute of Science, National University of Singapore, and Tsinghua University.

Research contributions and notable results

Guruswami co-developed the algorithmic framework known as the Guruswami–Sudan algorithm for list decoding of Reed–Solomon codes, improving bounds introduced by Vladimir Trifonov and building on work by Madhu Sudan and Aleksandr M. Lobachev. His results established polynomial-time list decoding up to the Johnson bound, influencing subsequent advances by researchers at ETH Zurich, Columbia University, and Princeton University. He contributed to construction of explicit error-correcting codes approaching the Shannon limit with efficient decoding, interacting conceptually with the Viterbi algorithm lineage and the theory advanced at Bell Laboratories and AT&T.

His work on list decoding linked to developments in probabilistically checkable proofs by connecting algebraic techniques to hardness of approximation results studied at Stanford University and Microsoft Research. He advanced combinatorial constructions such as expander-based code families that relate to the work of Salil Vadhan, Oded Goldreich, and Shafi Goldwasser. Guruswami also made contributions to the theory of lattices and pseudorandomness that engaged researchers at MIT, Harvard University, and University of California, Berkeley. Collaborative papers explored capacity-achieving codes for channels considered by Claude Shannon and complexity-theoretic implications studied by Richard M. Karp and Leslie Valiant.

His research repertoire includes explicit constructions of list-decodable codes, bounds on code parameters, and algorithmic techniques leveraging algebraic geometry linking to the literature from Goppa and Vladimir Drinfeld. He has influenced practical coding schemes evaluated by engineers at Qualcomm, Nokia, and standards bodies connected to 3GPP and IEEE.

Awards and honors

Guruswami's work has been recognized by awards and fellowships from bodies including the IEEE Information Theory Society and distinctions such as an ACM Fellow designation. He has received paper awards that reflect impact in venues like the IEEE International Symposium on Information Theory and prizes associated with the Association for Computing Machinery and the Simons Foundation. His invited talks and plenary addresses at conferences such as the International Congress of Mathematicians, the Conference on Learning Theory, and the Symposium on Theory of Computing attest to recognition from the American Mathematical Society and the National Academy of Sciences circles.

Selected publications

- Guruswami, V., Sudan, M., "Improved decoding of Reed–Solomon and algebraic-geometry codes", IEEE Transactions on Information Theory, influential in the literature from Claude Shannon and Richard Hamming. - Guruswami, V., "List decoding of error-correcting codes", proceedings and surveys presented at venues including STOC and FOCS and discussed alongside work at Princeton University. - Collaborative papers on explicit capacity-achieving codes appearing in collections associated with Simons Institute for the Theory of Computing and Microsoft Research. - Works on combinatorial constructions of codes and connections to probabilistically checkable proofs appearing in conference volumes of IEEE Symposium on Foundations of Computer Science and journals tied to the Association for Computing Machinery.

Category:Theoretical computer scientists Category:Coding theorists Category:Indian computer scientists