- Efficiently Decodable Low-Rate Codes Meeting Gilbert-Varshamov Bound
- Combinatorial Bounds for List Decoding Venkatesan Guruswami Johan Hastad y Madhu Sudan z David Zuckerman x
- Hardness of Approximate Hypergraph Coloring Venkatesan Guruswami Johan Hastad y Madhu Sudan z
- Algorithms for Modular Counting of Roots of Multivariate Polynomials
- Hardness of Max 3SAT with No Mixed Clauses Venkatesan Guruswami
- On the List-Decodability of Random Linear Codes Venkatesan Guruswami
- Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic VENKATESAN GURUSWAMI
- HARDNESS AMPLIFICATION VIA SPACE-EFFICIENT DIRECT PRODUCTS
- A Lower Bound on List Size for List Decoding Venkatesan Guruswami
- GURUSWAMI 1 Constructions of Codes from Number Fields
- A tight characterization of NP with 3 query PCPs Venkatesan Guruswami \Lambda Daniel Lewin \Lambda Madhu Sudan \Lambda Luca Trevisan \Lambday
- Maximum-Likelihood Decoding of Reed-Solomon Codes is NP-hard
- Tolerant Locally Testable Codes Venkatesan Guruswami
- Hardness of Learning Halfspaces with Noise Venkatesan Guruswami
- The 2Catalog Segmentation Problem Yevgeniy Dodis \Lambda Venkatesan Guruswami \Lambda Sanjeev Khanna y
- Linear time Encodable/Decodable Codes with Near-Optimal Rate Venkatesan Guruswami
- Finding almost-perfect graph bisections Venkatesan Guruswami1
- The Complexity of Making Unique Choices: Approximating 1ink SAT
- INTRACTABILITY RESULTS FOR CERTAIN GRAPH--THEORETIC OPTIMIZATION AND
- Improved Decoding of ReedSolomon and AlgebraicGeometry Codes
- List Decoding Algorithms for Certain Concatenated Codes Venkatesan Guruswami y Madhu Sudan z
- MATHEMATICS OF COMPUTATION Volume 77, Number 261, January 2008, Pages 447473
- Inapproximability Results for Set Splitting and Satis ability Problems with no Mixed Clauses
- Is Constraint Satisfaction Over Two Variables Always Easy? # Lars Engebretsen 1 ,## and Venkatesan Guruswami 2 ,# # #
- Euclidean sections of N 1 with sublinear
- Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy
- Decoding Concatenated Codes using Soft Information Venkatesan Guruswami
- AAECC-14, Melbourne, Australia, November 26 { November 30, 2001 Constructions of Codes from Number Fields
- Guessing Secrets E#ciently via List Decoding Noga Alon # Venkatesan Guruswami + Tali Kaufman # Madhu Sudan
- GURUSWAMI 1 List Decoding from Erasures: Bounds and
- Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010
- Hardness Amplification within NP against Deterministic Algorithms Parikshit Gopalan
- GURUSWAMI, H ASTAD, SUDAN, AND ZUCKERMAN 1
- Query-Ecient Checking of Proofs and Improved PCP Characterizations of NP
- Iterative Decoding of Low-Density Parity Check Codes (An Introductory Survey)
- Hardness Amplification within NP against Deterministic Algorithms
- Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
- Linear-time Codes to Correct a Maximum Possible Fraction of Errors
- Limits to List Decodability of Linear Codes Venkatesan Guruswami yz
- Explicit Interleavers for a Repeat Accumulate Accumulate (RAA) code construction
- Unconditional Proof of Tightness of Johnson Bound Venkatesan Guruswami Igor Shparlinski y
- Improved Inapproximability Results for Maximum k-Colorable Subgraph
- SIGACT News Complexity Theory Column 45 Lane A. Hemaspaandra
- Expanderbased Constructions of Efficiently Decodable Codes (Extended Abstract)
- Restrictions of Minimum Spanner Problems G. Venkatesan 1 U. Rotics 2 M.S. Madanlal ?1
- Re ections on \Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes"
- Soft decoding, dual BCH codes, and better list-decodable -biased codes
- Rapidly Mixing Markov Chains: A Comparison of Techniques Venkatesan Guruswami
- Unbalanced Expanders and Randomness Extractors from ParvareshVardy Codes
- Limits to List Decoding Reed-Solomon Codes Venkatesan Guruswami
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
- Foundations and Trends R Theoretical Computer Science
- SDP gaps for 2-to-1 and other Label-Cover Venkatesan Guruswami 1
- Agnostic Learning of Monomials by Halfspaces is Hard Vitaly Feldman Venkatesan Guruswami Prasad Raghavendra Yi Wu
- Error-correction up to the information-theoretic limit Venkatesan Guruswami
- mathematical sciences publishers Cyclotomic function fields, ArtinFrobenius
- New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min
- The Existence of Concatenated Codes List-Decodable up to the Hamming Bound
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- HARDNESS OF SOLVING SPARSE OVERDETERMINED LINEAR SYSTEMS: A 3-QUERY PCP OVER INTEGERS
- Hardness of Routing with Congestion in Directed Graphs Julia Chuzhoy
- Achieving List Decoding Capacity Using Folded Reed-Solomon Codes Venkatesan Guruswami and Atri Rudra
- List Decoding in Average-Case Complexity and Pseudorandomness
- The Complexity of the Covering Radius Problem on Lattices Venkatesan Guruswami
- Better Extractors for Better Codes? Venkatesan Guruswami
- Linear Time Encodable and List Decodable Codes (Extended Abstract)
- On Profit-Maximizing Envy-free Pricing Venkatesan Guruswami
- Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems
- Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness
- Approximate Triclique Coloring for Register Allocation G.Venkatesan C.Pandu Rangan y
- List Decoding with Side Information Venkatesan Guruswami
- Evidence for a Flat, Accelerating Universe and the CDM Model (8.942 Term Paper)
- Locally Testable Codes Require Redundant Testers Eli Ben-Sasson
- ``Softdecision'' Decoding of Chinese Remainder Codes Venkatesan Guruswami Amit Sahai y Madhu Sudan z
- Nearoptimal lineartime codes for unique decoding and new listdecodable codes over smaller alphabets
- Query Strategies for Priced Information Moses Charikar y Ronald Fagin z Venkatesan Guruswami x Jon Kleinberg {
- Multiclass Learning, Boosting, and ErrorCorrecting Codes Venkatesan Guruswami \Lambda
- Enumerative Aspects of Certain Subclasses of Perfect Graphs Venkatesan Guruswami \Lambda
- Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k 3 ")
- Better Binary List-Decodable Codes via Multilevel Concatenation Venkatesan Guruswami1
- On Representations of AlgebraicGeometric Codes Venkatesan Guruswami Madhu Sudan \Lambda
- Explicit CapacityAchieving ListDecodable Codes Decoding up to the Singleton Bound using
- Embeddings and Nonapproximability of Geometric Problems Venkatesan Guruswami # Piotr Indyk +
- On the Hardness of 4coloring a 3colorable Graph Venkatesan Guruswami y Sanjeev Khanna z
- List decoding of binary codes (A brief survey of some recent results)