( en | de | ru )

 

Disambiguation of "Shraibman, Adi"

Author of the publication

copydeleteadd this publication to your clipboard
The Augmentation Property of Binary Matrices for the Binary and Boolean Rank.

, and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Adi Heindl

Adi Palm

Adi Winteler

Adi Wibisono

Wael Adi

 

Other publications of authors with the same name

On the Communication Complexity of High-Dimensional Permutations., , and . ITCS, volume 124 of LIPIcs, page 54:1-54:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Learning Complexity vs Communication Complexity., and . Comb. Probab. Comput., 18 (1-2): 227-245 (2009)Property Testing of the Boolean and Binary Rank., , and . Theory Comput. Syst., 65 (8): 1193-1210 (2021)The approximate rank of a matrix and its algorithmic applications: approximate rank., , , and . STOC, page 675-684. ACM, (2013)Lower bounds in communication complexity based on factorization norms., and . Random Struct. Algorithms, 34 (3): 368-394 (2009)Lower Bounds in Communication Complexity., and . Foundations and Trends in Theoretical Computer Science, 3 (4): 263-398 (2009)The Strength of Equality Oracles in Communication., , and . ITCS, volume 251 of LIPIcs, page 89:1-89:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)An Approximation Algorithm for Approximation Rank., and . CCC, page 351-357. IEEE Computer Society, (2009)A Direct Product Theorem for Discrepancy., , and . CCC, page 71-80. IEEE Computer Society, (2008)Nondeterministic Communication Complexity with Help and Graph Functions.. CoRR, (2017)