Ofer Shayevitz

IEEE Trans. Inf. Theory, November, 2023

Statistical Inference with Limited Memory: A Survey.

[BibT_eX]

[DOI]

CoRR, 2023

Batches Stabilize the Minimum Norm Risk in High Dimensional Overparameterized Linear Regression.

[BibT_eX]

[DOI]

CoRR, 2023

Planted Bipartite Graph Detection.

[BibT_eX]

[DOI]

Asaf Rotenberg

CoRR, 2023

Detecting a Planted Bipartite Graph.

[BibT_eX]

[DOI]

Asaf Rotenberg

Proceedings of the IEEE International Symposium on Information Theory, 2023

Resilience of 3-Majority Dynamics to Non-Uniform Schedulers.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Quantum Key Distribution with State Replacement.

[BibT_eX]

[DOI]

Michael Graifer

Yuval Kochman

Proceedings of the 59th Annual Allerton Conference on Communication, 2023

2022

On Lossy Compression of Directed Graphs.

[BibT_eX]

[DOI]

Ronit Bustin

IEEE Trans. Inf. Theory, 2022

On The Memory Complexity of Uniformity Testing.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Distributed Source Simulation With No Communication.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel.

[BibT_eX]

[DOI]

Yujie Gu

Entropy, 2021

On the Interactive Capacity of Finite-State Protocols.

[BibT_eX]

[DOI]

Entropy, 2021

Binary Maximal Correlation Bounds and Isoperimetric Inequalities via Anti-Concentration.

[BibT_eX]

[DOI]

Dror Drach

Proceedings of the IEEE International Symposium on Information Theory, 2021

Deterministic Finite-Memory Bias Estimation.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Learning User Preferences in Non-Stationary Environments.

[BibT_eX]

[DOI]

Soumyabrata Pal

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

A Note on the Probability of Rectangles for Correlated Binary Strings.

[BibT_eX]

[DOI]

Yury Polyanskiy

IEEE Trans. Inf. Theory, 2020

Minimum Guesswork With an Unreliable Oracle.

[BibT_eX]

[DOI]

Natan Ardimanov

Itzhak Tamo

IEEE Trans. Inf. Theory, 2020

The Communication Complexity of Private Simultaneous Messages, Revisited.

[BibT_eX]

[DOI]

J. Cryptol., 2020

Guessing with a Bit of Help.

[BibT_eX]

[DOI]

Entropy, 2020

Simple Modulo can Significantly Outperform Deep Learning-based Deepcode.

[BibT_eX]

[DOI]

CoRR, 2020

Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Sharp Thresholds of the Information Cascade Fragility Under a Mismatched Model.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Distributed Estimation of Gaussian Correlations.

[BibT_eX]

[DOI]

Uri Hadar

IEEE Trans. Inf. Theory, 2019

Self-Predicting Boolean Functions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels.

[BibT_eX]

[DOI]

CoRR, 2019

Communication complexity of estimating correlations.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Some Results on Distributed Source Simulation with no Communication.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Counting Graphs with a Given Degree Sequence: An Information-theoretic Perspective.

[BibT_eX]

[DOI]

Shahar Stein Ioushua

Proceedings of the IEEE International Symposium on Information Theory, 2019

Relaying One Bit Across a Tandem of Binary-Symmetric Channels.

[BibT_eX]

[DOI]

Yury Polyanskiy

Proceedings of the IEEE International Symposium on Information Theory, 2019

Error Exponents in Distributed Hypothesis Testing of Correlations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Shannon Capacity is Achievable for a Large Class of Interactive Markovian Protocols.

[BibT_eX]

[DOI]

Young-Han Kim

Proceedings of the IEEE International Symposium on Information Theory, 2019

The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Adaptive Sequence Phase Detection.

[BibT_eX]

[DOI]

Lele Wang

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Searching With Measurement Dependent Noise.

[BibT_eX]

[DOI]

Yonatan Kaspi

Tara Javidi

IEEE Trans. Inf. Theory, 2018

Reducing Guesswork via an Unreliable Oracle.

[BibT_eX]

[DOI]

Amir Burin

IEEE Trans. Inf. Theory, 2018

On the VC-Dimension of Binary Codes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

A Bound on the Shannon Capacity via a Linear Programming Variation.

[BibT_eX]

[DOI]

Itzhak Tamo

SIAM J. Discret. Math., 2018

Shannon Capacity is Achievable for Binary Interactive First-Order Markovian Protocols.

[BibT_eX]

[DOI]

Young-Han Kim

CoRR, 2018

Guessing with a Boolean Helper.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

On the Optimal Boolean Function for Prediction Under Quadratic Loss.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Quickest Sequence Phase Detection.

[BibT_eX]

[DOI]

Lele Wang

IEEE Trans. Inf. Theory, 2017

The ρ-Capacity of a Graph.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Interactive Schemes for the AWGN Channel with Noisy Feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Graph Information Ratio.

[BibT_eX]

[DOI]

Lele Wang

SIAM J. Discret. Math., 2017

On lossy compression of binary matrices.

[BibT_eX]

[DOI]

Ronit Bustin

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Interactive coding for Markovian protocols.

[BibT_eX]

[DOI]

Young-Han Kim

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

A Simple Proof for the Optimality of Randomized Posterior Matching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Mutual Information Bounds via Adjacency Events.

[BibT_eX]

[DOI]

Yanjun Han

IEEE Trans. Inf. Theory, 2016

An Upper Bound on the Sizes of Multiset-Union-Free Families.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

An improved upper bound for the most informative boolean function conjecture.

[BibT_eX]

[DOI]

Omri Weinstein

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Minimum MS. E. Gerber's Lemma.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Dictatorship is the Most Informative Balanced Function at the Extremes.

[BibT_eX]

[DOI]

Omri Weinstein

Electron. Colloquium Comput. Complex., 2015

Mutual Information Bounds via Adjacency Events.

[BibT_eX]

[DOI]

CoRR, 2015

Subset-universal lossy compression.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

The AWGN BC with MAC feedback: A reduction to noiseless feedback via interaction.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Searching for multiple targets with measurement dependent noise.

[BibT_eX]

[DOI]

Yonatan Kaspi

Tara Javidi

Proceedings of the IEEE International Symposium on Information Theory, 2015

The Gaussian channel with noisy feedback: improving reliability via interaction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Delay and Redundancy in Lossless Source Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Distributed Computing and the Graph Entropy Region.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Is There a Proficiency-Universal Language?

[BibT_eX]

[DOI]

CoRR, 2014

Bounding techniques for the intrinsic uncertainty of channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The Gaussian channel with noisy feedback: Near-capacity performance via simple interaction.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback.

[BibT_eX]

[DOI]

Michèle A. Wigger

IEEE Trans. Inf. Theory, 2013

2011

Optimal Feedback Communication Via Posterior Matching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

On Rényi measures and hypothesis testing.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Graph Entropy Characterization of Relay-Assisted Zero-Error Source Coding with Side Information.

[BibT_eX]

[DOI]

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010

Bidirectional MIMO Channel Tracking Based on PASTd and Performance Evaluation.

[BibT_eX]

[DOI]

EURASIP J. Adv. Signal Process., 2010

A Note on a Characterization of Rényi Measures and its Relation to Composite Hypothesis Testing

[BibT_eX]

[DOI]

CoRR, 2010

An achievable region for the discrete memoryless broadcast channel with feedback.

[BibT_eX]

[DOI]

Michèle A. Wigger

Proceedings of the IEEE International Symposium on Information Theory, 2010

A Symbolic Dynamical System Approach to Lossy Source Coding with Feedforward.

[BibT_eX]

[DOI]

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009

Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

On error correction with feedback under list decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

The Posterior Matching Feedback Scheme for Joint Source-Channel Coding with Bandwidth Expansion.

[BibT_eX]

[DOI]

Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

Posterior matching variants and fixed-point elimination.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

Achieving the Empirical Capacity Using Feedback Part I: Memoryless Additive Models

[BibT_eX]

[DOI]

CoRR, 2008

The posterior matching feedback scheme: Capacity achieving and error analysis.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding.

[BibT_eX]

[DOI]

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

2007

Communication with Feedback via Posterior Matching.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Bounds on Redundancy in Constrained Delay Arithmetic Coding.

[BibT_eX]

[DOI]

Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2006

Bounded Expected Delay in Arithmetic Coding.

[BibT_eX]

[DOI]

Ram Zamir

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Universal decoding for frequency-selective fading channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Communicating using feedback over a binary channel with arbitrary noise sequence.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

A minimax optimal decoder for OFDM over unknown frequency-selective fading channels.

[BibT_eX]

[DOI]