Venkatesan Guruswami is a computer scientist whose research includes coding theory, computational complexity theory, pseudorandomness and the complexity of approximate optimization. A major focus is list decoding of error-correcting codes.[ref]
Ordinary unique decoding aims to recover one transmitted message; list decoding permits a bounded list of candidate messages when the received word has too many errors for uniqueness. The resulting questions connect the amount of redundancy in a error-correcting code with how much corruption can be handled efficiently. His research profile also describes work on approximate solutions to problems with NP-hardness.[ref]
Venkatesan Guruswami's Berkeley research homepage. Research, list decoding with optimal redundancy and approximate solutions to NP-hard problems
Identity source: theory.cs.berkeley.edu/
Portrait of Venkatesan Guruswami
. Photograph from University of California, Berkeley's official researcher profile. Source. Articles by others on the same topic
Venkatesan Guruswami is a notable computer scientist, particularly recognized for his work in the areas of coding theory, algorithms, and complexity. His research includes contributions to error-correcting codes, randomized algorithms, and various aspects of theoretical computer science. He has published numerous papers and has been associated with academic institutions and conferences within the field of computer science.