The following pages link to Venkatesan Guruswami (Q293456):
Displaying 50 items.
- (Q3096712) (← links)
- List Decoding Tensor Products and Interleaved Codes (Q3115873) (← links)
- Hardness of Approximate Hypergraph Coloring (Q3149889) (← links)
- Is constraint satisfaction over two variables always easy? (Q3156915) (← links)
- Approximating Bounded Occurrence Ordering CSPs (Q3167393) (← links)
- Improved inapproximability results for maximum \(k\)-colorable subgraph (Q3191580) (← links)
- List decoding algorithms for certain concatenated codes (Q3191984) (← links)
- Query strategies for priced information (extended abstract) (Q3192028) (← links)
- Iterative Decoding of Low-Density Parity Check Codes (A Survey) (Q3396594) (← links)
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes (Q3452216) (← links)
- Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (Q3453563) (← links)
- Algorithms for Modular Counting of Roots of Multivariate Polynomials (Q3525790) (← links)
- Hardness Amplification Via Space-Efficient Direct Products (Q3525791) (← links)
- Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness (Q3541788) (← links)
- Euclidean Sections of $\ell_1^N$ with Sublinear Randomness and Error-Correction over the Reals (Q3541811) (← links)
- List decoding from erasures: bounds and code constructions (Q3546962) (← links)
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate (Q3546963) (← links)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964) (← links)
- Limits to List Decoding Reed–Solomon Codes (Q3547901) (← links)
- (Q3549611) (← links)
- (Q3549614) (← links)
- Hardness of Learning Halfspaces with Noise (Q3558021) (← links)
- Limits to list decodability of linear codes (Q3579196) (← links)
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (Q3579197) (← links)
- Almost Euclidean subspaces of \ell_1^N via expander codes (Q3579399) (← links)
- (Q3579474) (← links)
- Better extractors for better codes? (Q3580988) (← links)
- A new multilayered PCP and the hardness of hypergraph vertex cover (Q3581279) (← links)
- Linear time encodable and list decodable codes (Q3581290) (← links)
- Limits to list decoding Reed-Solomon codes (Q3581453) (← links)
- Correlation clustering with a fixed number of clusters (Q3583431) (← links)
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (Q3587391) (← links)
- SDP Gaps for 2-to-1 and Other Label-Cover Variants (Q3587413) (← links)
- Better Binary List-Decodable Codes Via Multilevel Concatenation (Q3603493) (← links)
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy (Q3604484) (← links)
- Improved Inapproximability Results for Maximum k-Colorable Subgraph (Q3638876) (← links)
- (Q4232775) (← links)
- (Q4252398) (← links)
- (Q4440440) (← links)
- (Q4471341) (← links)
- (Q4471368) (← links)
- (Q4474218) (← links)
- (Q4474248) (← links)
- Improved decoding of Reed-Solomon and algebraic-geometry codes (Q4503371) (← links)
- On representations of algebraic-geometry codes (Q4544598) (← links)
- Communication With Imperfectly Shared Randomness (Q4566528) (← links)
- Nearly Optimal NP-Hardness of Unique Coverage (Q4575703) (← links)
- Efficient Low-Redundancy Codes for Correcting Multiple Deletions (Q4575716) (← links)
- An improved bound on the fraction of correctable deletions (Q4575717) (← links)
- MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth (Q4575885) (← links)
