No. Title Author Year
1 Algorithmic Polarization for Hidden Markov Models Guruswami, Venkatesan et al. 2018
2 Hardness of Rainbow Coloring Hypergraphs Guruswami, Venkatesan et al. 2018
3 How Long Can Optimal Locally Repairable Codes Be? Guruswami, Venkatesan et al. 2018
4 Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs Guruswami, Venkatesan et al. 2018
5 Polar Codes with Exponentially Small Error at Finite Block Length Blasiok, Jaroslaw et al. 2018
6 Secret Sharing with Binary Shares Lin, Fuchun et al. 2018
7 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) Grohe, Martin et al. 2018
8 Efficiently Decodable Codes for the Binary Deletion Channel Guruswami, Venkatesan et al. 2017
9 Locality via Partially Lifted Codes Frank-Fischer, S. Luna et al. 2017
10 Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph Guruswami, Venkatesan et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 24


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