No. Title Author Year
1 Beating Fredman-Komlós for Perfect k-Hashing Guruswami, Venkatesan et al. 2019
2 Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields Guruswami, Venkatesan et al. 2019
3 Rainbow Coloring Hardness via Low Sensitivity Polymorphisms Guruswami, Venkatesan et al. 2019
4 Streaming Hardness of Unique Games Guruswami, Venkatesan et al. 2019
5 Algorithmic Polarization for Hidden Markov Models Guruswami, Venkatesan et al. 2018
6 Hardness of Rainbow Coloring Hypergraphs Guruswami, Venkatesan et al. 2018
7 How Long Can Optimal Locally Repairable Codes Be? Guruswami, Venkatesan et al. 2018
8 Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs Guruswami, Venkatesan et al. 2018
9 Polar Codes with Exponentially Small Error at Finite Block Length Blasiok, Jaroslaw et al. 2018
10 Secret Sharing with Binary Shares Lin, Fuchun et al. 2018
Current Page :
Number of result pages: 3
Number of documents: 28


DROPS-Home | Imprint | Privacy Published by LZI