Publications

• I. Blass, T. Sahar, A. Shraibman, N. Rappoport, M. Linial
  Predictive Model for Endometriosis with Clinical, Lifestyle and Genetic Information.
  30th Conference on Intelligent Systems for Molecular Biology, ISMB 2022.
  [Pdf]
  
  
• I. Blass, T. Sahar, A. Shraibman, D. Ofer, N. Rappoport, M. Linial
  Revisiting the Risk Factors for Endometriosis: A Machine Learning Approach.
  Journal of Personalized Medicine, 2022.
  [Pdf]
  
  
• N. Linial, A. Shraibman
  Larger Corner-Free Sets from Better NOF Exactly-N Protocols.
  Discrete Analysis, 2021.
  [Pdf]
  
  
• N. Linial, A. Shraibman
  An improved protocol for the exactly-N problem.
  36th Computational Complexity Conference, CCC 2021.
  [Pdf]
  
  
• M. Parnas, D. Ron, A. Shraibman
  Property testing of the Boolean and binary rank.
  Theory of Computing Systems, 2021.
  [Pdf]
  
  
• N. Alon, A. Shraibman
  Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs.
  Acta Mathematica Hungarica, 2020.
  [Pdf]
  
  
• M. Parnas, A. Shraibman
  On maximal isolation sets in the uniform intersection matrix.
  The Australasian Journal of Combinatorics, 2020.
  [Pdf]
  
  
• M. Parnas, D. Ron, A. Shraibman
  The Boolean Rank of the Uniform Intersection Matrix and a Family of its Submatricecs.
  Linear Algebra and its Applications, 2019.
  [Pdf]
  
  
• A. Shraibman
  Nondeterministic Communication Complexity with Help and Graph Functions.
  Theoretical Computer Science, 2019.
  [Pdf]
  
  
• N. Linial, T. Pitassi, A. Shraibman
  On the Communication Complexity of High-Dimensional Permutations.
  Innovations in Theoretical Computer Science (ITCS), 2019.
  [Pdf]
  
  
• M. Parnas, A. Shraibman
  The Augmentation Property of Binary Matrices for the Binary and Boolean Rank.
  Linear Algebra and its Applications, 2018.
  [Pdf]
  
  
• A. Shraibman
  A Note on Multiparty Communication Complexity and the Hales-Jewett Theorem.
  Information Processing Letters, 2018.
  [Pdf]
  
  
• A. Shraibman
  The Corruption Bound, Log Rank, and Communication Complexity.
  Information Processing Letters, 2018.
  [Pdf]
  
  
• N. Alon, T. Lee, A. Shraibman
  The Cover Number of a Matrix and its Algorithmic Applications.
  Approximation, Randomization, and Combinatorial Optimization (APPROX/RANDOM), 2014.
  [Pdf]
  
  
• T. Lee, A. Shraibman
  Matrix Completion From any Given Set of Observations.
  Neural Information Processing Systems (NIPS), 2013.
  [Pdf]
  
  
• N. Alon, T. Lee, A. Shraibman, S. Vempala
  The Approximate Rank of a Matrix and its Algorithmic Applications.
  Proc. STOC, pp. 675-384, 2013.
  [Pdf]
  
  
• E. Heiman, G. Schechtman, A. Shraibman
  Deterministic Algorithms for Matrix Completion.
  Random Structures & Algorithms, 45(2):306-317, 2014.
  Wiley Online Library and also [Pdf]
  
  
• T. Lee, A. Shraibman
  Lower Bounds in Communication Complexity.
  Foundations & Trends in Theoretical Computer Science, pp. 263-398, 2009.
  [Pdf]
  
  
• T. Lee, A. Shraibman
  An Approximation Algorithm for Approximation Rank.
  Annual IEEE Conference on Computational Complexity, pp. 351-357, 2009.
  [Pdf]
  
  
• T. Lee, G. Schechtman, A. Shraibman
  Lower Bounds on Quantum Multiparty Communication Complexity.
  Annual IEEE Conference on Computational Complexity, pp. 254-262, 2009.
  [Pdf]
  
  
• N. Linial, A. Shraibman
  Lower Bounds in Communication Complexity Based on Factorization Norms.
  Random Structures and Algorithms , 34(3):368-394, 2009. Conference version appeared in
  Proc. of 39th STOC, pp. 699-708, 2007.
  [Pdf]
  
  
• N. Linial, A. Shraibman
  Learning Complexity vs. Communication Complexity.
  Combinatorics, Probability and Computing, 18:227-245, 2009. Conference version appeared
  in the Annual IEEE Conference on Computational Complexity, pp. 53-63,  2008.
  [Pdf]
  
  
• T. Lee, A. Shraibman
  Disjointness is Hard in the Multi-Party Number-On-the-Forehead Model.
  Special issue of Computational Complexity, 18(2):309-336, 2009.
  Annual IEEE Conference on Computational Complexity, pp. 81-91, 2008.
  [Pdf]
  
  
• T. Lee, A. Shraibman, R. Spalek
  A Direct Product Theorem for Discrepancy.
  Annual IEEE Conference on Computational Complexity, pp. 71-80, 2008 .
  [Pdf]
  
  
• G. Schechtman and A. Shraibman
  Lower Bounds for Local Versions of Dimension Reductions.
  Discrete and computational geometry, 41(2):273-283, 2009.
  SpringerLink and also [Pdf]
  
  
• N. Linial, S. Mendelson, G. Schechtman and A. Shraibman
  Complexity Measures of Sign Matrices.
  Combinatorica, 27(4):439-463, 2007.
  SpringerLink and also [Pdf]
  
  
• K. Barhum, O. Goldreich, and A. Shraibman
  On Approximating the Average Distance Between Points.
  Lecture Notes in Computer Science, pp. 296-310, 2007.
  SpringerLink and also [Pdf]
  
  
• A. Shraibman, N. Srebro
  Rank, Trace-Norm and Max-Norm.
  18th Annual Conference on Learning Theory (COLT), pp. 545-560, 2005.
  SpringerLink and also [Pdf]
  
  
• M. London, A. Schreibman, M. Husser, M. E. Larkum and I. Segev
  The Information Efficacy of a Synapse.
  Nature Neuroscience, 5(4):332-340, 2002.
  [Pdf]