Gideon Schechtman

Publication Activity (10 Years)

Years Active: 1993-2020
Publications (10 Years): 4

Top Topics

Rank Minimization

Linear Discriminant Analysis

Matrix Completion

Dimension Reduction

Top Venues

J. Approx. Theory

Discret. Comput. Geom.

Random Struct. Algorithms

Publications

Assaf Naor, Gilles Pisier, Gideon Schechtman
Impossibility of Dimension Reduction in the Nuclear Norm. Discret. Comput. Geom. 63 (2) (2020)
Gideon Schechtman
Entropy versus influence for complex functions of modulus one. CoRR (2020)
Assaf Naor, Gilles Pisier, Gideon Schechtman
Impossibility of dimension reduction in the nuclear norm. SODA (2018)
Assaf Naor, Gilles Pisier, Gideon Schechtman
Impossibility of dimension reduction in the nuclear norm. CoRR (2017)
Gideon Schechtman
norms. J. Approx. Theory 184 (2014)
Eyal Heiman, Gideon Schechtman, Adi Shraibman
Deterministic algorithms for matrix completion. Random Struct. Algorithms 45 (2) (2014)
Guy Kindler, Assaf Naor, Gideon Schechtman
Grothendieck Problem. Math. Oper. Res. 35 (2) (2010)
Troy Lee, Gideon Schechtman, Adi Shraibman
Lower Bounds on Quantum Multiparty Communication Complexity. Computational Complexity Conference (2009)
Gideon Schechtman, Adi Shraibman
Lower Bounds for Local Versions of Dimension Reductions. Discret. Comput. Geom. 41 (2) (2009)
Guy Kindler, Assaf Naor, Gideon Schechtman
Grothendieck problem. SODA (2008)
Assaf Naor, Gideon Schechtman
. SIAM J. Comput. 37 (3) (2007)
Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman
Complexity measures of sign matrices. Comb. 27 (4) (2007)
Assaf Naor, Gideon Schechtman
Planar Earthmover is not in L_1. FOCS (2006)
Assaf Naor, Gideon Schechtman
CoRR (2005)
Uriel Feige, Michael Langberg, Gideon Schechtman
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. SIAM J. Comput. 33 (6) (2004)
Uriel Feige, Gideon Schechtman
On the optimality of the random hyperplane rounding technique for MAX CUT. Random Struct. Algorithms 20 (3) (2002)
Uriel Feige, Michael Langberg, Gideon Schechtman
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. FOCS (2002)
Uriel Feige, Gideon Schechtman
On the integrality ratio of semidefinite relaxations of MAX CUT. STOC (2001)
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) (2000)
David Peleg, Gideon Schechtman, Avishai Wool
Randomized Approximation of Bounded Multicovering Problems. Algorithmica 18 (1) (1997)
David Peleg, Gideon Schechtman, Avishai Wool
Approximating Bounded 0-1 Integer Linear Programs. ISTCS (1993)