The SCEAS System
| |||||||

## Search the dblp DataBase
Venkatesan Guruswami:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Venkatesan Guruswami
**Constructions of Codes from Number Fields.**[Citation Graph (0, 0)][DBLP] AAECC, 2001, pp:129-140 [Conf] - Venkatesan Guruswami
**Inapproximability results for set splitting and satisfiability problems with no mixed clauses.**[Citation Graph (0, 0)][DBLP] APPROX, 2000, pp:155-166 [Conf] - Venkatesan Guruswami, Atri Rudra
**Tolerant Locally Testable Codes.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:306-317 [Conf] - Venkatesan Guruswami, Luca Trevisan
**The Complexity of Making Unique Choices: Approximating 1-in- k SAT.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:99-110 [Conf] - Venkatesan Guruswami, Salil P. Vadhan
**A Lower Bound on List Size for List Decoding.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:318-329 [Conf] - Venkatesan Guruswami
**List Decoding with Side Information.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:300-0 [Conf] - Venkatesan Guruswami, Sanjeev Khanna
**On the Hardness of 4-Coloring a 3-Colorable Graph.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:188-197 [Conf] - Venkatesan Guruswami, Subhash Khot
**Hardness of Max 3SAT with No Mixed Clauses.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:154-162 [Conf] - Venkatesan Guruswami, Daniele Micciancio, Oded Regev
**The Complexity of the Covering Radius Problem on Lattices and Codes.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:161-173 [Conf] - Venkatesan Guruswami, Madhu Sudan
**Decoding Concatenated Codes using Soft Information.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:148-157 [Conf] - Venkatesan Guruswami, Amit Sahai
**Multiclass Learning, Boosting, and Error-Correcting Codes.**[Citation Graph (0, 0)][DBLP] COLT, 1999, pp:145-155 [Conf] - Venkatesan Guruswami, Madhu Sudan
**On Representations of Algebraic-Geometric Codes for List Decoding.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:244-255 [Conf] - Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
**Combinatorial feature selection problems.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:631-640 [Conf] - Moses Charikar, Venkatesan Guruswami, Anthony Wirth
**Clustering with Qualitative Information.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:524-533 [Conf] - Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan
**A Tight Characterization of NP with 3 Query PCPs.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:8-17 [Conf] - Venkatesan Guruswami, Johan Håstad, Madhu Sudan
**Hardness of Approximate Hypergraph Coloring.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:149-158 [Conf] - Venkatesan Guruswami, Piotr Indyk
**Expander-Based Constructions of Efficiently Decodable Codes.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:658-667 [Conf] - Venkatesan Guruswami, Madhu Sudan
**Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:28-39 [Conf] - Venkatesan Guruswami, Amit Sahai, Madhu Sudan
**"Soft-decision" Decoding of Chinese Remainder Codes.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:159-168 [Conf] - Venkatesan Guruswami, Prasad Raghavendra
**Hardness of Learning Halfspaces with Noise.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:543-552 [Conf] - Venkatesan Guruswami, Anindya C. Patthak
**Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:227-238 [Conf] - Venkatesan Guruswami
**List Decoding from Erasures: Bounds and Code Constructions.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:195-206 [Conf] - Venkatesan Guruswami, Piotr Indyk
**Linear-Time List Decoding in Error-Free Settings: (Extended Abstract).**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:695-707 [Conf] - Venkatesan Guruswami
**On 2-Query Codeword Testing with Near-Perfect Completeness.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:267-276 [Conf] - Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
**Algorithms for Modular Counting of Roots of Multivariate Polynomials.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:544-555 [Conf] - Venkatesan Guruswami, Valentine Kabanets
**Hardness Amplification Via Space-Efficient Direct Products.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:556-568 [Conf] - Lars Engebretsen, Venkatesan Guruswami
**Is Constraint Satisfaction Over Two Variables Always Easy?**[Citation Graph (0, 0)][DBLP] RANDOM, 2002, pp:224-238 [Conf] - Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan
**Guessing secrets efficiently via list decoding.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:254-262 [Conf] - Yevgeniy Dodis, Venkatesan Guruswami, Sanjeev Khanna
**The 2-Catalog Segmentation Problem.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:897-898 [Conf] - Ioannis Giotis, Venkatesan Guruswami
**Correlation clustering with a fixed number of clusters.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1167-1176 [Conf] - Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, Frank McSherry
**On profit-maximizing envy-free pricing.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:1164-1173 [Conf] - Venkatesan Guruswami, Piotr Indyk
**Embeddings and non-approximability of geometric problems.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:537-538 [Conf] - Venkatesan Guruswami, Piotr Indyk
**Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:756-757 [Conf] - Venkatesan Guruswami, Igor Shparlinski
**Unconditional proof of tightness of Johnson bound.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:754-755 [Conf] - Venkatesan Guruswami, Alexander Vardy
**Maximum-likelihood decoding of Reed-Solomon codes is NP-hard.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:470-478 [Conf] - Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
**Query strategies for priced information (extended abstract).**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:582-591 [Conf] - Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
**A new multilayered PCP and the hardness of hypergraph vertex cover.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:595-601 [Conf] - Venkatesan Guruswami
**Limits to list decodability of linear codes.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:802-811 [Conf] - Venkatesan Guruswami
**Better extractors for better codes?**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:436-444 [Conf] - Venkatesan Guruswami, Piotr Indyk
**Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:812-821 [Conf] - Venkatesan Guruswami, Piotr Indyk
**Linear time encodable and list decodable codes.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:126-135 [Conf] - Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
**Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:19-28 [Conf] - Venkatesan Guruswami, Atri Rudra
**Limits to list decoding Reed-Solomon codes.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:602-609 [Conf] - Venkatesan Guruswami, Atri Rudra
**Explicit capacity-achieving list-decodable codes.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:1-10 [Conf] - Venkatesan Guruswami, Madhu Sudan
**List decoding algorithms for certain concatenated codes.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:181-190 [Conf] - Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
**The Vertex-Disjoint Triangles Problem.**[Citation Graph (0, 0)][DBLP] WG, 1998, pp:26-37 [Conf] - Venkatesan Guruswami
**Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:38, n:3, pp:451-469 [Journal] - Venkatesan Guruswami, Daniele Micciancio, Oded Regev
**The complexity of the covering radius problem.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2005, v:14, n:2, pp:90-121 [Journal] - Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
**The K**[Citation Graph (0, 0)][DBLP]_{r}-Packing Problem. Computing, 2001, v:66, n:1, pp:79-89 [Journal] - Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
**A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Venkatesan Guruswami, Alexander Vardy
**Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - Venkatesan Guruswami
**Maximum Cut on Line and Total Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:217-221 [Journal] - Venkatesan Guruswami, C. Pandu Rangan
**Algorithmic aspects of clique-transversal and clique-independent sets.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:100, n:3, pp:183-202 [Journal] - Venkatesan Guruswami
**Constructions of Codes from Number Fields**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:2, pp:- [Journal] - Venkatesan Guruswami, Johan Håstad, Madhu Sudan
**Hardness of approximate hypergraph coloring**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:62, pp:- [Journal] - Venkatesan Guruswami, Sanjeev Khanna
**On the Hardness of 4-coloring a 3-colorable Graph**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:73, pp:- [Journal] - Irit Dinur, Venkatesan Guruswami, Subhash Khot
**Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon)**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:027, pp:- [Journal] - Lars Engebretsen, Venkatesan Guruswami
**Is Constraint Satisfaction Over Two Variables Always Easy?**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:053, pp:- [Journal] - Venkatesan Guruswami
**Better Extractors for Better Codes?**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:080, pp:- [Journal] - Venkatesan Guruswami, Alexander Vardy
**Maximum-likelihood decoding of Reed-Solomon codes is NP-hard**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:040, pp:- [Journal] - Venkatesan Guruswami, Atri Rudra
**Tolerant Locally Testable Codes**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:019, pp:- [Journal] - Venkatesan Guruswami, Valentine Kabanets
**Hardness amplification via space-efficient direct products**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:057, pp:- [Journal] - Venkatesan Guruswami
**Algebraic-geometric generalizations of the Parvaresh-Vardy codes**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:132, pp:- [Journal] - Venkatesan Guruswami, Atri Rudra
**Explicit Capacity-Achieving List-Decodable Codes**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:133, pp:- [Journal] - Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan
**A tight characterization of NP with 3 query PCPs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:34, pp:- [Journal] - Venkatesan Guruswami, Madhu Sudan
**Improved decoding of Reed-Solomon and algebraic-geometric codes.**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:43, pp:- [Journal] - Venkatesan Guruswami
**The Approximability of Set Splitting Problems and Satisfiability Problems with no Mixed Clauses**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:43, pp:- [Journal] - Venkatesan Guruswami, C. Pandu Rangan
**A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:5, pp:241-248 [Journal] - Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
**Query Strategies for Priced Information.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:64, n:4, pp:785-819 [Journal] - Moses Charikar, Venkatesan Guruswami, Anthony Wirth
**Clustering with qualitative information.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:3, pp:360-383 [Journal] - Edith Cohen, Venkatesan Guruswami
**Guest Editors' foreword.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:4, pp:701- [Journal] - Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
**Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:3, pp:473-496 [Journal] - Lars Engebretsen, Venkatesan Guruswami
**Is constraint satisfaction over two variables always easy?**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2004, v:25, n:2, pp:150-178 [Journal] - Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
**A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:5, pp:1129-1146 [Journal] - Venkatesan Guruswami, Johan Håstad, Madhu Sudan
**Hardness of Approximate Hypergraph Coloring.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:6, pp:1663-1686 [Journal] - Venkatesan Guruswami, Sanjeev Khanna
**On the Hardness of 4-Coloring a 3-Colorable Graph.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:18, n:1, pp:30-40 [Journal] - Venkatesan Guruswami
**Constructions of codes from number fields.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:3, pp:594-603 [Journal] - Venkatesan Guruswami
**List decoding from erasures: bounds and code constructions.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:11, pp:2826-2833 [Journal] - Venkatesan Guruswami, Johan Håstad, Madhu Sudan, David Zuckerman
**Combinatorial bounds for list decoding.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:5, pp:1021-1034 [Journal] - Venkatesan Guruswami, Piotr Indyk
**Linear-time encodable/decodable codes with near-optimal rate.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:10, pp:3393-3400 [Journal] - Venkatesan Guruswami, Madhu Sudan
**On representations of algebraic-geometry codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1610-1613 [Journal] - Venkatesan Guruswami, Madhu Sudan
**Improved decoding of Reed-Solomon and algebraic-geometry codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1757-1767 [Journal] - Venkatesan Guruswami, Alexander Vardy
**Maximum-likelihood decoding of Reed-Solomon codes is NP-hard.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2249-2256 [Journal] - Venkatesan Guruswami, Atri Rudra
**Limits to List Decoding Reed-Solomon Codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3642-3649 [Journal] - Venkatesan Guruswami, Atri Rudra
**Better Binary List-Decodable Codes Via Multilevel Concatenation.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:554-568 [Conf] - Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
**Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:96-108 [Conf] - Venkatesan Guruswami, Prasad Raghavendra
**A 3-query PCP over integers.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:198-206 [Conf] - Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar
**Hardness of routing with congestion in directed graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:165-178 [Conf] - Venkatesan Guruswami, Valentine Kabanets
**Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2007, v:16, n:2, pp:113-114 [Journal] - Venkatesan Guruswami
**Iterative Decoding of Low-Density Parity Check Codes (A Survey)**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Ioannis Giotis, Venkatesan Guruswami
**Correlation Clustering with a Fixed Number of Clusters**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Venkatesan Guruswami
**Enumerative aspects of certain subclasses of perfect graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:205, n:1-3, pp:97-117 [Journal] **List Decoding and Pseudorandom Constructions.**[Citation Graph (, )][DBLP]**Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals.**[Citation Graph (, )][DBLP]**Improved Inapproximability Results for Maximum k-Colorable Subgraph.**[Citation Graph (, )][DBLP]**Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness.**[Citation Graph (, )][DBLP]**Hardness Amplification within NP against Deterministic Algorithms.**[Citation Graph (, )][DBLP]**Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes.**[Citation Graph (, )][DBLP]**Every Permutation CSP of arity 3 is Approximation Resistant.**[Citation Graph (, )][DBLP]**Locally Testable Codes Require Redundant Testers.**[Citation Graph (, )][DBLP]**Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph.**[Citation Graph (, )][DBLP]**Agnostic Learning of Monomials by Halfspaces Is Hard.**[Citation Graph (, )][DBLP]**On the Inapproximability of Vertex Cover on**[Citation Graph (, )][DBLP]*k*-Partite*k*-Uniform Hypergraphs.**SDP Gaps for 2-to-1 and Other Label-Cover Variants.**[Citation Graph (, )][DBLP]**Concatenated codes can achieve list-decoding capacity.**[Citation Graph (, )][DBLP]**Almost Euclidean subspaces of l**[Citation Graph (, )][DBLP]^{N}_{1}via expander codes.**List decoding tensor products and interleaved codes.**[Citation Graph (, )][DBLP]**Artin automorphisms, cyclotomic function fields, and folded list-decodable codes.**[Citation Graph (, )][DBLP]**MaxMin allocation via degree lower-bounded arborescences.**[Citation Graph (, )][DBLP]**On the list-decodability of random linear codes.**[Citation Graph (, )][DBLP]**List Error-Correction with Optimal Information Rate (Invited Talk).**[Citation Graph (, )][DBLP]**List Decoding of Binary Codes-A Brief Survey of Some Recent Results.**[Citation Graph (, )][DBLP]**Algorithms for Modular Counting of Roots of Multivariate Polynomials.**[Citation Graph (, )][DBLP]**Error correction up to the information-theoretic limit.**[Citation Graph (, )][DBLP]**Hardness Amplification via Space-Efficient Direct Products.**[Citation Graph (, )][DBLP]**Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy**[Citation Graph (, )][DBLP]**List Decoding Tensor Products and Interleaved Codes**[Citation Graph (, )][DBLP]**Artin automorphisms, Cyclotomic function fields, and Folded list-decodable codes**[Citation Graph (, )][DBLP]**Improved Inapproximability Results for Maximum k-Colorable Subgraph**[Citation Graph (, )][DBLP]**Explicit Capacity-achieving Codes for Worst-Case Additive Errors**[Citation Graph (, )][DBLP]**On the List-Decodability of Random Linear Codes**[Citation Graph (, )][DBLP]**Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate**[Citation Graph (, )][DBLP]**Soft decoding, dual BCH codes, and better list-decodable eps-biased codes.**[Citation Graph (, )][DBLP]**Concatenated codes can achieve list-decoding capacity.**[Citation Graph (, )][DBLP]**List Decoding Tensor Products and Interleaved Codes.**[Citation Graph (, )][DBLP]**Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness.**[Citation Graph (, )][DBLP]**Almost Euclidean subspaces of $\ell_1^N$ via expander codes.**[Citation Graph (, )][DBLP]**Deterministic Hardness Amplification via Local GMD Decoding.**[Citation Graph (, )][DBLP]**Better Binary List-Decodable Codes via Multilevel Concatenation.**[Citation Graph (, )][DBLP]**Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.**[Citation Graph (, )][DBLP]**Hardness of Learning Halfspaces with Noise.**[Citation Graph (, )][DBLP]**Hardness of Low Congestion Routing in Directed Graphs.**[Citation Graph (, )][DBLP]**Iterative Decoding of Low-Density Parity Check Codes (A Survey).**[Citation Graph (, )][DBLP]**Extractors and condensers from univariate polynomials.**[Citation Graph (, )][DBLP]
Search in 0.052secs, Finished in 0.061secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |