| 2009 |
|---|
| 12 | EE | Nathan Linial,
Adi Shraibman:
Learning Complexity vs Communication Complexity.
Combinatorics, Probability & Computing 18(1-2): 227-245 (2009) |
| 11 | EE | Gideon Schechtman,
Adi Shraibman:
Lower Bounds for Local Versions of Dimension Reductions.
Discrete & Computational Geometry 41(2): 273-283 (2009) |
| 10 | EE | Nati Linial,
Adi Shraibman:
Lower bounds in communication complexity based on factorization norms.
Random Struct. Algorithms 34(3): 368-394 (2009) |
| 2008 |
|---|
| 9 | EE | Nati Linial,
Adi Shraibman:
Learning Complexity vs. Communication Complexity.
IEEE Conference on Computational Complexity 2008: 53-63 |
| 8 | EE | Troy Lee,
Adi Shraibman,
Robert Spalek:
A Direct Product Theorem for Discrepancy.
IEEE Conference on Computational Complexity 2008: 71-80 |
| 7 | EE | Troy Lee,
Adi Shraibman:
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.
IEEE Conference on Computational Complexity 2008: 81-91 |
| 6 | EE | Troy Lee,
Adi Shraibman:
An approximation algorithm for approximation rank
CoRR abs/0809.2093: (2008) |
| 5 | EE | Troy Lee,
Adi Shraibman:
Disjointness is hard in the multi-party number-on-the-forehead model.
Electronic Colloquium on Computational Complexity (ECCC) 15(003): (2008) |
| 2007 |
|---|
| 4 | EE | Kfir Barhum,
Oded Goldreich,
Adi Shraibman:
On Approximating the Average Distance Between Points.
APPROX-RANDOM 2007: 296-310 |
| 3 | EE | Nati Linial,
Adi Shraibman:
Lower bounds in communication complexity based on factorization norms.
STOC 2007: 699-708 |
| 2 | EE | Troy Lee,
Adi Shraibman:
Disjointness is hard in the multi-party number on the forehead model
CoRR abs/0712.4279: (2007) |
| 2005 |
|---|
| 1 | EE | Nathan Srebro,
Adi Shraibman:
Rank, Trace-Norm and Max-Norm.
COLT 2005: 545-560 |
