No. Title Author Year
1 Efficiently Decodable Codes for the Binary Deletion Channel Guruswami, Venkatesan et al. 2017
2 Locality via Partially Lifted Codes Frank-Fischer, S. Luna et al. 2017
3 Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph Guruswami, Venkatesan et al. 2017
4 Subspace Designs Based on Algebraic Function Fields Guruswami, Venkatesan et al. 2017
5 Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere Bhattiprolu, Vijay et al. 2017
6 The Quest for Strong Inapproximability Results with Perfect Completeness Brakensiek, Joshua et al. 2017
7 New Hardness Results for Graph and Hypergraph Colorings Brakensiek, Joshua et al. 2016
8 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301) Bulatov, Andrei A. et al. 2016
9 Tight Bounds for Communication-Assisted Agreement Distillation Guruswami, Venkatesan et al. 2016
10 An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets Guruswami, Venkatesan et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 17

DROPS-Home | Fulltext Search | Imprint Published by LZI