No. Title Author Year
1 𝓁_p-Spread and Restricted Isometry Properties of Sparse Random Matrices Guruswami, Venkatesan et al. 2022
2 CNF Satisfiability in a Subspace and Related Problems Arvind, Vikraman et al. 2021
3 Conditional Dichotomy of Boolean Ordered Promise CSPs Brakensiek, Joshua et al. 2021
4 Pseudobinomiality of the Sticky Random Walk Guruswami, Venkatesan et al. 2021
5 Sharp Threshold Rates for Random Codes Guruswami, Venkatesan et al. 2021
6 Visible Rank and Codes with Locality Alrabiah, Omar et al. 2021
7 Bounds for List-Decoding and List-Recovery of Random Linear Codes Guruswami, Venkatesan et al. 2020
8 d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors Guruswami, Venkatesan et al. 2020
9 Leakage-Resilient Secret Sharing in Non-Compartmentalized Models Lin, Fuchun et al. 2020
10 Revisiting Alphabet Reduction in Dinur’s PCP Guruswami, Venkatesan et al. 2020
11 Beating Fredman-Komlós for Perfect k-Hashing Guruswami, Venkatesan et al. 2019
12 Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields Guruswami, Venkatesan et al. 2019
13 Rainbow Coloring Hardness via Low Sensitivity Polymorphisms Guruswami, Venkatesan et al. 2019
14 Streaming Hardness of Unique Games Guruswami, Venkatesan et al. 2019
15 Algorithmic Polarization for Hidden Markov Models Guruswami, Venkatesan et al. 2018
16 Hardness of Rainbow Coloring Hypergraphs Guruswami, Venkatesan et al. 2018
17 How Long Can Optimal Locally Repairable Codes Be? Guruswami, Venkatesan et al. 2018
18 Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs Guruswami, Venkatesan et al. 2018
19 Polar Codes with Exponentially Small Error at Finite Block Length Blasiok, Jaroslaw et al. 2018
20 Secret Sharing with Binary Shares Lin, Fuchun et al. 2018
21 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) Grohe, Martin et al. 2018
22 Efficiently Decodable Codes for the Binary Deletion Channel Guruswami, Venkatesan et al. 2017
23 Locality via Partially Lifted Codes Frank-Fischer, S. Luna et al. 2017
24 Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph Guruswami, Venkatesan et al. 2017
25 Subspace Designs Based on Algebraic Function Fields Guruswami, Venkatesan et al. 2017
26 Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere Bhattiprolu, Vijay et al. 2017
27 The Quest for Strong Inapproximability Results with Perfect Completeness Brakensiek, Joshua et al. 2017
28 New Hardness Results for Graph and Hypergraph Colorings Brakensiek, Joshua et al. 2016
29 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301) Bulatov, Andrei A. et al. 2016
30 Tight Bounds for Communication-Assisted Agreement Distillation Guruswami, Venkatesan et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 38


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