The following pages link to Venkatesan Guruswami (Q293456):
Displaying 50 items.
- (Q189689) (redirect page) (← links)
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Optimal rate algebraic list decoding using narrow ray class fields (Q472174) (← links)
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Query strategies for priced information (Q696973) (← links)
- The query complexity of estimating weighted averages (Q766183) (← links)
- The complexity of the covering radius problem (Q814418) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- Cyclotomic function fields, Artin-Frobenius automorphisms, and list error correction with optimal rate (Q983514) (← links)
- Enumerative aspects of certain subclasses of perfect graphs (Q1301836) (← links)
- Maximum cut on line and total graphs (Q1304481) (← links)
- Strong inapproximability results on balanced rainbow-colorable hypergraphs (Q1715058) (← links)
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition (Q1780828) (← links)
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses (Q1879246) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Beating Fredman-Komlós for perfect \(k\)-hashing (Q2077264) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
- Hardness amplification via space-efficient direct products (Q2269003) (← links)
- Explicit subspace designs (Q2400105) (← links)
- Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- (Q2753735) (← links)
- (Q2753940) (← links)
- (Q2816412) (← links)
- List decoding subspace codes from insertions and deletions (Q2826055) (← links)
- Combinatorial Limitations of Average-Radius List Decoding (Q2851888) (← links)
- On the list-decodability of random linear codes (Q2875168) (← links)
- (Q2913811) (← links)
- (Q2921702) (← links)
- (Q2921790) (← links)
- Explicit capacity-achieving list-decodable codes (Q2931364) (← links)
- Hardness of Solving Sparse Overdetermined Linear Systems (Q2947543) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes (Q2969660) (← links)
- Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs (Q2976856) (← links)
- Capacity of Non-Malleable Codes (Q2976946) (← links)
- Polar Codes: Speed of Polarization and Polynomial Gap to Capacity (Q2978798) (← links)
- An Improved Bound on the Fraction of Correctable Deletions (Q2979079) (← links)
- Combinatorial Limitations of Average-Radius List-Decoding (Q2983382) (← links)
- Capacity of non-malleable codes (Q2988875) (← links)
- Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
- Communication with Imperfectly Shared Randomness (Q2989037) (← links)
- (Q3002775) (← links)
- Optimal Rate List Decoding via Derivative Codes (Q3088129) (← links)
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627) (← links)
