Ofer Shayevitz

Information Theory and Applications Center, University of California, San Diego, CA

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers79 papers

Sort

By YearBy Citation

On the Interactive Capacity of Finite-State Protocols

Ben-Yishai Assaf,Kim Young-Han, Oshman Rotem,Shayevitz Ofer

Entropy, no. 1 (2021): 17

WOSEIBibtex

Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules

Tomer Berg,Or Ordentlich,Ofer Shayevitz

ISIT, pp.1259-1264, (2020)

EIBibtex

Minimum Guesswork With an Unreliable Oracle

Natan Ardimanov,Ofer Shayevitz,Itzhak Tamo

IEEE Trans. Inf. Theory, no. 12 (2020): 7528-7538

EIBibtex

The Communication Complexity of Private Simultaneous Messages, Revisited

Benny Applebaum, Thomas Holenstein, Manoj Mishra,Ofer Shayevitz

Journal of Cryptology, no. 3 (2020): 917-953

Bibtex

Simple Modulo can Significantly Outperform Deep Learning-based Deepcode

Assaf Ben-Yishai,Ofer Shayevitz

Bibtex

Guessing with a Bit of Help

Nir Weinberger,Ofer Shayevitz

ENTROPY, no. 1 (2020): 39

EIWOSBibtex

Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules

Berg Tomer,Shayevitz Ofer,Ordentlich Or

Bibtex

Adaptive Sequence Phase Detection

Lele Wang,Ofer Shayevitz

ISIT, pp.907-911, (2019)

EIBibtex

Communication Complexity of Estimating Correlations

Uri Hadar,Jingbo Liu,Yury Polyanskiy,Ofer Shayevitz

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (2019): 792-803

Cited by7EIBibtex

A Note on the Probability of Rectangles for Correlated Binary Strings

Ordentlich Or,Polyanskiy Yury,Shayevitz Ofer

IEEE Trans. Inf. Theory, no. 12 (2019): 7878-7886

EIBibtex

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

Ben-Yishai Assaf,Kim Young-Han,Ordentlich Or,Shayevitz Ofer

Bibtex

Some Results on Distributed Source Simulation with no Communication

Tomer Berg,Ofer Shayevitz,Young-Han Kim,Lele Wang

ITW, pp.1-5, (2019)

EIBibtex

Self-Predicting Boolean Functions

Nir Weinberger,Ofer Shayevitz

SIAM JOURNAL ON DISCRETE MATHEMATICS, no. 2 (2019): 665-693

Cited by1EIBibtex

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

Shahar Stein Ioushua,Ofer Shayevitz

ISIT, pp.1492-1496, (2019)

EIBibtex

Error Exponents in Distributed Hypothesis Testing of Correlations

Uri Hadar,Jingbo Liu,Yury Polyanskiy,Ofer Shayevitz

ISIT, pp.2674-2678, (2019)

EIBibtex

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

Yujie Gu,Ofer Shayevitz

ISIT, pp.3107-3111, (2019)

EIBibtex

Distributed Source Simulation With No Communication

Tomer Berg,Ofer Shayevitz,Young-Han Kim,Lele Wang

CoRR, no. 2 (2019): 1-1

EIBibtex

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

Assaf Ben-Yishai,Young-Han Kim, Or Ordentlich,Ofer Shayevitz

ISIT, pp.2868-2872, (2019)

EIBibtex

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

Assaf Ben-Yishai,Ofer Shayevitz,Young-Han Kim

ISIT, pp.2863-2867, (2019)

EIBibtex

A Bound on the Shannon Capacity via a Linear Programming Variation

Sihuang Hu,Itzhak Tamo,Ofer Shayevitz

SIAM JOURNAL ON DISCRETE MATHEMATICS, no. 3 (2018): 2229-2241

Bibtex

View All

Base Info Papers Patents Projects

Ofer ShayevitzBinding

Papers79 papers

Ofer Shayevitz