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, volume 574, pages 67–83, Elsevier, 2019. |

13 | Adi Shraibman. The corruption bound, log-rank, and communication complexity, Information Processing Letters, volume 141, pages 16–21, Elsevier, 2019. arxiv |

12 | Adi Shraibman. Nondeterministic communication complexity with help and graph functions, Theoretical Computer Science, volume 782, pages 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, volume 556, pages 70–99, Elsevier, 2018. |

10 | Adi Shraibman. A note on multiparty communication complexity and the Hales–Jewett theorem, Information Processing Letters, volume 139, pages 44–48, Elsevier, 2018. arxiv |

9 | Eyal Heiman, Gideon Schechtman and Adi Shraibman. Deterministic algorithms for matrix completion, Random Structures & Algorithms, volume 45, number 2, pages 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, volume 18, number 2, pages 309–336, 2009. arxiv |

7 | T. Lee and A. Shraibman. Lower bounds in communication complexity, Foundations and Trends in Theoretical Computer Science, volume 3, 2009. |

6 | N. Linial and A. Shraibman. Learning complexity versus communication complexity, Combinatorics, Probability, and Computing, volume 18, pages 227–245, 2009. |

5 | N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms, Random Structures and Algorithms, volume 34, pages 368–394, 2009. |

4 | Gideon Schechtman and Adi Shraibman. Lower bounds for local versions of dimension reductions, Discrete & Computational Geometry, volume 41, number 2, pages 273–283, Springer, 2009. |

3 | Kfir Barhum, Oded Goldreich and Adi Shraibman. On approximating the average distance between points, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 296–310, Springer, 2007. |

2 | N. Linial, S. Mendelson, G. Schechtman and A. Shraibman. Complexity measures of sign matrices, Combinatorica, volume 27, number 4, pages 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, volume 5, number 4, pages 332–340, Nature Publishing Group, 2002. |

11 | Nati Linial, Toniann Pitassi and Adi Shraibman. On the Communication Complexity of High-Dimensional Permutations, in 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, in 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, in Advances in Neural Information Processing Systems, pages 1781–1787, 2013. |

8 | N. Alon, T. Lee, A. Shraibman and S. Vempala. The approximate rank of a matrix and its algorithmic applications, in STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingJune 2013, pages 675–684, ACM, July 2013. |

7 | T. Lee, G. Schechtman and A. Shraibman. Lower bounds on quantum multiparty communication complexity, in 2009 24th Annual IEEE Conference on Computational Complexity, pages 254–262, IEEE, 2009. |

6 | T. Lee and A. Shraibman. An approximation algorithm for approximation rank, in 2009 24th Annual IEEE Conference on Computational Complexity, pages 351–357, IEEE, 2009. arxiv |

5 | T. Lee and A. Shraibman. Disjointness is hard in the multiparty number-on-the-forehead model, in 2008 23rd Annual IEEE Conference on Computational Complexity, pages 81–91, IEEE, 2008. |

4 | T. Lee, A. Shraibman and R. Špalek. A direct product theorem for discrepancy, in 2008 23rd Annual IEEE Conference on Computational Complexity, pages 71–80, IEEE, 2008. |

3 | N. Linial and A. Shraibman. Learning complexity versus communication complexity, in 2008 23rd Annual IEEE Conference on Computational Complexity, pages 384–393, IEEE, 2008. |

2 | N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms, in STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 699–708, ACM, June 2007. |

1 | Nathan Srebro and Adi Shraibman. Rank, trace-norm and max-norm, in International Conference on Computational Learning Theory, pages 545–560, 2005. |