Ofer Shayevitz

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 106

Top Venues

CoRR

ISIT

IEEE Trans. Inf. Theory

SIAM J. Discret. Math.

Publications

Asaf Rotenberg, Wasim Huleihel, Ofer Shayevitz
Planted Bipartite Graph Detection. IEEE Trans. Inf. Theory 70 (6) (2024)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Memory Complexity of Entropy Estimation. CoRR (2024)
Shahar Stein Ioushua, Inbar Hasidim, Ofer Shayevitz, Meir Feder
Batches Stabilize the Minimum Norm Risk in High Dimensional Overparameterized Linear Regression. CoRR (2023)
Asaf Rotenberg, Wasim Huleihel, Ofer Shayevitz
Detecting a Planted Bipartite Graph. ISIT (2023)
Uri Meir, Rotem Oshman, Ofer Shayevitz, Yuval Volkov
Resilience of 3-Majority Dynamics to Non-Uniform Schedulers. ITCS (2023)
Shahar Stein Ioushua, Ofer Shayevitz
On the Number of Graphs With a Given Histogram. IEEE Trans. Inf. Theory 69 (11) (2023)
Asaf Rotenberg, Wasim Huleihel, Ofer Shayevitz
Planted Bipartite Graph Detection. CoRR (2023)
Michael Graifer, Yuval Kochman, Ofer Shayevitz
Quantum Key Distribution with State Replacement. Allerton (2023)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Statistical Inference with Limited Memory: A Survey. CoRR (2023)
Shahar Stein Ioushua, Ofer Shayevitz
On the Number of Graphs with a Given Histogram. CoRR (2022)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Deterministic Finite-Memory Bias Estimation. CoRR (2022)
Ronit Bustin, Ofer Shayevitz
On Lossy Compression of Directed Graphs. IEEE Trans. Inf. Theory 68 (4) (2022)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
On The Memory Complexity of Uniformity Testing. COLT (2022)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
On The Memory Complexity of Uniformity Testing. CoRR (2022)
Shahar Stein Ioushua, Ofer Shayevitz
On the Number of Graphs with a Given Histogram. ISIT (2022)
Tomer Berg, Ofer Shayevitz, Young-Han Kim, Lele Wang
Distributed Source Simulation With No Communication. IEEE Trans. Inf. Theory 67 (2) (2021)
Dror Drach, Or Ordentlich, Ofer Shayevitz
Binary Maximal Correlation Bounds and Isoperimetric Inequalities via Anti-Concentration. ISIT (2021)
Ronit Bustin, Ofer Shayevitz
On lossy Compression of Directed Graphs. CoRR (2021)
Yujie Gu, Ofer Shayevitz
On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel. Entropy 23 (11) (2021)
Wasim Huleihel, Soumyabrata Pal, Ofer Shayevitz
Learning User Preferences in Non-Stationary Environments. CoRR (2021)
Assaf Ben-Yishai, Young-Han Kim, Rotem Oshman, Ofer Shayevitz
On the Interactive Capacity of Finite-State Protocols. Entropy 23 (1) (2021)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Deterministic Finite-Memory Bias Estimation. COLT (2021)
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels. IEEE Trans. Inf. Theory 67 (12) (2021)
Wasim Huleihel, Soumyabrata Pal, Ofer Shayevitz
Learning User Preferences in Non-Stationary Environments. AISTATS (2021)
Nir Weinberger, Ofer Shayevitz
Guessing with a Bit of Help. Entropy 22 (1) (2020)
Wasim Huleihel, Ofer Shayevitz
Sharp Thresholds of the Information Cascade Fragility Under a Mismatched Model. CoRR (2020)
Wasim Huleihel, Ofer Shayevitz
Sharp Thresholds of the Information Cascade Fragility Under a Mismatched Model. AISTATS (2020)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. J. Cryptol. 33 (3) (2020)
Assaf Ben-Yishai, Young-Han Kim, Rotem Oshman, Ofer Shayevitz
On the Interactive Capacity of Finite-State Protocols. CoRR (2020)
Assaf Ben-Yishai, Ofer Shayevitz
Simple Modulo can Significantly Outperform Deep Learning-based Deepcode. CoRR (2020)
Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz
A Note on the Probability of Rectangles for Correlated Binary Strings. IEEE Trans. Inf. Theory 66 (12) (2020)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. ISIT (2020)
Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo
Minimum Guesswork With an Unreliable Oracle. IEEE Trans. Inf. Theory 66 (12) (2020)
Tomer Berg, Ofer Shayevitz, Or Ordentlich
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. CoRR (2020)
Tomer Berg, Ofer Shayevitz, Young-Han Kim, Lele Wang
Distributed Source Simulation With No Communication. CoRR (2019)
Yujie Gu, Ofer Shayevitz
On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel. ISIT (2019)
Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz
Communication Complexity of Estimating Correlations. CoRR (2019)
Tomer Berg, Ofer Shayevitz, Young-Han Kim, Lele Wang
Some Results on Distributed Source Simulation with no Communication. ITW (2019)
Lele Wang, Ofer Shayevitz
Adaptive Sequence Phase Detection. ISIT (2019)
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz
The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity. ISIT (2019)
Wasim Huleihel, Yury Polyanskiy, Ofer Shayevitz
Relaying One Bit Across a Tandem of Binary-Symmetric Channels. ISIT (2019)
Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz
A Note on the Probability of Rectangles for Correlated Binary Strings. CoRR (2019)
Uri Hadar, Ofer Shayevitz
Distributed Estimation of Gaussian Correlations. IEEE Trans. Inf. Theory 65 (9) (2019)
Yujie Gu, Ofer Shayevitz
On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel. CoRR (2019)
Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz
Error Exponents in Distributed Hypothesis Testing of Correlations. ISIT (2019)
Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz
Communication complexity of estimating correlations. STOC (2019)
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz
A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels. CoRR (2019)
Assaf Ben-Yishai, Ofer Shayevitz, Young-Han Kim
Shannon Capacity is Achievable for a Large Class of Interactive Markovian Protocols. ISIT (2019)
Shahar Stein Ioushua, Ofer Shayevitz
Counting Graphs with a Given Degree Sequence: An Information-theoretic Perspective. ISIT (2019)
Nir Weinberger, Ofer Shayevitz
Self-Predicting Boolean Functions. SIAM J. Discret. Math. 33 (2) (2019)
Nir Weinberger, Ofer Shayevitz
Self-Predicting Boolean Functions. ISIT (2018)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. EUROCRYPT (2) (2018)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. Electron. Colloquium Comput. Complex. 25 (2018)
Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo
Minimum Guesswork with an Unreliable Oracle. ISIT (2018)
Uri Hadar, Ofer Shayevitz
Distributed Estimation of Gaussian Correlations. CoRR (2018)
Assaf Ben-Yishai, Ofer Shayevitz, Young-Han Kim
Shannon Capacity is Achievable for Binary Interactive First-Order Markovian Protocols. CoRR (2018)
Nir Weinberger, Ofer Shayevitz
Guessing with a Bit of Help. CoRR (2018)
Uri Hadar, Ofer Shayevitz
Distributed Estimation of Gaussian Correlations. ISIT (2018)
Sihuang Hu, Nir Weinberger, Ofer Shayevitz
On the VC-Dimension of Binary Codes. SIAM J. Discret. Math. 32 (3) (2018)
Yonatan Kaspi, Ofer Shayevitz, Tara Javidi
Searching With Measurement Dependent Noise. IEEE Trans. Inf. Theory 64 (4) (2018)
Nir Weinberger, Ofer Shayevitz
Guessing with a Boolean Helper. ISIT (2018)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. IACR Cryptol. ePrint Arch. 2018 (2018)
Sihuang Hu, Itzhak Tamo, Ofer Shayevitz
A Bound on the Shannon Capacity via a Linear Programming Variation. SIAM J. Discret. Math. 32 (3) (2018)
Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo
Minimum Guesswork with an Unreliable Oracle. CoRR (2018)
Amir Burin, Ofer Shayevitz
Reducing Guesswork via an Unreliable Oracle. IEEE Trans. Inf. Theory 64 (11) (2018)
Nir Weinberger, Ofer Shayevitz
Self-Predicting Boolean Functions. CoRR (2018)
Sihuang Hu, Itzhak Tamo, Ofer Shayevitz
A Bound on the Shannon Capacity via a Linear Programming Variation. CoRR (2018)
Sihuang Hu, Nir Weinberger, Ofer Shayevitz
On the VC-Dimension of Binary Codes. CoRR (2017)
Amir Burin, Ofer Shayevitz
Reducing Guesswork via an Unreliable Oracle. CoRR (2017)
Lele Wang, Ofer Shayevitz
Graph Information Ratio. SIAM J. Discret. Math. 31 (4) (2017)
Assaf Ben-Yishai, Ofer Shayevitz, Young-Han Kim
Interactive coding for Markovian protocols. Allerton (2017)
Lele Wang, Sihuang Hu, Ofer Shayevitz
Quickest Sequence Phase Detection. IEEE Trans. Inf. Theory 63 (9) (2017)
Sihuang Hu, Nir Weinberger, Ofer Shayevitz
On the VC-dimension of binary codes. ISIT (2017)
Nir Weinberger, Ofer Shayevitz
On the Optimal Boolean Function for Prediction Under Quadratic Loss. IEEE Trans. Inf. Theory 63 (7) (2017)
Ronit Bustin, Ofer Shayevitz
On lossy compression of binary matrices. ISIT (2017)
Assaf Ben-Yishai, Ofer Shayevitz
Interactive Schemes for the AWGN Channel with Noisy Feedback. IEEE Trans. Inf. Theory 63 (4) (2017)
Sihuang Hu, Itzhak Tamo, Ofer Shayevitz
A bound on the shannon capacity via a linear programming variation. ISIT (2017)
Lele Wang, Ofer Shayevitz
Graph information ratio. ISIT (2017)
Sihuang Hu, Ofer Shayevitz
The ρ-Capacity of a Graph. IEEE Trans. Inf. Theory 63 (4) (2017)
Assaf Ben-Yishai, Ofer Shayevitz, Young-Han Kim
Interactive Coding for Markovian Protocols. CoRR (2017)
Yanjun Han, Or Ordentlich, Ofer Shayevitz
Mutual Information Bounds via Adjacency Events. IEEE Trans. Inf. Theory 62 (11) (2016)
Or Ordentlich, Ofer Shayevitz
An Upper Bound on the Sizes of Multiset-Union-Free Families. SIAM J. Discret. Math. 30 (2) (2016)
Yonatan Kaspi, Ofer Shayevitz, Tara Javidi
Searching with Measurement Dependent Noise. CoRR (2016)
Lele Wang, Ofer Shayevitz
Graph Information Ratio. CoRR (2016)
Ofer Shayevitz, Meir Feder
A Simple Proof for the Optimality of Randomized Posterior Matching. IEEE Trans. Inf. Theory 62 (6) (2016)
Lele Wang, Sihuang Hu, Ofer Shayevitz
Quickest Sequence Phase Detection. CoRR (2016)
Nir Weinberger, Ofer Shayevitz
On the Optimal Boolean Function for Prediction under Quadratic Loss. CoRR (2016)
Or Ordentlich, Ofer Shayevitz, Omri Weinstein
An improved upper bound for the most informative boolean function conjecture. ISIT (2016)
Lele Wang, Sihuang Hu, Ofer Shayevitz
Quickest sequence phase detection. ISIT (2016)
Sihuang Hu, Ofer Shayevitz
The ρ-Capacity of a Graph. CoRR (2016)
Nir Weinberger, Ofer Shayevitz
On the optimal boolean function for prediction under quadratic loss. ISIT (2016)
Sihuang Hu, Ofer Shayevitz
The ρ-capacity of a graph. ISIT (2016)
Or Ordentlich, Ofer Shayevitz
Mutual Information Bounds via Adjacency Events. CoRR (2015)
Assaf Ben-Yishai, Ofer Shayevitz
The AWGN BC with MAC Feedback: A Reduction to Noiseless Feedback via Interaction. CoRR (2015)
Yonatan Kaspi, Ofer Shayevitz, Tara Javidi
Searching for multiple targets with measurement dependent noise. ISIT (2015)
Assaf Ben-Yishai, Ofer Shayevitz
Interactive Schemes for the AWGN Channel with Noisy Feedback. CoRR (2015)
Or Ordentlich, Ofer Shayevitz
Subset-universal lossy compression. ITW (2015)
Assaf Ben-Yishai, Ofer Shayevitz
The AWGN BC with MAC feedback: A reduction to noiseless feedback via interaction. ITW (2015)
Or Ordentlich, Ofer Shayevitz
Minimum MS. E. Gerber's Lemma. IEEE Trans. Inf. Theory 61 (11) (2015)
Or Ordentlich, Ofer Shayevitz, Omri Weinstein
Dictatorship is the Most Informative Balanced Function at the Extremes. Electron. Colloquium Comput. Complex. 22 (2015)

Ofer Shayevitz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ofer Shayevitz