default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdi Shraibman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif
, Morgan Shirley, Adi Shraibman:
An Improved Protocol for ExactlyN with More Than 3 Players. ITCS 2024: 58:1-58:23- [i17]Gal Beniamini, Nati Linial, Adi Shraibman:
The Rank-Ramsey Problem and the Log-Rank Conjecture. CoRR abs/2405.07337 (2024) - [i16]Maxim Rubchinsky, Ella Rabinovich, Adi Shraibman, Netanel Golan, Tali Sahar, Dorit Shweiki:
Automatic Extraction of Disease Risk Factors from Medical Publications. CoRR abs/2407.07373 (2024) - 2023
- [c14]Toniann Pitassi, Morgan Shirley, Adi Shraibman:
The Strength of Equality Oracles in Communication. ITCS 2023: 89:1-89:19 - [i15]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman:
An improved protocol for ExactlyN with more than 3 players. CoRR abs/2309.06554 (2023) - [i14]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman:
An improved protocol for ExactlyN with more than 3 players. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i13]Toniann Pitassi, Morgan Shirley, Adi Shraibman:
The Strength of Equality Oracles in Communication. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j12]Michal Parnas, Dana Ron, Adi Shraibman:
Property Testing of the Boolean and Binary Rank. Theory Comput. Syst. 65(8): 1193-1210 (2021) - [c13]Nati Linial, Adi Shraibman:
An Improved Protocol for the Exactly-N Problem. CCC 2021: 2:1-2:8 - 2020
- [j11]Michal Parnas, Adi Shraibman:
On maximal isolation sets in the uniform intersection matrix. Australas. J Comb. 77: 285-300 (2020) - [i12]Noga Alon, Adi Shraibman:
Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs. CoRR abs/2001.00387 (2020)
2010 – 2019
- 2019
- [j10]Adi Shraibman:
The corruption bound, log-rank, and communication complexity. Inf. Process. Lett. 141: 16-21 (2019) - [j9]Adi Shraibman:
Nondeterministic communication complexity with help and graph functions. Theor. Comput. Sci. 782: 1-10 (2019) - [c12]Nati Linial, Toniann Pitassi, Adi Shraibman:
On the Communication Complexity of High-Dimensional Permutations. ITCS 2019: 54:1-54:20 - [i11]Michal Parnas, Adi Shraibman:
On maximal isolation sets in the uniform intersection matrix. CoRR abs/1907.11632 (2019) - [i10]Michal Parnas, Dana Ron, Adi Shraibman:
Property testing of the Boolean and binary rank. CoRR abs/1908.11632 (2019) - 2018
- [j8]Adi Shraibman:
A note on multiparty communication complexity and the Hales-Jewett theorem. Inf. Process. Lett. 139: 44-48 (2018) - 2017
- [i9]Nati Linial, Adi Shraibman:
On The Communication Complexity of High-Dimensional Permutations. CoRR abs/1706.02207 (2017) - [i8]Adi Shraibman:
A Note on Multiparty Communication Complexity and the Hales-Jewett Theorem. CoRR abs/1706.02277 (2017) - [i7]Michal Parnas, Adi Shraibman:
The Augmentation Property of Binary Matrices for the Binary and Boolean Rank. CoRR abs/1706.06900 (2017) - [i6]Adi Shraibman:
Nondeterministic Communication Complexity with Help and Graph Functions. CoRR abs/1710.09143 (2017) - 2014
- [j7]Eyal Heiman, Gideon Schechtman, Adi Shraibman:
Deterministic algorithms for matrix completion. Random Struct. Algorithms 45(2): 306-317 (2014) - [c11]Noga Alon, Troy Lee, Adi Shraibman:
The Cover Number of a Matrix and its Algorithmic Applications. APPROX-RANDOM 2014: 34-47 - [i5]Adi Shraibman:
The Corruption Bound, Log Rank, and Communication Complexity. CoRR abs/1409.4035 (2014) - 2013
- [c10]Troy Lee, Adi Shraibman:
Matrix Completion From any Given Set of Observations. NIPS 2013: 1781-1787 - [c9]Noga Alon, Troy Lee, Adi Shraibman, Santosh S. Vempala:
The approximate rank of a matrix and its algorithmic applications: approximate rank. STOC 2013: 675-684
2000 – 2009
- 2009
- [j6]Troy Lee, Adi Shraibman:
Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. Comput. Complex. 18(2): 309-336 (2009) - [j5]Nathan Linial, Adi Shraibman:
Learning Complexity vs Communication Complexity. Comb. Probab. Comput. 18(1-2): 227-245 (2009) - [j4]Gideon Schechtman, Adi Shraibman:
Lower Bounds for Local Versions of Dimension Reductions. Discret. Comput. Geom. 41(2): 273-283 (2009) - [j3]Troy Lee, Adi Shraibman:
Lower Bounds in Communication Complexity. Found. Trends Theor. Comput. Sci. 3(4): 263-398 (2009) - [j2]Nati Linial, Adi Shraibman:
Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms 34(3): 368-394 (2009) - [c8]Troy Lee, Gideon Schechtman, Adi Shraibman:
Lower Bounds on Quantum Multiparty Communication Complexity. CCC 2009: 254-262 - [c7]Troy Lee, Adi Shraibman:
An Approximation Algorithm for Approximation Rank. CCC 2009: 351-357 - 2008
- [c6]Nati Linial, Adi Shraibman:
Learning Complexity vs. Communication Complexity. CCC 2008: 53-63 - [c5]Troy Lee, Adi Shraibman, Robert Spalek:
A Direct Product Theorem for Discrepancy. CCC 2008: 71-80 - [c4]Troy Lee, Adi Shraibman:
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. CCC 2008: 81-91 - [i4]Troy Lee, Adi Shraibman:
Approximation norms and duality for communication complexity lower bounds. Computational Complexity of Discrete Problems 2008 - [i3]Troy Lee, Adi Shraibman:
An approximation algorithm for approximation rank. CoRR abs/0809.2093 (2008) - [i2]Troy Lee, Adi Shraibman:
Disjointness is hard in the multi-party number-on-the-forehead model. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [b1]Adi Shraibman:
Complexity measures of sign matrices (מדדי מורכבות של מטריצות סימנים.). Hebrew University of Jerusalem, Israel, 2007 - [j1]Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman:
Complexity measures of sign matrices. Comb. 27(4): 439-463 (2007) - [c3]Kfir Barhum, Oded Goldreich, Adi Shraibman:
On Approximating the Average Distance Between Points. APPROX-RANDOM 2007: 296-310 - [c2]Nati Linial, Adi Shraibman:
Lower bounds in communication complexity based on factorization norms. STOC 2007: 699-708 - [i1]Troy Lee, Adi Shraibman:
Disjointness is hard in the multi-party number on the forehead model. CoRR abs/0712.4279 (2007) - 2005
- [c1]Nathan Srebro, Adi Shraibman:
Rank, Trace-Norm and Max-Norm. COLT 2005: 545-560
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
