dblp.uni-trier.dewww.uni-trier.de

Adi Shraibman

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Kfir Barhum [4]
2Oded Goldreich [4]
3Troy Lee [2] [5] [6] [7] [8]
4Nathan Linial (Nati Linial) [3] [9] [10] [12]
5Gideon Schechtman [11]
6Robert Spalek [8]
7Nathan Srebro [1]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)