The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nisheeth K. Vishnoi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
    On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:112-119 [Conf]
  2. Nisheeth K. Vishnoi
    Non Uniform Random Walks. [Citation Graph (0, 0)][DBLP]
    DRW, 2003, pp:345-358 [Conf]
  3. 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]
  4. Subhash Khot, Nisheeth K. Vishnoi
    The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:53-62 [Conf]
  5. Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
    On the Complexity of Hilbert's 17th Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:237-249 [Conf]
  6. Saurabh Agarwal, Rahul Garg, Nisheeth K. Vishnoi
    The Impact of Noise on the Scaling of Collectives: A Theoretical Approach. [Citation Graph (0, 0)][DBLP]
    HiPC, 2005, pp:280-289 [Conf]
  7. Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
    Who's The Weakest Link? [Citation Graph (0, 0)][DBLP]
    SAGA, 2003, pp:108-116 [Conf]
  8. Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
    Caching with expiration times. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:540-547 [Conf]
  9. Richard J. Lipton, Nisheeth K. Vishnoi
    Deterministic identity testing for multivariate polynomials. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:756-760 [Conf]
  10. Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi
    Integrality gaps for sparsest cut and minimum linear arrangement problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:537-546 [Conf]

  11. The Impact of Noise on the Scaling of Collectives: The Nearest Neighbor Model [Extended Abstract]. [Citation Graph (, )][DBLP]


  12. On partitioning graphs via single commodity flows. [Citation Graph (, )][DBLP]


  13. Unique games on expanding constraint graphs are easy: extended abstract. [Citation Graph (, )][DBLP]


  14. Improved Algorithm for Degree Bounded Survivable Network Design Problem. [Citation Graph (, )][DBLP]


  15. On the Fourier spectrum of symmetric Boolean functions. [Citation Graph (, )][DBLP]


  16. Improved Algorithm for Degree Bounded Survivable Network Design Problem [Citation Graph (, )][DBLP]


  17. A Spectral Algorithm for Improving Graph Partitions [Citation Graph (, )][DBLP]


  18. Algorithms and Hardness for Subspace Approximation [Citation Graph (, )][DBLP]


  19. On the Optimality of a Class of LP-based Algorithms [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.025secs
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