The SCEAS System
Navigation Menu

Search the dblp DataBase


Adi Shraibman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nathan Srebro, Adi Shraibman
    Rank, Trace-Norm and Max-Norm. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:545-560 [Conf]
  2. Kfir Barhum, Oded Goldreich, Adi Shraibman
    On Approximating the Average Distance Between Points. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:296-310 [Conf]
  3. Nati Linial, Adi Shraibman
    Lower bounds in communication complexity based on factorization norms. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:699-708 [Conf]

  4. A Direct Product Theorem for Discrepancy. [Citation Graph (, )][DBLP]

  5. Learning Complexity vs. Communication Complexity. [Citation Graph (, )][DBLP]

  6. Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. [Citation Graph (, )][DBLP]

  7. An Approximation Algorithm for Approximation Rank. [Citation Graph (, )][DBLP]

  8. Lower Bounds on Quantum Multiparty Communication Complexity. [Citation Graph (, )][DBLP]

  9. Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. [Citation Graph (, )][DBLP]

  10. Complexity measures of sign matrices. [Citation Graph (, )][DBLP]

  11. Disjointness is hard in the multi-party number on the forehead model [Citation Graph (, )][DBLP]

  12. An approximation algorithm for approximation rank [Citation Graph (, )][DBLP]

  13. Learning Complexity vs Communication Complexity. [Citation Graph (, )][DBLP]

  14. Lower Bounds for Local Versions of Dimension Reductions. [Citation Graph (, )][DBLP]

  15. Disjointness is hard in the multi-party number-on-the-forehead model. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002