|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 19 publication records. Showing 19 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket |
Stochastic Vehicle Routing with Recourse  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu |
Bypassing UGC from some optimal geometric inapproximability results. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sushant Sachdeva, Rishi Saket |
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Subhash Khot, Rishi Saket |
On the hardness of learning intersections of two halfspaces. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushant Sachdeva, Rishi Saket |
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu |
Bypassing UGC from some optimal geometric inapproximability results. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Subhash Khot, Rishi Saket |
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Rishi Saket |
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Preyas Popat, Rishi Saket |
Approximate Lasserre Integrality Gap for Unique Games. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rishi Saket |
Quasi-Random PCP and Hardness of 2-Catalog Segmentation. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Rishi Saket |
SDP Integrality Gaps with Local ell_1-Embeddability. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
integrality, metric, embedding, SDP |
| 1 | Subhash Khot, Rishi Saket |
Hardness of Minimizing and Learning DNF Expressions. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Rishi Saket |
On hardness of learning intersection of two halfspaces. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
learning, approximation, hardness, halfspaces |
| 1 | Parikshit Gopalan, Subhash Khot, Rishi Saket |
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Subhash Khot, Rishi Saket |
Hardness of Embedding Metric Spaces of Equal Size. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Subhash Khot, Rishi Saket |
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rishi Saket, Nicolas Navet |
Frame packing algorithms for automotive applications. |
J. Embedded Computing |
2006 |
DBLP BibTeX RDF |
|
| 1 | Subhash Khot, Rishi Saket |
A 3-Query Non-Adaptive PCP with Perfect Completeness. |
IEEE Conference on Computational Complexity |
2006 |
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 |
|
Displaying result #1 - #19 of 19 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")