No. Title Author Year
1 d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors Guruswami, Venkatesan et al. 2020
2 Leakage-Resilient Secret Sharing in Non-Compartmentalized Models Lin, Fuchun et al. 2020
3 Beating Fredman-Komlós for Perfect k-Hashing Guruswami, Venkatesan et al. 2019
4 Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields Guruswami, Venkatesan et al. 2019
5 Rainbow Coloring Hardness via Low Sensitivity Polymorphisms Guruswami, Venkatesan et al. 2019
6 Streaming Hardness of Unique Games Guruswami, Venkatesan et al. 2019
7 Algorithmic Polarization for Hidden Markov Models Guruswami, Venkatesan et al. 2018
8 Hardness of Rainbow Coloring Hypergraphs Guruswami, Venkatesan et al. 2018
9 How Long Can Optimal Locally Repairable Codes Be? Guruswami, Venkatesan et al. 2018
10 Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs Guruswami, Venkatesan et al. 2018
11 Polar Codes with Exponentially Small Error at Finite Block Length Blasiok, Jaroslaw et al. 2018
12 Secret Sharing with Binary Shares Lin, Fuchun et al. 2018
13 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) Grohe, Martin et al. 2018
14 Efficiently Decodable Codes for the Binary Deletion Channel Guruswami, Venkatesan et al. 2017
15 Locality via Partially Lifted Codes Frank-Fischer, S. Luna et al. 2017
16 Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph Guruswami, Venkatesan et al. 2017
17 Subspace Designs Based on Algebraic Function Fields Guruswami, Venkatesan et al. 2017
18 Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere Bhattiprolu, Vijay et al. 2017
19 The Quest for Strong Inapproximability Results with Perfect Completeness Brakensiek, Joshua et al. 2017
20 New Hardness Results for Graph and Hypergraph Colorings Brakensiek, Joshua et al. 2016
21 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301) Bulatov, Andrei A. et al. 2016
22 Tight Bounds for Communication-Assisted Agreement Distillation Guruswami, Venkatesan et al. 2016
23 An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets Guruswami, Venkatesan et al. 2015
24 Approximate Hypergraph Coloring under Low-discrepancy and Related Promises Bhattiprolu, Vijay V. S. P. et al. 2015
25 Deletion Codes in the High-noise and High-rate Regimes Guruswami, Venkatesan et al. 2015
26 Dimension Expanders via Rank Condensers Forbes, Michael A. et al. 2015
27 Inapproximability of H-Transversal/Packing Guruswami, Venkatesan et al. 2015
28 Towards a Characterization of Approximation Resistance for Symmetric CSPs Guruswami, Venkatesan et al. 2015
29 Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes Guruswami, Venkatesan et al. 2014
30 Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk) Guruswami, Venkatesan 2013
Current Page :
Number of result pages: 1
Number of documents: 30


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI