Travelled to:2 × USA
Collaborated with:N.Linial N.Alon T.Lee S.Vempala
Talks about:approxim (2) rank (2) algorithm (1) communic (1) complex (1) matrix (1) factor (1) applic (1) lower (1) bound (1)
Person: Adi Shraibman
DBLP: Shraibman:Adi
Contributed to:
20132007Wrote 2 papers:
- STOC-2013-AlonLSV #algorithm #approximate #matrix #rank
- The approximate rank of a matrix and its algorithmic applications: approximate rank (NA, TL, AS, SV), pp. 675–684.
- STOC-2007-LinialS #bound #communication #complexity
- Lower bounds in communication complexity based on factorization norms (NL, AS), pp. 699–708.