| 2008 |
|---|
| 11 | EE | Guy Kindler,
Assaf Naor,
Gideon Schechtman:
The UGC hardness threshold of the ℓp Grothendieck problem.
SODA 2008: 64-73 |
| 2007 |
|---|
| 10 | EE | Assaf Naor,
Gideon Schechtman:
Planar Earthmover Is Not in L1.
SIAM J. Comput. 37(3): 804-826 (2007) |
| 2006 |
|---|
| 9 | EE | Assaf Naor,
Gideon Schechtman:
Planar Earthmover is not in L_1.
FOCS 2006: 655-666 |
| 2005 |
|---|
| 8 | EE | Assaf Naor,
Gideon Schechtman:
Planar Earthmover is not in $L_1$
CoRR abs/cs/0509074: (2005) |
| 2004 |
|---|
| 7 | EE | 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 |
|---|
| 6 | EE | Uriel Feige,
Michael Langberg,
Gideon Schechtman:
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers.
FOCS 2002: 283-292 |
| 5 | EE | Uriel Feige,
Gideon Schechtman:
On the optimality of the random hyperplane rounding technique for MAX CUT.
Random Struct. Algorithms 20(3): 403-440 (2002) |
| 2001 |
|---|
| 4 | EE | Uriel Feige,
Gideon Schechtman:
On the integrality ratio of semidefinite relaxations of MAX CUT.
STOC 2001: 433-442 |
| 2000 |
|---|
| 3 | | 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 |
|---|
| 2 | | David Peleg,
Gideon Schechtman,
Avishai Wool:
Randomized Approximation of Bounded Multicovering Problems.
Algorithmica 18(1): 44-66 (1997) |
| 1993 |
|---|
| 1 | | David Peleg,
Gideon Schechtman,
Avishai Wool:
Approximating Bounded 0-1 Integer Linear Programs.
ISTCS 1993: 69-77 |
