Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
The Log-Approximate-Rank Conjecture Is False | Journal of the ACM |
| 6 | 2020 |
10.1137/16M1059369 | 2018 | |||
A Discrepancy Lower Bound for Information Complexity | Algorithmica |
| 5 | 2016 |
Communication is Bounded by Root of Rank | Journal of the ACM |
| 9 | 2016 |
An Additive Combinatorics Approach Relating Rank to Communication Complexity | Journal of the ACM |
| 2 | 2014 |