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

1 |
Accelerating Polarization via Alphabet Extension |
Duursma, Iwan et al. |
2022 |

2 |
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions |
Gabrys, Ryan et al. |
2022 |

3 |
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number |
Guruswami, Venkatesan et al. |
2022 |

4 |
Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness |
Guruswami, Venkatesan et al. |
2022 |

5 |
đ_p-Spread and Restricted Isometry Properties of Sparse Random Matrices |
Guruswami, Venkatesan et al. |
2022 |

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

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

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

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

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

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

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

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

14 |
Revisiting Alphabet Reduction in Dinurâs PCP |
Guruswami, Venkatesan et al. |
2020 |

15 |
Beating Fredman-KomlĂłs for Perfect k-Hashing |
Guruswami, Venkatesan et al. |
2019 |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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