Lower bounds in communication complexity based on factorization norms
Complexity measures of sign matrices
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC ’07
Combinatorica
Adi Shraibman
Gideon Schechtman
Shahar Mendelson
Online Matrix Completion for Signed Link Prediction