The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guy Kindler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
    On the Error Parameter of Dispersers. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:294-305 [Conf]
  2. Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi
    Hardness of Approximating the Closest Vector Problem with Pre-Processing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:216-225 [Conf]
  3. Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
    On Non-Approximability for Quadratic Programs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:206-215 [Conf]
  4. Irit Dinur, Guy Kindler, Shmuel Safra
    Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:99-111 [Conf]
  5. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
    Testing Juntas. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:103-112 [Conf]
  6. Navin Goyal, Guy Kindler, Michael E. Saks
    Lower Bounds for the Noisy Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:40-52 [Conf]
  7. Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell
    Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:146-154 [Conf]
  8. Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell
    Eliminating Cycles in the Discrete Torus. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:202-210 [Conf]
  9. Guy Kindler, Dan Romik
    On distributions computable by random walks on graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:131-138 [Conf]
  10. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
    Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:1-10 [Conf]
  11. Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell
    On the fourier tails of bounded functions over the discrete cube. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:437-446 [Conf]
  12. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:29-40 [Conf]
  13. Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra
    Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:205-243 [Journal]
  14. Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
    On Non-Approximability for Quadratic Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:058, pp:- [Journal]
  15. Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
    On the Error Parameter of Dispersers [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:061, pp:- [Journal]
  16. Guy Kindler, Ryan O'Donnell, Subhash Khot, Elchanan Mossel
    Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:101, pp:- [Journal]
  17. Irit Dinur, Guy Kindler, Shmuel Safra
    Approximating CVP to Within Almost Polynomial Factor is NP-Hard [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:48, pp:- [Journal]
  18. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:66, pp:- [Journal]
  19. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
    Testing juntas. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:753-787 [Journal]
  20. Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell
    Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:319-357 [Journal]
  21. Guy Kindler, Dan Romik
    On Distributions Computable by Random Walks on Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:4, pp:624-633 [Journal]
  22. Uriel Feige, Guy Kindler, Ryan O'Donnell
    Understanding Parallel Repetition Requires Understanding Foams. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:179-192 [Conf]

  23. Spherical Cubes and Rounding in High Dimensions. [Citation Graph (, )][DBLP]


  24. The UGC hardness threshold of the ℓp Grothendieck problem. [Citation Graph (, )][DBLP]


  25. Eliminating Cycles in the Discrete Torus. [Citation Graph (, )][DBLP]


  26. Understanding Parallel Repetition Requires Understanding Foams. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002