Venkatesan Guruswami

Venkatesan Guruswami (born 1976) is a professor of computer science at Carnegie Mellon University in Pittsburgh, United States. He did his high schooling at Padma Seshadri Bala Bhavan in Chennai, India. He completed his undergraduate in Computer Science from IIT Madras and his doctorate from Massachusetts Institute of Technology under the supervision of Madhu Sudan in 2001 . After receiving his PhD, he spent a year at UC Berkeley as a Miller Fellow, and then was a member of the faculty at the University of Washington from 2002 to 2009. His primary area of research is computer science, and in particular on error-correcting codes. During 2007–2008, he visited the Institute for Advanced Study as a Member of School of Mathematics. He also visited SCS at Carnegie Mellon University during 2008–09 as a visiting faculty. In July 2009, he joined the School of Computer Science at Carnegie Mellon University as associate professor in the Computer Science Department.

Venkatesan Guruswami
Born1976
India
NationalityUS Citizen
Alma materIIT Madras
Massachusetts Institute of Technology
Scientific career
FieldsComputer Science
InstitutionsCarnegie Mellon University
Doctoral advisorMadhu Sudan

Guruswami was awarded the 2002 ACM Doctoral Dissertation Award for his dissertation List Decoding of Error-Correcting Codes. , which introduced an algorithm that allowed for the correction of errors beyond half the minimum distance of the code. It applies to Reed–Solomon codes and more generally to algebraic geometric codes. This algorithm produces a list of codewords (it is a list-decoding algorithm) and is based on interpolation and factorization of polynomials over and its extensions.

He was an invited speaker in International Congress of Mathematicians 2010, Hyderabad on the topic of "Mathematical Aspects of Computer Science."[1]

Guraswami was one of two winners of the 2012 Presburger Award, given by the European Association for Theoretical Computer Science for outstanding contributions by a young theoretical computer scientist.[2] He was elected as an ACM Fellow in 2017 [3] and as an IEEE Fellow in 2019 [4].

Selected publications
  • Guruswami, Venkatesan (2004). List Decoding of Error-Correcting Codes. Lecture Notes in Computer Science. Springer. ISBN 978-3-540-24051-8.
  • Guruswami, Venkatesan; Sudan, Madhu (1999). "Improved decoding of Reed-Solomon and algebraic-geometry codes". IEEE Transactions on Information Theory. 45 (6): 1757–1767. CiteSeerX 10.1.1.115.292. doi:10.1109/18.782097.
gollark: <@151391317740486657> If you can find a flaw in ECC I think you could also steal bitcoin...
gollark: If you have the private key, you can generate signatures for any startup. You don't, though. The stuff written onto disks *also* has a UUID embedded (on the more complex ones), which is part of the signed bit.
gollark: The signatures are programatically generated from the contents of the file and my private key. PotatOS has the *public* key, so it can verify that the signature was generated from the corresponding private key.
gollark: Um, no, that's not how it works.
gollark: Quick summary:- valid disks contain a signature file and a startup- the signature can be in the old table format or hexadecimal- only disks where the signature is valid for the code on them are executed

See also

References
  1. "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.
  2. Presburger Award 2012, EATCS, retrieved 2012-04-23.
  3. ACM Recognizes 2017 Fellows for Making Transformative Contributions and Advancing Technology in the Digital Age, Association for Computing Machinery, December 11, 2017, retrieved 2017-11-13
  4. IEEE Fellows, IEEE Information Theory Society, retrieved 2019-10-20
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.