default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGideon Schechtman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j11]Assaf Naor, Gilles Pisier, Gideon Schechtman:
Impossibility of Dimension Reduction in the Nuclear Norm. Discret. Comput. Geom. 63(2): 319-345 (2020)- [i3]Gideon Schechtman:
Entropy versus influence for complex functions of modulus one. CoRR abs/2009.12753 (2020)
2010 – 2019
- 2018
- [c7]Assaf Naor, Gilles Pisier, Gideon Schechtman:
Impossibility of dimension reduction in the nuclear norm. SODA 2018: 1345-1352 - 2017
- [i2]Assaf Naor, Gilles Pisier, Gideon Schechtman:
Impossibility of dimension reduction in the nuclear norm. CoRR abs/1710.08896 (2017) - 2014
- [j10]Gideon Schechtman
:
No greedy bases for matrix spaces with mixed lp and lq norms. J. Approx. Theory 184: 100-110 (2014) - [j9]Eyal Heiman, Gideon Schechtman, Adi Shraibman:
Deterministic algorithms for matrix completion. Random Struct. Algorithms 45(2): 306-317 (2014) - 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)
2000 – 2009
- 2009
- [j7]Gideon Schechtman, Adi Shraibman:
Lower Bounds for Local Versions of Dimension Reductions. Discret. Comput. Geom. 41(2): 273-283 (2009) - [c6]Troy Lee, Gideon Schechtman, Adi Shraibman:
Lower Bounds on Quantum Multiparty Communication Complexity. CCC 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. Comb. 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]Assaf Naor, Gideon Schechtman:
Planar Earthmover is not in L_1. FOCS 2006: 655-666 - 2005
- [i1]Assaf Naor, Gideon Schechtman:
Planar Earthmover is not in L1. CoRR abs/cs/0509074 (2005) - 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)
1990 – 1999
- 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
1970 – 1979
- 1976
- [b1]Gideon Schechtman:
מחוברים ישרים של LP ומרחבים אוניברסליים (Complemented subspaces of Lp and universal spaces.). Hebrew University of Jerusalem, Israel, 1976
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-04-24 23:10 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:
