Adi Shraibman

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 21

Top Topics

Coloured Petri Nets

Binary Matrices

Automatic Extraction

Top Venues

Inf. Process. Lett.

Electron. Colloquium Comput. Complex.

Publications

Gal Beniamini, Nati Linial, Adi Shraibman
The Rank-Ramsey Problem and the Log-Rank Conjecture. CoRR (2024)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An Improved Protocol for ExactlyN with More Than 3 Players. ITCS (2024)
Maxim Rubchinsky, Ella Rabinovich, Adi Shraibman, Netanel Golan, Tali Sahar, Dorit Shweiki
Automatic Extraction of Disease Risk Factors from Medical Publications. CoRR (2024)
Toniann Pitassi, Morgan Shirley, Adi Shraibman
The Strength of Equality Oracles in Communication. ITCS (2023)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An improved protocol for ExactlyN with more than 3 players. Electron. Colloquium Comput. Complex. (2023)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An improved protocol for ExactlyN with more than 3 players. CoRR (2023)
Toniann Pitassi, Morgan Shirley, Adi Shraibman
The Strength of Equality Oracles in Communication. Electron. Colloquium Comput. Complex. (2022)
Michal Parnas, Dana Ron, Adi Shraibman
Property Testing of the Boolean and Binary Rank. Theory Comput. Syst. 65 (8) (2021)
Nati Linial, Adi Shraibman
An Improved Protocol for the Exactly-N Problem. Computational Complexity Conference (2021)
Michal Parnas, Adi Shraibman
On maximal isolation sets in the uniform intersection matrix. Australas. J Comb. 77 (2020)
Noga Alon, Adi Shraibman
Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs. CoRR (2020)
Michal Parnas, Adi Shraibman
On maximal isolation sets in the uniform intersection matrix. CoRR (2019)
Michal Parnas, Dana Ron, Adi Shraibman
Property testing of the Boolean and binary rank. CoRR (2019)
Nati Linial, Toniann Pitassi, Adi Shraibman
On the Communication Complexity of High-Dimensional Permutations. ITCS (2019)
Adi Shraibman
Nondeterministic communication complexity with help and graph functions. Theor. Comput. Sci. 782 (2019)
Adi Shraibman
The corruption bound, log-rank, and communication complexity. Inf. Process. Lett. 141 (2019)
Adi Shraibman
A note on multiparty communication complexity and the Hales-Jewett theorem. Inf. Process. Lett. 139 (2018)
Adi Shraibman
A Note on Multiparty Communication Complexity and the Hales-Jewett Theorem. CoRR (2017)
Nati Linial, Adi Shraibman
On The Communication Complexity of High-Dimensional Permutations. CoRR (2017)
Michal Parnas, Adi Shraibman
The Augmentation Property of Binary Matrices for the Binary and Boolean Rank. CoRR (2017)
Adi Shraibman
Nondeterministic Communication Complexity with Help and Graph Functions. CoRR (2017)
Noga Alon, Troy Lee, Adi Shraibman
The Cover Number of a Matrix and its Algorithmic Applications. APPROX-RANDOM (2014)
Eyal Heiman, Gideon Schechtman, Adi Shraibman
Deterministic algorithms for matrix completion. Random Struct. Algorithms 45 (2) (2014)
Adi Shraibman
The Corruption Bound, Log Rank, and Communication Complexity. CoRR (2014)
Troy Lee, Adi Shraibman
Matrix Completion From any Given Set of Observations. NIPS (2013)
Noga Alon, Troy Lee, Adi Shraibman, Santosh S. Vempala
The approximate rank of a matrix and its algorithmic applications: approximate rank. STOC (2013)
Nati Linial, Adi Shraibman
Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms 34 (3) (2009)
Nathan Linial, Adi Shraibman
Learning Complexity vs Communication Complexity. Comb. Probab. Comput. 18 (1-2) (2009)
Troy Lee, Gideon Schechtman, Adi Shraibman
Lower Bounds on Quantum Multiparty Communication Complexity. Computational Complexity Conference (2009)
Gideon Schechtman, Adi Shraibman
Lower Bounds for Local Versions of Dimension Reductions. Discret. Comput. Geom. 41 (2) (2009)
Troy Lee, Adi Shraibman
An Approximation Algorithm for Approximation Rank. Computational Complexity Conference (2009)
Troy Lee, Adi Shraibman
Lower Bounds in Communication Complexity. Found. Trends Theor. Comput. Sci. 3 (4) (2009)
Troy Lee, Adi Shraibman
Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. Comput. Complex. 18 (2) (2009)
Troy Lee, Adi Shraibman
Disjointness is hard in the multi-party number-on-the-forehead model. Electron. Colloquium Comput. Complex. 15 (003) (2008)
Troy Lee, Adi Shraibman
Approximation norms and duality for communication complexity lower bounds. Computational Complexity of Discrete Problems (2008)
Troy Lee, Adi Shraibman
An approximation algorithm for approximation rank CoRR (2008)
Troy Lee, Adi Shraibman, Robert Spalek
A Direct Product Theorem for Discrepancy. Computational Complexity Conference (2008)
Nati Linial, Adi Shraibman
Learning Complexity vs. Communication Complexity. Computational Complexity Conference (2008)
Troy Lee, Adi Shraibman
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. Computational Complexity Conference (2008)
Nati Linial, Adi Shraibman
Lower bounds in communication complexity based on factorization norms. STOC (2007)
Troy Lee, Adi Shraibman
Disjointness is hard in the multi-party number on the forehead model CoRR (2007)
Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman
Complexity measures of sign matrices. Comb. 27 (4) (2007)
Kfir Barhum, Oded Goldreich, Adi Shraibman
On Approximating the Average Distance Between Points. APPROX-RANDOM (2007)
Nathan Srebro, Adi Shraibman
Rank, Trace-Norm and Max-Norm. COLT (2005)