No. |
Title |
Author |
Year |
---|

1 |
CNF Satisfiability in a Subspace and Related Problems |
Arvind, Vikraman et al. |
2021 |

2 |
Conditional Dichotomy of Boolean Ordered Promise CSPs |
Brakensiek, Joshua et al. |
2021 |

3 |
Pseudobinomiality of the Sticky Random Walk |
Guruswami, Venkatesan et al. |
2021 |

4 |
Sharp Threshold Rates for Random Codes |
Guruswami, Venkatesan et al. |
2021 |

5 |
Visible Rank and Codes with Locality |
Alrabiah, Omar et al. |
2021 |

6 |
Bounds for List-Decoding and List-Recovery of Random Linear Codes |
Guruswami, Venkatesan et al. |
2020 |

7 |
d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors |
Guruswami, Venkatesan et al. |
2020 |

8 |
Leakage-Resilient Secret Sharing in Non-Compartmentalized Models |
Lin, Fuchun et al. |
2020 |

9 |
Revisiting Alphabet Reduction in Dinur’s PCP |
Guruswami, Venkatesan et al. |
2020 |

10 |
Beating Fredman-Komlós for Perfect k-Hashing |
Guruswami, Venkatesan et al. |
2019 |

11 |
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields |
Guruswami, Venkatesan et al. |
2019 |

12 |
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms |
Guruswami, Venkatesan et al. |
2019 |

13 |
Streaming Hardness of Unique Games |
Guruswami, Venkatesan et al. |
2019 |

14 |
Algorithmic Polarization for Hidden Markov Models |
Guruswami, Venkatesan et al. |
2018 |

15 |
Hardness of Rainbow Coloring Hypergraphs |
Guruswami, Venkatesan et al. |
2018 |

16 |
How Long Can Optimal Locally Repairable Codes Be? |
Guruswami, Venkatesan et al. |
2018 |

17 |
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs |
Guruswami, Venkatesan et al. |
2018 |

18 |
Polar Codes with Exponentially Small Error at Finite Block Length |
Blasiok, Jaroslaw et al. |
2018 |

19 |
Secret Sharing with Binary Shares |
Lin, Fuchun et al. |
2018 |

20 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) |
Grohe, Martin et al. |
2018 |

21 |
Efficiently Decodable Codes for the Binary Deletion Channel |
Guruswami, Venkatesan et al. |
2017 |

22 |
Locality via Partially Lifted Codes |
Frank-Fischer, S. Luna et al. |
2017 |

23 |
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph |
Guruswami, Venkatesan et al. |
2017 |

24 |
Subspace Designs Based on Algebraic Function Fields |
Guruswami, Venkatesan et al. |
2017 |

25 |
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere |
Bhattiprolu, Vijay et al. |
2017 |

26 |
The Quest for Strong Inapproximability Results with Perfect Completeness |
Brakensiek, Joshua et al. |
2017 |

27 |
New Hardness Results for Graph and Hypergraph Colorings |
Brakensiek, Joshua et al. |
2016 |

28 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301) |
Bulatov, Andrei A. et al. |
2016 |

29 |
Tight Bounds for Communication-Assisted Agreement Distillation |
Guruswami, Venkatesan et al. |
2016 |

30 |
An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets |
Guruswami, Venkatesan et al. |
2015 |