Hardness of Routing with Congestion in Directed Graphs Julia Chuzhoy ∗ Venkatesan Guruswami

Source URL: ttic.uchicago.edu

SDP gaps for 2-to-1 and other Label-Cover variants Venkatesan Guruswami Computer Science Department Carnegie Mellon University Subhash Khot

Source URL: ttic.uchicago.edu

Presburger Award 2012 The Presburger Award Committee 2012, consisting of Monika Henzinger, Antonin Kucera, and Stefano Leonardi (chair) has unanimously decided to propose *************************************************

Source URL: www.eatcs.org

• Applied mathematics
• Mathematics
• Computational complexity theory
• List decoding
• Venkatesan Guruswami
• Probabilistic complexity theory
• Presburger Award
• Reed–Solomon error correction
• Probabilistically checkable proof
• Error detection and correction
• Theoretical computer science
• Coding theory

ATRI RUDRA Curriculum Vitae Department of Computer Science and Engineering 338 Davis Hall University at Buffalo, SUNY

Source URL: www.cse.buffalo.edu

• Applied mathematics
• Mathematics
• Computational complexity theory
• List decoding
• ACM SIGACT
• Venkatesan Guruswami
• Association for Computing Machinery
• Concatenated error correction code
• Coding theory
• Error detection and correction
• Theoretical computer science

Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes Venkatesan Guruswami Madhu Sudan

Source URL: people.csail.mit.edu

• Mathematics
• Algebra
• Finite fields
• Polynomials
• List decoding
• Reed–Solomon error correction
• BCH code
• Berlekamp–Massey algorithm
• Linear code
• Abstract algebra
• Coding theory
• Error detection and correction

Madhu Sudan Principal Researcher, Microsoft Research Areas of Special Interests Theory of Computer Science, Algorithms, Computational Complexity, Reliable Communication, Optimization. Ph.D. Title Efficient Checking of Po

Source URL: people.csail.mit.edu

• Symposium on Foundations of Computer Science
• Symposium on Theory of Computing
• Madhu Sudan
• Venkatesan Guruswami
• Sanjeev Arora
• Carsten Lund
• Ran Raz
• ACM SIGACT
• Applied mathematics
• Computer science
• Mathematical sciences

Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 Bridging Shannon and Hamming: List Error-Correction with Optimal Rate Venkatesan Guruswami

Source URL: www.cs.cmu.edu

• Mathematics
• Theoretical computer science
• List decoding
• Decoding methods
• Binary symmetric channel
• Linear code
• Low-density parity-check code
• Reed–Solomon error correction
• Forward error correction
• Coding theory
• Error detection and correction
• Discrete mathematics

Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy∗ Venkatesan Guruswami1† Atri Rudra2‡

Source URL: www.cs.cmu.edu

• Theoretical computer science
• Information
• List decoding
• Reed–Solomon error correction
• Concatenated error correction code
• Forward error correction
• Noisy-channel coding theorem
• Venkatesan Guruswami
• Code
• Coding theory
• Error detection and correction
• Mathematics

Iterative Decoding of Low-Density Parity Check Codes∗ (An Introductory Survey) Venkatesan Guruswami† Department of Computer Science and Engineering University of Washington

Source URL: www.cs.cmu.edu

• Information
• Information theory
• Mathematics
• Low-density parity-check code
• Forward error correction
• Binary symmetric channel
• Concatenated error correction code
• Noisy-channel coding theorem
• List decoding
• Coding theory
• Error detection and correction
• Discrete mathematics

On the List-Decodability of Random Linear Codes∗ Venkatesan Guruswami† Computer Science Dept. Carnegie Mellon University Johan H˚ astad ‡

Source URL: www.cs.cmu.edu

• List decoding
• Linear code
• Applied mathematics
• Walsh–Hadamard code
• GV-linear-code
• Coding theory
• Theoretical computer science
• Mathematics