| Publication | Date of Publication | Type |
|---|
On diameter approximation in directed graphs
| 2025-01-06 | Paper |
AG codes have no list-decoding friends: approaching the generalized Singleton bound requires exponential alphabets
| 2024-11-28 | Paper |
Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
SIAM Journal on Computing | 2024-04-04 | Paper |
The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758311 (Why is no real title available?)
| 2023-10-31 | Paper |
Lifted Multiplicity Codes and the Disjoint Repair Group Property
| 2023-02-03 | Paper |
Approximating binary longest common subsequence in almost-linear time
| 2022-11-29 | Paper |
Lower bounds for max-cut via semidefinite programming
| 2022-10-13 | Paper |
Enumeration of preferred extensions in almost oriented digraphs
| 2022-07-21 | Paper |
Bounds for List-Decoding and List-Recovery of Random Linear Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Improved list-decodability of random linear binary codes
| 2021-08-04 | Paper |
Efficiently decodable codes for the binary deletion channel
| 2021-07-28 | Paper |
Lower bounds for max-cut in \(H\)-free graphs via semidefinite programming
SIAM Journal on Discrete Mathematics | 2021-07-23 | Paper |
Improved List-Decodability of Random Linear Binary Codes
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
Lifted Multiplicity Codes and the Disjoint Repair Group Property
IEEE Transactions on Information Theory | 2021-02-24 | Paper |
A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On edge-ordered Ramsey numbers
Random Structures & Algorithms | 2021-01-05 | Paper |
Improved List-Decodability of Reed--Solomon Codes via Tree Packings
| 2020-11-09 | Paper |
Coding Against Deletions in Oblivious and Online Models
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Hat guessing numbers of degenerate graphs
The Electronic Journal of Combinatorics | 2020-09-21 | Paper |
On Ramsey numbers of hedgehogs
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Effective bounds on multiplicatively dependent orbits of integer polynomials modulo S-integers
| 2020-01-27 | Paper |
Central limit theorems for gaps of generalized Zeckendorf decompositions
| 2019-08-28 | Paper |
Coded trace reconstruction in a constant number of traces
| 2019-08-12 | Paper |
Polynomial Time Decodable Codes for the Binary Deletion Channel
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Enumeration of Preferred Extensions in Almost Oriented Digraphs
| 2019-07-01 | Paper |
Max-Cut in Degenerate $H$-Free Graphs
| 2019-05-07 | Paper |
scientific article; zbMATH DE number 6985720 (Why is no real title available?)
| 2018-11-28 | Paper |
Coding against deletions in oblivious and online models
| 2018-03-15 | Paper |
Improved list-decodability of random linear binary codes
| 2018-01-23 | Paper |
An Elementary Proof of the Cayley Formula Using Random Maps
| 2014-09-04 | Paper |
A Simple Proof of the Cayley Formula using Random Graphs
| 2013-12-14 | Paper |
Randomly punctured Reed--Solomon codes achieve list-decoding capacity over linear-sized fields
| N/A | Paper |
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
| N/A | Paper |
