≡ X En

בית הספר למדעי המחשב

המכללה האקדמית תל-אביב

פרופ' עדי שרייבמן

פרופ' עדי שרייבמן

הצגה: רשמי, שנתי, לינארי.

מאמרים בעתונות מדעית

15 Michal Parnas, Dana Ron and Adi Shraibman. Property Testing of the Boolean and Binary Rank, Theory of Computing Systems (2021), June 3, 2021.
14 Michal Parnas, Dana Ron and Adi Shraibman. The Boolean rank of the uniform intersection matrix and a family of its submatrices, Linear Algebra and its Applications, כרך 574, עמודים 67–83, Elsevier, 2019.
13 Adi Shraibman. The corruption bound, log-rank, and communication complexity, Information Processing Letters, כרך 141, עמודים 16–21, Elsevier, 2019. arxiv
12 Adi Shraibman. Nondeterministic communication complexity with help and graph functions, Theoretical Computer Science, כרך 782, עמודים 1–10, Elsevier, 2019. arxiv
11 Michal Parnas and Adi Shraibman. The augmentation property of binary matrices for the binary and Boolean rank, Linear Algebra and its Applications, כרך 556, עמודים 70–99, Elsevier, 2018.
10 Adi Shraibman. A note on multiparty communication complexity and the Hales–Jewett theorem, Information Processing Letters, כרך 139, עמודים 44–48, Elsevier, 2018. arxiv
9 Eyal Heiman, Gideon Schechtman and Adi Shraibman. Deterministic algorithms for matrix completion, Random Structures & Algorithms, כרך 45, מספר 2, עמודים 306–317, Wiley Online Library, 2014.
8 T. Lee and A. Shraibman. Disjointness is hard in the multiparty number-on-the-forehead model, Computational Complexity, כרך 18, מספר 2, עמודים 309–336, 2009. arxiv
7 T. Lee and A. Shraibman. Lower bounds in communication complexity, Foundations and Trends in Theoretical Computer Science, כרך 3, 2009.
6 N. Linial and A. Shraibman. Learning complexity versus communication complexity, Combinatorics, Probability, and Computing, כרך 18, עמודים 227–245, 2009.
5 N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms, Random Structures and Algorithms, כרך 34, עמודים 368–394, 2009.
4 Gideon Schechtman and Adi Shraibman. Lower bounds for local versions of dimension reductions, Discrete & Computational Geometry, כרך 41, מספר 2, עמודים 273–283, Springer, 2009.
3 Kfir Barhum, Oded Goldreich and Adi Shraibman. On approximating the average distance between points, באוסף Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, עמודים 296–310, Springer, 2007.
2 N. Linial, S. Mendelson, G. Schechtman and A. Shraibman. Complexity measures of sign matrices, Combinatorica, כרך 27, מספר 4, עמודים 439–463, 2007.
1 Michael London, Adi Schreibman, Michael HȨusser, Matthew E Larkum and Idan Segev. The information efficacy of a synapse, Nature neuroscience, כרך 5, מספר 4, עמודים 332–340, Nature Publishing Group, 2002.

מאמרים בכנסים

11 Nati Linial, Toniann Pitassi and Adi Shraibman. On the Communication Complexity of High-Dimensional Permutations, באוסף 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018. arxiv
10 Noga Alon, Troy Lee and Adi Shraibman. The cover number of a matrix and its algorithmic applications, באוסף Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014), 2014.
9 Troy Lee and Adi Shraibman. Matrix completion from any given set of observations, באוסף Advances in Neural Information Processing Systems, עמודים 1781–1787, 2013.
8 N. Alon, T. Lee, A. Shraibman and S. Vempala. The approximate rank of a matrix and its algorithmic applications, באוסף STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingJune 2013, עמודים 675–684, ACM, July 2013.
7 T. Lee, G. Schechtman and A. Shraibman. Lower bounds on quantum multiparty communication complexity, באוסף 2009 24th Annual IEEE Conference on Computational Complexity, עמודים 254–262, IEEE, 2009.
6 T. Lee and A. Shraibman. An approximation algorithm for approximation rank, באוסף 2009 24th Annual IEEE Conference on Computational Complexity, עמודים 351–357, IEEE, 2009. arxiv
5 T. Lee and A. Shraibman. Disjointness is hard in the multiparty number-on-the-forehead model, באוסף 2008 23rd Annual IEEE Conference on Computational Complexity, עמודים 81–91, IEEE, 2008.
4 T. Lee, A. Shraibman and R. Špalek. A direct product theorem for discrepancy, באוסף 2008 23rd Annual IEEE Conference on Computational Complexity, עמודים 71–80, IEEE, 2008.
3 N. Linial and A. Shraibman. Learning complexity versus communication complexity, באוסף 2008 23rd Annual IEEE Conference on Computational Complexity, עמודים 384–393, IEEE, 2008.
2 N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms, באוסף STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, עמודים 699–708, ACM, June 2007.
1 Nathan Srebro and Adi Shraibman. Rank, trace-norm and max-norm, באוסף International Conference on Computational Learning Theory, עמודים 545–560, 2005.
`