| Publication | Date of Publication | Type |
|---|
The strength of equality oracles in communication
| 2024-09-25 | Paper |
Around the log-rank conjecture
Israel Journal of Mathematics | 2023-10-12 | Paper |
An improved protocol for ExactlyN with more than 3 players
| 2023-09-12 | Paper |
An improved protocol for the exactly-N problem*
| 2023-07-12 | Paper |
On the communication complexity of high-dimensional permutations
| 2022-07-18 | Paper |
Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols
discrete Analysis | 2022-02-10 | Paper |
Property testing of the Boolean and binary rank
Theory of Computing Systems | 2021-12-18 | Paper |
Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
Acta Mathematica Hungarica | 2020-12-18 | Paper |
On maximal isolation sets in the uniform intersection matrix
| 2020-07-29 | Paper |
Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemer\'{e}di Graphs and Hypergraphs
| 2020-01-02 | Paper |
Nondeterministic communication complexity with help and graph functions
Theoretical Computer Science | 2019-06-06 | Paper |
The Boolean rank of the uniform intersection matrix and a family of its submatrices
Linear Algebra and its Applications | 2019-05-29 | Paper |
The corruption bound, log-rank, and communication complexity
Information Processing Letters | 2018-11-09 | Paper |
A note on multiparty communication complexity and the Hales-Jewett theorem
Information Processing Letters | 2018-10-19 | Paper |
The augmentation property of binary matrices for the binary and Boolean rank
Linear Algebra and its Applications | 2018-08-29 | Paper |
On The Communication Complexity of High-Dimensional Permutations
| 2017-06-07 | Paper |
The cover number of a matrix and its algorithmic applications
| 2017-03-22 | Paper |
Deterministic algorithms for matrix completion
Random Structures \& Algorithms | 2014-10-16 | Paper |
The approximate rank of a matrix and its algorithmic applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Disjointness is hard in the multiparty number-on-the-forehead model
Computational Complexity | 2011-02-18 | Paper |
Learning complexity vs communication complexity
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Lower bounds in communication complexity
Foundations and Trends in Theoretical Computer Science | 2010-02-08 | Paper |
Lower bounds in communication complexity based on factorization norms
Random Structures \& Algorithms | 2009-06-16 | Paper |
Lower bounds for local versions of dimension reductions
Discrete \& Computational Geometry | 2009-05-13 | Paper |
On Approximating the Average Distance Between Points
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Lower bounds in communication complexity based on factorization norms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
Complexity measures of sign matrices
Combinatorica | 2008-10-21 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
