| Publication | Date of Publication | Type |
|---|
Batches stabilize the minimum norm risk in high-dimensional overparametrized linear regression
IEEE Transactions on Information Theory | 2025-07-14 | Paper |
Memory complexity of estimating entropy and mutual information
IEEE Transactions on Information Theory | 2025-07-11 | Paper |
| Resilience of 3-majority dynamics to non-uniform schedulers | 2024-09-25 | Paper |
Planted bipartite graph detection
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
On the number of graphs with a given histogram
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
On Lossy Compression of Directed Graphs
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Distributed Source Simulation With No Communication
IEEE Transactions on Information Theory | 2021-02-24 | Paper |
A Note on the Probability of Rectangles for Correlated Binary Strings
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Minimum Guesswork With an Unreliable Oracle
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
The communication complexity of private simultaneous messages, revisited
Journal of Cryptology | 2020-06-15 | Paper |
| Sharp Thresholds of the Information Cascade Fragility Under a Mismatched Model | 2020-06-07 | Paper |
Communication complexity of estimating correlations
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Distributed Estimation of Gaussian Correlations
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
| On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel | 2019-09-09 | Paper |
Self-predicting Boolean functions
SIAM Journal on Discrete Mathematics | 2019-04-24 | Paper |
Reducing Guesswork via an Unreliable Oracle
IEEE Transactions on Information Theory | 2018-12-04 | Paper |
A bound on the Shannon capacity via a linear programming variation
SIAM Journal on Discrete Mathematics | 2018-09-05 | Paper |
On the VC-dimension of binary codes
SIAM Journal on Discrete Mathematics | 2018-08-30 | Paper |
The communication complexity of private simultaneous messages, revisited
Advances in Cryptology – EUROCRYPT 2018 | 2018-07-09 | Paper |
Searching With Measurement Dependent Noise
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Graph information ratio
SIAM Journal on Discrete Mathematics | 2017-12-18 | Paper |
Quickest Sequence Phase Detection
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
On the optimal Boolean function for prediction under quadratic loss
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
The $\rho $ -Capacity of a Graph
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Optimal Feedback Communication Via Posterior Matching
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Interactive Schemes for the AWGN Channel with Noisy Feedback
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Delay and Redundancy in Lossless Source Coding
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Distributed Computing and the Graph Entropy Region
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Mutual Information Bounds via Adjacency Events
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A Simple Proof for the Optimality of Randomized Posterior Matching
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Minimum MS. E. Gerber’s Lemma
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
An upper bound on the sizes of multiset-union-free families
SIAM Journal on Discrete Mathematics | 2016-05-26 | Paper |
Universal Decoding for Frequency-Selective Fading Channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
