No. Title Author Year
1 Hardness of Rainbow Coloring Hypergraphs Guruswami, Venkatesan et al. 2018
2 How Long Can Optimal Locally Repairable Codes Be? Guruswami, Venkatesan et al. 2018
3 Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs Guruswami, Venkatesan et al. 2018
4 Polar Codes with Exponentially Small Error at Finite Block Length Blasiok, Jaroslaw et al. 2018
5 Efficiently Decodable Codes for the Binary Deletion Channel Guruswami, Venkatesan et al. 2017
6 Locality via Partially Lifted Codes Frank-Fischer, S. Luna et al. 2017
7 Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph Guruswami, Venkatesan et al. 2017
8 Subspace Designs Based on Algebraic Function Fields Guruswami, Venkatesan et al. 2017
9 Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere Bhattiprolu, Vijay et al. 2017
10 The Quest for Strong Inapproximability Results with Perfect Completeness Brakensiek, Joshua et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 21


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