| Publication | Date of Publication | Type |
|---|
| Computation over the noisy broadcast channel with malicious parties | 2026-04-15 | Paper |
| Information dissemination via broadcasts in the presence of adversarial noise | 2026-01-28 | Paper |
Lower bounds for regular resolution over parities
SIAM Journal on Computing | 2025-08-21 | Paper |
| Binary codes with resilience beyond 1/4 via interaction | 2025-08-15 | Paper |
| Statistically near-optimal hypothesis selection | 2025-08-13 | Paper |
| Tight bounds for general computation in noisy broadcast networks | 2025-08-13 | Paper |
| Binary interactive error resilience beyond \(1/8\) (or why \((1/2)^3 > 1/8\)) | 2025-08-12 | Paper |
| Radio network coding requires logarithmic overhead | 2025-08-12 | Paper |
| List and unique coding for interactive communication in the presence of adversarial noise | 2025-08-05 | Paper |
| Local list decoding with a constant number of queries | 2025-04-29 | Paper |
| Protecting single-hop radio networks from message drops | 2024-11-14 | Paper |
| Noisy radio network lower bounds via noiseless beeping lower bounds | 2024-09-25 | Paper |
| Interactive coding with small memory | 2024-05-14 | Paper |
| The rate of interactive codes is bounded away from 1 | 2024-05-08 | Paper |
Circuits resilient to short-circuit errors
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Optimal error resilience of adaptive message exchange
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Optimal Short-Circuit Resilient Formulas
Journal of the ACM | 2023-04-27 | Paper |
| scientific article; zbMATH DE number 7650355 (Why is no real title available?) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7564410 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-27 | Paper |
Noisy Beeps
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Interactive error resilience beyond 2/7
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Reliable communication over highly connected noisy networks
Distributed Computing | 2019-11-27 | Paper |
Interactive coding over the noisy broadcast channel
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| From coding theory to efficient pattern matching | 2019-05-06 | Paper |
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
Journal of the ACM | 2018-08-02 | Paper |
Testing Equality in Communication Graphs
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
On minimal free resolutions of sub-permanents and other ideals arising in complexity theory
Journal of Algebra | 2018-06-18 | Paper |
The method of shifted partial derivatives cannot separate the permanent from the determinant
Mathematics of Computation | 2018-04-24 | Paper |
Constant-rate coding for multiparty interactive communication is impossible
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Reliable communication over highly connected noisy networks
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Maximal noise in interactive communication over erasure channels and channels with feedback
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
SIAM Journal on Computing | 2017-03-10 | Paper |
3-query locally decodable codes of subexponential length
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
From irreducible representations to locally decodable codes
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
3-query locally decodable codes of subexponential length
SIAM Journal on Computing | 2013-03-19 | Paper |
Mismatch sampling
Information and Computation | 2012-05-24 | Paper |
A black box for online approximate pattern matching
Information and Computation | 2011-04-28 | Paper |
Approximating general metric distances between a pattern and a text
(available as arXiv preprint) | 2010-08-06 | Paper |
Pattern matching with don't cares and few errors
Journal of Computer and System Sciences | 2010-02-12 | Paper |
How Well Do Random Walks Parallelize?
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
k-Mismatch with Don’t Cares
Algorithms – ESA 2007 | 2008-09-25 | Paper |
A Black Box for Online Approximate Pattern Matching
Combinatorial Pattern Matching | 2008-06-17 | Paper |
