- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| j8 |      | Guy Kindler, Assaf Naor, Gideon Schechtman: The UGC Hardness Threshold of the Lp Grothendieck Problem. Math. Oper. Res. 35(2): 267-283 (2010) |
| 2009 | ||
| j7 | | Gideon Schechtman, Adi Shraibman: Lower Bounds for Local Versions of Dimension Reductions. Discrete & Computational Geometry 41(2): 273-283 (2009) |
| c6 | | Troy Lee, Gideon Schechtman, Adi Shraibman: Lower Bounds on Quantum Multiparty Communication Complexity. IEEE Conference on Computational Complexity 2009: 254-262 |
| 2008 | ||
| c5 | | Guy Kindler, Assaf Naor, Gideon Schechtman: The UGC hardness threshold of the ℓp Grothendieck problem. SODA 2008: 64-73 |
| 2007 | ||
| j6 | | Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman: Complexity measures of sign matrices. Combinatorica 27(4): 439-463 (2007) |
| j5 | | Assaf Naor, Gideon Schechtman: Planar Earthmover Is Not in L1. SIAM J. Comput. 37(3): 804-826 (2007) |
| 2006 | ||
| c4 | | |
| 2005 | ||
| i1 | | |
| 2004 | ||
| j4 | | Uriel Feige, Michael Langberg, Gideon Schechtman: Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. SIAM J. Comput. 33(6): 1338-1368 (2004) |
| 2002 | ||
| j3 | | Uriel Feige, Gideon Schechtman: On the optimality of the random hyperplane rounding technique for MAX CUT. Random Struct. Algorithms 20(3): 403-440 (2002) |
| c3 | | Uriel Feige, Michael Langberg, Gideon Schechtman: Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. FOCS 2002: 283-292 |
| 2001 | ||
| c2 | | Uriel Feige, Gideon Schechtman: On the integrality ratio of semidefinite relaxations of MAX CUT. STOC 2001: 433-442 |
| 2000 | ||
| j2 | | Itai Benjamini, Gideon Schechtman: Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z. Random Struct. Algorithms 17(1): 20-25 (2000) |
| 1997 | ||
| j1 | | David Peleg, Gideon Schechtman, Avishai Wool: Randomized Approximation of Bounded Multicovering Problems. Algorithmica 18(1): 44-66 (1997) |
| 1993 | ||
| c1 |  | David Peleg, Gideon Schechtman, Avishai Wool: Approximating Bounded 0-1 Integer Linear Programs. ISTCS 1993: 69-77 |
| 1 | Itai Benjamini | |
| 2 | Uriel Feige | |
| 3 | Guy Kindler | |
| 4 | Michael Langberg | |
| 5 | Troy Lee | |
| 6 | Nathan Linial (Nati Linial) | |
| 7 | Shahar Mendelson | |
| 8 | Assaf Naor | |
| 9 | David Peleg | |
| 10 | Adi Shraibman | |
| 11 | Avishai Wool |
Data released under the ODC-BY 1.0 license — See also our legal information page