Personensuche
X
?
Proceedings of the 56th Annual ACM Symposium on Theory of Computing ,
3
Randomly Punctured Reed–Solomon Codes Achieve List-Decoding..:
, In:
?
Proceedings of the 55th Annual ACM Symposium on Theory of Computing ,
6
Approximating Binary Longest Common Subsequence in Almost-L..:
, In:
?
2022 IEEE International Symposium on Information Theory (ISIT) ,
8
Improved batch code lower bounds:
, In:
?
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) ,
9
Hardness of Approximate Diameter: Now for Undirected Graphs:
, In:
?
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) ,
10
Improved List-Decodability and List-Recoverability of Reed-..:
, In:
?
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) ,
11
The zero-rate threshold for adversarial bit-deletions is le..:
, In:
?
2022 IEEE International Symposium on Information Theory (ISIT) ,
12