Searching for authors named "Adi Shraibman" – sorted by Relevance.
-
Rank, trace-norm and max-norm
- Rank, Trace-Norm and Max-Norm Nathan Srebro 1 and Adi Shraibman 2 1 University of Toronto
- Cited by 4 (1 self) – Add To MetaCart
-
Learning complexity vs. communication complexity
- and Engineering Hebrew University Jerusalem, Israel e-mail: nati@(email omitted); Adi Shraibman School of Computer
- Cited by 5 (1 self) – Add To MetaCart
-
A direct product theorem for discrepancy
- University ∗ Robert ˇSpalek Google, Inc. ‡ Abstract Adi Shraibman Department of Mathematics Weizmann
- Cited by 5 (3 self) – Add To MetaCart
-
Lower Bounds in Communication Complexity: A Survey
- Lower Bounds in Communication Complexity: A Survey Troy Lee Columbia University Adi Shraibman
- Add To MetaCart
-
Lower bounds in communication complexity based on factorization norms
- Lower Bounds in Communication Complexity Based on Factorization Norms Nati Linial Adi Shraibman
- Cited by 18 (3 self) – Add To MetaCart
-
Lower bounds on quantum multiparty communication complexity
- Science Columbia University New York, USA troyjlee@(email omitted); Gideon Schechtman & Adi Shraibman Department
- Cited by 1 (1 self) – Add To MetaCart

