No. Title Author Year
1 A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble Guruswami, Venkatesan et al. 2023
2 Accelerating Polarization via Alphabet Extension Duursma, Iwan et al. 2022
3 Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions Gabrys, Ryan et al. 2022
4 Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number Guruswami, Venkatesan et al. 2022
5 Front Matter, Table of Contents, Preface, Conference Organization Dawar, Anuj et al. 2022
6 LIPIcs, Volume 250, FSTTCS 2022, Complete Volume Dawar, Anuj et al. 2022
7 Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness Guruswami, Venkatesan et al. 2022
8 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201) Grohe, Martin et al. 2022
9 𝓁_p-Spread and Restricted Isometry Properties of Sparse Random Matrices Guruswami, Venkatesan et al. 2022
10 CNF Satisfiability in a Subspace and Related Problems Arvind, Vikraman et al. 2021
11 Conditional Dichotomy of Boolean Ordered Promise CSPs Brakensiek, Joshua et al. 2021
12 Pseudobinomiality of the Sticky Random Walk Guruswami, Venkatesan et al. 2021
13 Sharp Threshold Rates for Random Codes Guruswami, Venkatesan et al. 2021
14 Visible Rank and Codes with Locality Alrabiah, Omar et al. 2021
15 Bounds for List-Decoding and List-Recovery of Random Linear Codes Guruswami, Venkatesan et al. 2020
16 d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors Guruswami, Venkatesan et al. 2020
17 Leakage-Resilient Secret Sharing in Non-Compartmentalized Models Lin, Fuchun et al. 2020
18 Revisiting Alphabet Reduction in Dinur’s PCP Guruswami, Venkatesan et al. 2020
19 Beating Fredman-Komlós for Perfect k-Hashing Guruswami, Venkatesan et al. 2019
20 Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields Guruswami, Venkatesan et al. 2019
21 Rainbow Coloring Hardness via Low Sensitivity Polymorphisms Guruswami, Venkatesan et al. 2019
22 Streaming Hardness of Unique Games Guruswami, Venkatesan et al. 2019
23 Algorithmic Polarization for Hidden Markov Models Guruswami, Venkatesan et al. 2018
24 Hardness of Rainbow Coloring Hypergraphs Guruswami, Venkatesan et al. 2018
25 How Long Can Optimal Locally Repairable Codes Be? Guruswami, Venkatesan et al. 2018
26 Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs Guruswami, Venkatesan et al. 2018
27 Polar Codes with Exponentially Small Error at Finite Block Length Blasiok, Jaroslaw et al. 2018
28 Secret Sharing with Binary Shares Lin, Fuchun et al. 2018
29 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) Grohe, Martin et al. 2018
30 Efficiently Decodable Codes for the Binary Deletion Channel Guruswami, Venkatesan et al. 2017
31 Locality via Partially Lifted Codes Frank-Fischer, S. Luna et al. 2017
32 Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph Guruswami, Venkatesan et al. 2017
33 Subspace Designs Based on Algebraic Function Fields Guruswami, Venkatesan et al. 2017
34 Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere Bhattiprolu, Vijay et al. 2017
35 The Quest for Strong Inapproximability Results with Perfect Completeness Brakensiek, Joshua et al. 2017
36 New Hardness Results for Graph and Hypergraph Colorings Brakensiek, Joshua et al. 2016
37 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301) Bulatov, Andrei A. et al. 2016
38 Tight Bounds for Communication-Assisted Agreement Distillation Guruswami, Venkatesan et al. 2016
39 An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets Guruswami, Venkatesan et al. 2015
40 Approximate Hypergraph Coloring under Low-discrepancy and Related Promises Bhattiprolu, Vijay V. S. P. et al. 2015
41 Deletion Codes in the High-noise and High-rate Regimes Guruswami, Venkatesan et al. 2015
42 Dimension Expanders via Rank Condensers Forbes, Michael A. et al. 2015
43 Inapproximability of H-Transversal/Packing Guruswami, Venkatesan et al. 2015
44 Towards a Characterization of Approximation Resistance for Symmetric CSPs Guruswami, Venkatesan et al. 2015
45 Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes Guruswami, Venkatesan et al. 2014
46 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: 46


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