Adi Shraibman

49 papers A* 3A 9B 1Journal 31Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
A study of the binary and Boolean rank of matrices with small constant real rank.
Discret. Appl. Math.
Michal Parnas, Adi Shraibman
2026 J jnl
Spiky Rank and Its Applications to Rigidity and Circuits.
CoRR
Lianna Hambardzumyan, Konstantin Myasnikov, Artur Riazanov, Morgan Shirley, Adi Shraibman
2026 J jnl
Spiky Rank and Its Applications to Rigidity and Circuits.
Electron. Colloquium Comput. Complex.
Lianna Hambardzumyan, Konstantin Myasnikov, Artur Riazanov, Morgan Shirley, Adi Shraibman
2025 B conf
A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank.
FCT
Michal Parnas, Adi Shraibman
2024 A conf
An Improved Protocol for ExactlyN with More Than 3 Players.
ITCS
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2024 J jnl
Automatic Extraction of Disease Risk Factors from Medical Publications.
CoRR
Maxim Rubchinsky, Ella Rabinovich, Adi Shraibman, Netanel Golan, Tali Sahar, Dorit Shweiki
2024 J jnl
The Rank-Ramsey Problem and the Log-Rank Conjecture.
CoRR
Gal Beniamini, Nati Linial, Adi Shraibman
2023 J jnl
An improved protocol for ExactlyN with more than 3 players.
CoRR
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2023 J jnl
An improved protocol for ExactlyN with more than 3 players.
Electron. Colloquium Comput. Complex.
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2023 A conf
The Strength of Equality Oracles in Communication.
ITCS
Toniann Pitassi, Morgan Shirley, Adi Shraibman
2022 J jnl
The Strength of Equality Oracles in Communication.
Electron. Colloquium Comput. Complex.
Toniann Pitassi, Morgan Shirley, Adi Shraibman
2021 A conf
An Improved Protocol for the Exactly-N Problem.
CCC
Nati Linial, Adi Shraibman
2021 J jnl
Property Testing of the Boolean and Binary Rank.
Theory Comput. Syst.
Michal Parnas, Dana Ron, Adi Shraibman
2020 J jnl
Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs.
CoRR
Noga Alon, Adi Shraibman
2020 J jnl
On maximal isolation sets in the uniform intersection matrix.
Australas. J Comb.
Michal Parnas, Adi Shraibman
2019 J jnl
Nondeterministic communication complexity with help and graph functions.
Theor. Comput. Sci.
Adi Shraibman
2019 J jnl
On maximal isolation sets in the uniform intersection matrix.
CoRR
Michal Parnas, Adi Shraibman
2019 A conf
On the Communication Complexity of High-Dimensional Permutations.
ITCS
Nati Linial, Toniann Pitassi, Adi Shraibman
2019 J jnl
Property testing of the Boolean and binary rank.
CoRR
Michal Parnas, Dana Ron, Adi Shraibman
2019 J jnl
The corruption bound, log-rank, and communication complexity.
Inf. Process. Lett.
Adi Shraibman
2018 J jnl
A note on multiparty communication complexity and the Hales-Jewett theorem.
Inf. Process. Lett.
Adi Shraibman
2017 J jnl
A Note on Multiparty Communication Complexity and the Hales-Jewett Theorem.
CoRR
Adi Shraibman
2017 J jnl
Nondeterministic Communication Complexity with Help and Graph Functions.
CoRR
Adi Shraibman
2017 J jnl
On The Communication Complexity of High-Dimensional Permutations.
CoRR
Nati Linial, Adi Shraibman
2017 J jnl
The Augmentation Property of Binary Matrices for the Binary and Boolean Rank.
CoRR
Michal Parnas, Adi Shraibman
2014 J jnl
Deterministic algorithms for matrix completion.
Random Struct. Algorithms
Eyal Heiman, Gideon Schechtman, Adi Shraibman
2014 J jnl
The Corruption Bound, Log Rank, and Communication Complexity.
CoRR
Adi Shraibman
2014 — conf
The Cover Number of a Matrix and its Algorithmic Applications.
APPROX-RANDOM
Noga Alon, Troy Lee, Adi Shraibman
2013 — conf
Matrix Completion From any Given Set of Observations.
NIPS
Troy Lee, Adi Shraibman
2013 A* conf
The approximate rank of a matrix and its algorithmic applications: approximate rank.
STOC
Noga Alon, Troy Lee, Adi Shraibman, Santosh S. Vempala
2009 A conf
An Approximation Algorithm for Approximation Rank.
CCC
Troy Lee, Adi Shraibman
2009 J jnl
Disjointness is Hard in the Multiparty Number-on-the-Forehead Model.
Comput. Complex.
Troy Lee, Adi Shraibman
2009 J jnl
Learning Complexity vs Communication Complexity.
Comb. Probab. Comput.
Nathan Linial, Adi Shraibman
2009 J jnl
Lower Bounds for Local Versions of Dimension Reductions.
Discret. Comput. Geom.
Gideon Schechtman, Adi Shraibman
2009 J jnl
Lower Bounds in Communication Complexity.
Found. Trends Theor. Comput. Sci.
Troy Lee, Adi Shraibman
2009 A conf
Lower Bounds on Quantum Multiparty Communication Complexity.
CCC
Troy Lee, Gideon Schechtman, Adi Shraibman
2009 J jnl
Lower bounds in communication complexity based on factorization norms.
Random Struct. Algorithms
Nati Linial, Adi Shraibman
2008 A conf
A Direct Product Theorem for Discrepancy.
CCC
Troy Lee, Adi Shraibman, Robert Spalek
2008 J jnl
An approximation algorithm for approximation rank
CoRR
Troy Lee, Adi Shraibman
2008 — conf
Approximation norms and duality for communication complexity lower bounds.
Computational Complexity of Discrete Problems
Troy Lee, Adi Shraibman
2008 A conf
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.
CCC
Troy Lee, Adi Shraibman
2008 J jnl
Disjointness is hard in the multi-party number-on-the-forehead model.
Electron. Colloquium Comput. Complex.
Troy Lee, Adi Shraibman
2008 A conf
Learning Complexity vs. Communication Complexity.
CCC
Nati Linial, Adi Shraibman
2007 — —
Complexity measures of sign matrices (מדדי מורכבות של מטריצות סימנים.).
Adi Shraibman
2007 J jnl
Complexity measures of sign matrices.
Comb.
Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman
2007 J jnl
Disjointness is hard in the multi-party number on the forehead model
CoRR
Troy Lee, Adi Shraibman
2007 A* conf
Lower bounds in communication complexity based on factorization norms.
STOC
Nati Linial, Adi Shraibman
2007 — conf
On Approximating the Average Distance Between Points.
APPROX-RANDOM
Kfir Barhum, Oded Goldreich, Adi Shraibman
2005 A* conf
Rank, Trace-Norm and Max-Norm.
COLT
Nathan Srebro, Adi Shraibman