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


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