Ray Li

Electron. Colloquium Comput. Complex., 2023

Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields.

[BibT_eX]

[DOI]

Omar Alrabiah

Electron. Colloquium Comput. Complex., 2023

Improved rate-distance trade-offs for quantum codes with restricted connectivity.

[BibT_eX]

[DOI]

CoRR, 2023

Approximating Binary Longest Common Subsequence in Almost-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

On Diameter Approximation in Directed Graphs.

[BibT_eX]

[DOI]

Amir Abboud

Mina Dalirrooyfard

Virginia Vassilevska Williams

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

New combinatorial bounds for error correcting codes.

[BibT_eX]

[DOI]

PhD thesis, 2022

Bounds for List-Decoding and List-Recovery of Random Linear Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Approximating binary longest common subsequence in near-linear time.

[BibT_eX]

[DOI]

CoRR, 2022

CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient Near-Optimal Codes for General Repeat Channels.

[BibT_eX]

[DOI]

Francisco Pernice

CoRR, 2022

Efficient Capacity-Achieving Codes for General Repeat Channels.

[BibT_eX]

[DOI]

Francisco Pernice

Proceedings of the IEEE International Symposium on Information Theory, 2022

Improved batch code lower bounds.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer.

[BibT_eX]

[DOI]

Proceedings of the Interspeech 2022, 2022

2021

Improved List-Decodability of Random Linear Binary Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Lifted Multiplicity Codes and the Disjoint Repair Group Property.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

The zero-rate threshold for adversarial bit-deletions is less than 1/2.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH).

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Wedge-Lifted Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Hardness of Approximate Diameter: Now for Undirected Graphs.

[BibT_eX]

[DOI]

Mina Dalirrooyfard

Virginia Vassilevska Williams

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Coding Against Deletions in Oblivious and Online Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

On edge-ordered Ramsey numbers.

[BibT_eX]

[DOI]

Jacob Fox

Random Struct. Algorithms, 2020

Improved List-Decodability of Reed-Solomon Codes via Tree Packings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

On Ramsey numbers of hedgehogs.

[BibT_eX]

[DOI]

Jacob Fox

Comb. Probab. Comput., 2020

Improved SETH-hardness of unweighted Diameter.

[BibT_eX]

[DOI]

CoRR, 2020

Hat Guessing Numbers of Degenerate Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree.

[BibT_eX]

[DOI]

Percy Liang

Stephen Mussmann

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Lower Bounds for Max-Cut via Semidefinite Programming.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Coded trace reconstruction in a constant number of traces.

[BibT_eX]

[DOI]

Joshua Brakensiek

Bruce Spang

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Polynomial Time Decodable Codes for the Binary Deletion Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Lifted Multiplicity Codes.

[BibT_eX]

[DOI]

CoRR, 2019

Enumeration of Preferred Extensions in Almost Oriented Digraphs.

[BibT_eX]

[DOI]

Serge Gaspers

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Random linear binary codes have smaller list sizes than uniformly random binary codes.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Efficiently Decodable Codes for the Binary Deletion Channel.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2017

2016

Codes correcting deletions in oblivious and random models.

[BibT_eX]

[DOI]

CoRR, 2016

Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes.

[BibT_eX]

[DOI]