Shachar Lovett. Communication is bounded by root of rank. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. pages 842-846, ACM, 2014. [doi]
No references recorded for this publication.
No citations of this publication recorded.