2017 - ACM Fellow For contributions to algorithmic coding theory, pseudorandomness, and the complexity of approximate optimization
2005 - Fellow of Alfred P. Sloan Foundation
Discrete mathematics, Combinatorics, List decoding, Linear code and Concatenated error correction code are his primary areas of study. His studies deal with areas such as Decoding methods and Bounded function as well as Discrete mathematics. His Decoding methods study incorporates themes from Binary code, Channel capacity, Coding theory and Redundancy.
His work deals with themes such as Computational complexity theory and Reed–Solomon error correction, which intersect with Combinatorics. His research integrates issues of Sequential decoding, Hamming code, Bipartite graph and Expander graph in his study of List decoding. He focuses mostly in the field of Linear code, narrowing it down to topics relating to Hamming distance and, in certain cases, Restricted isometry property, Order and Isometry.
His scientific interests lie mostly in Combinatorics, Discrete mathematics, List decoding, Linear code and Decoding methods. Combinatorics is frequently linked to Upper and lower bounds in his study. The concepts of his Discrete mathematics study are interwoven with issues in Fraction, Bounded function, Polynomial and Degree.
His List decoding research integrates issues from Sequential decoding, Hamming code and Reed–Solomon error correction. Block code covers Venkatesan Guruswami research in Linear code. He has researched Decoding methods in several fields, including Redundancy, Coding theory and Channel capacity.
Venkatesan Guruswami spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Omega and Bounded function. As a part of the same scientific study, he usually deals with the Combinatorics, concentrating on Linear code and frequently concerns with Hamming code. His Discrete mathematics study integrates concerns from other disciplines, such as List decoding, Polynomial and Binary number.
His List decoding research incorporates elements of Subspace topology, Integer, Algebraic number and Degree. Venkatesan Guruswami works mostly in the field of Polynomial, limiting it down to concerns involving Function and, occasionally, Algorithm. His Upper and lower bounds research includes elements of Code word, Code, Coding theory, Complement and Erasure code.
Venkatesan Guruswami mainly focuses on Discrete mathematics, Combinatorics, Upper and lower bounds, Code and Code word. He combines subjects such as Martingale, Polynomial and Bounded function with his study of Discrete mathematics. His research on Combinatorics frequently connects to adjacent areas such as Metric.
The Upper and lower bounds study combines topics in areas such as PSPACE, Binary code, Binary number, Complement and Erasure code. List decoding is closely connected to Concatenation in his research, which is encompassed under the umbrella topic of Code rate. In his research, Concatenated error correction code is intimately related to Linear code, which falls under the overarching field of Elliptic curve.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Improved decoding of Reed-Solomon and algebraic-geometry codes
V. Guruswami;M. Sudan.
IEEE Transactions on Information Theory (1999)
Improved decoding of Reed-Solomon and algebraic-geometric codes.
Venkatesan Guruswami;Madhu Sudan.
Electronic Colloquium on Computational Complexity (1998)
Clustering with qualitative information
Moses Charikar;Venkatesan Guruswami;Anthony Wirth.
Journal of Computer and System Sciences (2005)
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Venkatesan Guruswami;Christopher Umans;Salil Vadhan.
Journal of the ACM (2009)
On profit-maximizing envy-free pricing
Venkatesan Guruswami;Jason D. Hartline;Anna R. Karlin;David Kempe.
symposium on discrete algorithms (2005)
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
Alex Beutel;Wanhong Xu;Venkatesan Guruswami;Christopher Palow.
the web conference (2013)
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Venkatesan Guruswami;Sanjeev Khanna;Rajmohan Rajaraman;Bruce Shepherd.
Journal of Computer and System Sciences (2003)
List Decoding of Error-Correcting Codes
Venkatesan Guruswami;Madhu Sudan.
Multiclass learning, boosting, and error-correcting codes
Venkatesan Guruswami;Amit Sahai.
conference on learning theory (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: