| 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 |
Front Matter, Table of Contents, Preface, Conference Organization |
Dawar, Anuj et al. |
2022 |
| 5 |
LIPIcs, Volume 250, FSTTCS 2022, Complete Volume |
Dawar, Anuj et al. |
2022 |
| 6 |
Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness |
Guruswami, Venkatesan et al. |
2022 |
| 7 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201) |
Grohe, Martin et al. |
2022 |
| 8 |
đ_p-Spread and Restricted Isometry Properties of Sparse Random Matrices |
Guruswami, Venkatesan et al. |
2022 |
| 9 |
CNF Satisfiability in a Subspace and Related Problems |
Arvind, Vikraman et al. |
2021 |
| 10 |
Conditional Dichotomy of Boolean Ordered Promise CSPs |
Brakensiek, Joshua et al. |
2021 |
| 11 |
Pseudobinomiality of the Sticky Random Walk |
Guruswami, Venkatesan et al. |
2021 |
| 12 |
Sharp Threshold Rates for Random Codes |
Guruswami, Venkatesan et al. |
2021 |
| 13 |
Visible Rank and Codes with Locality |
Alrabiah, Omar et al. |
2021 |
| 14 |
Bounds for List-Decoding and List-Recovery of Random Linear Codes |
Guruswami, Venkatesan et al. |
2020 |
| 15 |
d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors |
Guruswami, Venkatesan et al. |
2020 |
| 16 |
Leakage-Resilient Secret Sharing in Non-Compartmentalized Models |
Lin, Fuchun et al. |
2020 |
| 17 |
Revisiting Alphabet Reduction in Dinurâs PCP |
Guruswami, Venkatesan et al. |
2020 |
| 18 |
Beating Fredman-KomlĂłs for Perfect k-Hashing |
Guruswami, Venkatesan et al. |
2019 |
| 19 |
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields |
Guruswami, Venkatesan et al. |
2019 |
| 20 |
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms |
Guruswami, Venkatesan et al. |
2019 |
| 21 |
Streaming Hardness of Unique Games |
Guruswami, Venkatesan et al. |
2019 |
| 22 |
Algorithmic Polarization for Hidden Markov Models |
Guruswami, Venkatesan et al. |
2018 |
| 23 |
Hardness of Rainbow Coloring Hypergraphs |
Guruswami, Venkatesan et al. |
2018 |
| 24 |
How Long Can Optimal Locally Repairable Codes Be? |
Guruswami, Venkatesan et al. |
2018 |
| 25 |
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs |
Guruswami, Venkatesan et al. |
2018 |
| 26 |
Polar Codes with Exponentially Small Error at Finite Block Length |
Blasiok, Jaroslaw et al. |
2018 |
| 27 |
Secret Sharing with Binary Shares |
Lin, Fuchun et al. |
2018 |
| 28 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) |
Grohe, Martin et al. |
2018 |
| 29 |
Efficiently Decodable Codes for the Binary Deletion Channel |
Guruswami, Venkatesan et al. |
2017 |
| 30 |
Locality via Partially Lifted Codes |
Frank-Fischer, S. Luna et al. |
2017 |
