|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 7 keywords
|
|
|
|
|
Results
Found 35 publication records. Showing 35 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Narendra M. Dixit, Piyush Srivastava, Nisheeth K. Vishnoi |
A Finite Population Model of Molecular Evolution: Theory and Computation  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi |
2log1-ε n hardness for the closest vector problem with preprocessing. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi |
Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi |
2log1-έn Hardness for Closest Vector Problem with Preprocessing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi |
Hardness of Approximating the Closest Vector Problem with Pre-Processing. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi |
Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi |
$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amit Deshpande, Madhur Tulsiani, Nisheeth K. Vishnoi |
Algorithms and Hardness for Subspace Approximation. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lorenzo Orecchia, Nisheeth K. Vishnoi |
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi |
On LP-Based Approximability for Strict CSPs. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Subhransu Maji, Nisheeth K. Vishnoi, Jitendra Malik |
Biased normalized cuts. |
CVPR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Orecchia, Nisheeth K. Vishnoi |
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anand Louis, Nisheeth K. Vishnoi |
Improved Algorithm for Degree Bounded Survivable Network Design Problem. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi |
Deterministically testing sparse polynomial identities of unbounded degree. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Steurer, Nisheeth K. Vishnoi |
Connections Between Unique Games and Multicut. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi |
On the Optimality of a Class of LP-based Algorithms. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi |
On the Fourier spectrum of symmetric Boolean functions. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Deshpande, Kasturi R. Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi |
Algorithms and Hardness for Subspace Approximation |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anand Louis, Nisheeth K. Vishnoi |
Improved Algorithm for Degree Bounded Survivable Network Design Problem |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi |
A Spectral Algorithm for Improving Graph Partitions |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi |
On the Optimality of a Class of LP-based Algorithms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi |
On partitioning graphs via single commodity flows. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
edge-separator, single-commodity max-flow, graph partitioning, spectral method, sparsest cut, matrix exponential |
| 1 | Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi |
Unique games on expanding constraint graphs are easy: extended abstract. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, semidefinite programming, expander graphs |
| 1 | Nisheeth K. Vishnoi |
The Impact of Noise on the Scaling of Collectives: The Nearest Neighbor Model [Extended Abstract]. |
HiPC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi |
Integrality gaps for sparsest cut and minimum linear arrangement problems. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi |
Caching with Expiration Times for Internet Applications. |
Internet Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Saurabh Agarwal, Rahul Garg, Nisheeth K. Vishnoi |
The Impact of Noise on the Scaling of Collectives: A Theoretical Approach. |
HiPC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi |
Hardness of Approximating the Closest Vector Problem with Pre-Processing. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Nisheeth K. Vishnoi |
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 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. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi |
On the Complexity of Hilbert's 17th Problem. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Lipton, Nisheeth K. Vishnoi |
Deterministic identity testing for multivariate polynomials. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi |
Who's The Weakest Link? |
SAGA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nisheeth K. Vishnoi |
Non Uniform Random Walks. |
DRW |
2003 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi |
Caching with expiration times. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #35 of 35 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")