Shmuel Safra
TALG · 1998–2006
A researcher in the Science corpus: 3 papers; trusts 3 researchers and is trusted by 7 researchers here, as inferred from the citation graph.
Whom Shmuel Safra trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Shmuel Safra overall
- Eli Ben-Sasson
- Srinath T. V. Setty
- Subhash Khot
- Michael Walfish
- Paul Valiant
- Yuval Ishai
- Alessandro Chiesa
- Andrew Justin Blumberg
- Bryan Parno
- Victor Vu
Papers from Shmuel Safra's perspective
Ordered by how strongly the researchers Shmuel Safra trusts endorse each paper. Same corpus, a different order for every researcher.
- Probabilistic checking of proofs: a new characterization of NP
- A threshold of ln n for approximating set cover (preliminary version)
- On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
- Expander flows, geometric embeddings and graph partitioning (Symposium on the Theory of Computing)
- Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (45th Annual IEEE Symposium on Foundations of Computer Science)
- The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/ (IEEE Annual Symposium on Foundations of Computer Science)
- Some optimal inapproximability results
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- IP = PSPACE
- The Strength of Weak Learnability
Their papers
- On the hardness of approximating minimum vertex cover (2005) — 730 citations
- Algorithmic construction of sets for k-restrictions (2006) — 314 citations
- Probabilistic checking of proofs: a new characterization of NP (1998)