Adi Shraibman

发表

Lower bounds in communication complexity based on factorization norms

Nathan Linial, Adi Shraibman, N. Linial, 2007, STOC '07.

Lower Bounds for Local Versions of Dimension Reductions

Gideon Schechtman, Adi Shraibman, 2009, Discret. Comput. Geom..

The approximate rank of a matrix and its algorithmic applications: approximate rank

Noga Alon, Santosh S. Vempala, Troy Lee, 2013, STOC '13.

Disjointness is Hard in the Multiparty Number-on-the-Forehead Model

Troy Lee, Adi Shraibman, A. Shraibman, 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.

Learning Complexity vs. Communication Complexity

Nathan Linial, Adi Shraibman, 2008, Computational Complexity Conference.

Rank, Trace-Norm and Max-Norm

Adi Shraibman, Nathan Srebro, Nathan Srebro, 2005, COLT.

A Direct Product Theorem for Discrepancy

Troy Lee, Adi Shraibman, Robert Spalek, 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

Lower bounds in communication complexity based on factorization norms

Nathan Linial, Adi Shraibman, N. Linial, 2007, STOC '07.

Matrix Completion From any Given Set of Observations

Troy Lee, Adi Shraibman, A. Shraibman, 2013, NIPS.

Approximation norms and duality for communication complexity lower bounds

Troy Lee, Adi Shraibman, 2008, Computational Complexity of Discrete Problems.

On The Communication Complexity of High-Dimensional Permutations pdf

Adi Shraibman, Nati Linial, N. Linial, 2017, ITCS.

The Corruption Bound, Log Rank, and Communication Complexity

Adi Shraibman, 2019, Inf. Process. Lett..

An Approximation Algorithm for Approximation Rank

Troy Lee, Adi Shraibman, A. Shraibman, 2008, 2009 24th Annual IEEE Conference on Computational Complexity.

On Approximating the Average Distance Between Points

Oded Goldreich, Adi Shraibman, Kfir Barhum, 2007, APPROX-RANDOM.

Lower Bounds on Quantum Multiparty Communication Complexity

Gideon Schechtman, Troy Lee, Adi Shraibman, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

Property Testing of the Boolean and Binary Rank pdf

Dana Ron, Adi Shraibman, Michal Parnas, 2019, Theory of Computing Systems.

Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs pdf

Noga Alon, Adi Shraibman, N. Alon, 2020, ArXiv.

Learning Complexity vs. Communication Complexity

Nathan Linial, Adi Shraibman, 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

Deterministic algorithms for matrix completion

Gideon Schechtman, Adi Shraibman, Eyal Heiman, 2014, Random Struct. Algorithms.

The Augmentation Property of Binary Matrices for the Binary and Boolean Rank pdf

Adi Shraibman, Michal Parnas, 2017, ArXiv.

A Note on Multiparty Communication Complexity and the Hales-Jewett Theorem pdf

Adi Shraibman, 2018, Inf. Process. Lett..

Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model pdf

Troy Lee, Adi Shraibman, 2008, Computational Complexity Conference.

The Cover Number of a Matrix and its Algorithmic Applications

Noga Alon, Troy Lee, Adi Shraibman, 2014, APPROX-RANDOM.

On maximal isolation sets in the uniform intersection matrix pdf

Adi Shraibman, Michal Parnas, 2019, ArXiv.

Nondeterministic Communication Complexity with Help and Graph Functions pdf

Adi Shraibman, 2019, Theor. Comput. Sci..

Complexity measures of sign matrices

Nathan Linial, Gideon Schechtman, Adi Shraibman, 2007, Comb..

Lower Bounds in Communication Complexity

Troy Lee, Adi Shraibman, A. Shraibman, 2009, Found. Trends Theor. Comput. Sci..

Larger Corner-Free Sets from Better NOF Exactly-\(N\) Protocols

Adi Shraibman, Nati Linial, 2021 .

An improved protocol for the exactly-N problem*

Nathan Linial, Adi Shraibman, 2021, Computational Complexity Conference.

Lower bounds in communication complexity based on factorization norms

Adi Shraibman, Nati Linial, 2009 .