Guy Kindler
45th Annual IEEE Symposium on Foundations of Computer Science · 2004
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 4 researchers here, as inferred from the citation graph.
Whom Guy Kindler trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Guy Kindler overall
- Elchanan Mossel
- Subhash Khot
- Oded Goldreich
- Badih Ghazi
- Ilias Diakonikolas
- Joe Neeman
- Niv Buchbinder
- Prasad Raghavendra
- Nisheeth K. Vishnoi
- Ryan O'Donnell
Papers from Guy Kindler's perspective
Ordered by how strongly the researchers Guy Kindler trusts endorse each paper. Same corpus, a different order for every researcher.
- Reducibility Among Combinatorial Problems
- On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
- Some optimal inapproximability results
- On the distribution of the fourier spectrum of Boolean functions
- 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)
- An Introduction to Probability Theory and Its Applications
- Handbook of Mathematical Functions.
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Probabilistic checking of proofs: a new characterization of NP
- A threshold of ln n for approximating set cover (preliminary version)
Their papers
- Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (2004) — 885 citations