No. | Title | Author | Year |
---|---|---|---|
1 | On Diameter Approximation in Directed Graphs | Abboud, Amir et al. | 2023 |
2 | Bounds for List-Decoding and List-Recovery of Random Linear Codes | Guruswami, Venkatesan et al. | 2020 |
3 | Enumeration of Preferred Extensions in Almost Oriented Digraphs | Gaspers, Serge et al. | 2019 |
4 | Lifted Multiplicity Codes and the Disjoint Repair Group Property | Li, Ray et al. | 2019 |
5 | Improved List-Decodability of Random Linear Binary Codes | Li, Ray et al. | 2018 |
6 | Efficiently Decodable Codes for the Binary Deletion Channel | Guruswami, Venkatesan et al. | 2017 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 6 |