| 2009 | ||
|---|---|---|
| 17 | Troy Lee, Gideon Schechtman, Adi Shraibman: Lower Bounds on Quantum Multiparty Communication Complexity. IEEE Conference on Computational Complexity 2009: 254-262 | |
| 16 | Troy Lee, Adi Shraibman: An Approximation Algorithm for Approximation Rank. IEEE Conference on Computational Complexity 2009: 351-357 | |
| 15 | Nathan Linial, Adi Shraibman: Learning Complexity vs Communication Complexity. Combinatorics, Probability & Computing 18(1-2): 227-245 (2009) | |
| 14 | Troy Lee, Adi Shraibman: Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. Computational Complexity 18(2): 309-336 (2009) | |
| 13 | Gideon Schechtman, Adi Shraibman: Lower Bounds for Local Versions of Dimension Reductions. Discrete & Computational Geometry 41(2): 273-283 (2009) | |
| 12 | Troy Lee, Adi Shraibman: Lower Bounds in Communication Complexity. Foundations and Trends in Theoretical Computer Science 3(4): 263-398 (2009) | |
| 11 | Nati Linial, Adi Shraibman: Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms 34(3): 368-394 (2009) | |
| 2008 | ||
| 10 | Nati Linial, Adi Shraibman: Learning Complexity vs. Communication Complexity. IEEE Conference on Computational Complexity 2008: 53-63 | |
| 9 | Troy Lee, Adi Shraibman, Robert Spalek: A Direct Product Theorem for Discrepancy. IEEE Conference on Computational Complexity 2008: 71-80 | |
| 8 | Troy Lee, Adi Shraibman: Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. IEEE Conference on Computational Complexity 2008: 81-91 | |
| 7 | Troy Lee, Adi Shraibman: An approximation algorithm for approximation rank CoRR abs/0809.2093: (2008) | |
| 6 | 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 | ||
| 5 | Kfir Barhum, Oded Goldreich, Adi Shraibman: On Approximating the Average Distance Between Points. APPROX-RANDOM 2007: 296-310 | |
| 4 | Nati Linial, Adi Shraibman: Lower bounds in communication complexity based on factorization norms. STOC 2007: 699-708 | |
| 3 | Troy Lee, Adi Shraibman: Disjointness is hard in the multi-party number on the forehead model CoRR abs/0712.4279: (2007) | |
| 2 | Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman: Complexity measures of sign matrices. Combinatorica 27(4): 439-463 (2007) | |
| 2005 | ||
| 1 | Nathan Srebro, Adi Shraibman: Rank, Trace-Norm and Max-Norm. COLT 2005: 545-560 | |
| 1 | Kfir Barhum | [5] |
| 2 | Oded Goldreich | [5] |
| 3 | Troy Lee | [3] [6] [7] [8] [9] [12] [14] [16] [17] |
| 4 | Nathan Linial (Nati Linial) | [2] [4] [10] [11] [15] |
| 5 | Shahar Mendelson | [2] |
| 6 | Gideon Schechtman | [2] [13] [17] |
| 7 | Robert Spalek | [9] |
| 8 | Nathan Srebro (Nati Srebro) | [1] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page