|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 34 occurrences of 24 keywords
|
|
|
|
|
Results
Found 58 publication records. Showing 58 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu |
Bypassing UGC from some optimal geometric inapproximability results.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Prasad Raghavendra, Ning Tan |
Approximating CSPs with global cardinality constraints using SDP hierarchies. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
Testing odd-cycle-freeness in Boolean functions. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala |
Many sparse cuts via higher eigenvalues. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Prasad Raghavendra, David Steurer |
Rounding Semidefinite Programming Hierarchies via Global Correlation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
Testing Odd-Cycle-Freeness in Boolean Functions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer |
Making the long code shorter, with applications to the Unique Games Conjecture. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar |
Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala |
Many Sparse Cuts via Higher Eigenvalues |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer |
Making the long code shorter, with applications to the Unique Games Conjecture |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
Testing Odd-Cycle-Freeness in Boolean Functions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Prasad Raghavendra, Ning Tan |
Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Prasad Raghavendra, David Steurer |
Rounding Semidefinite Programming Hierarchies via Global Correlation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra |
Buffer Management for Colored Packets with Deadlines. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar |
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra |
Generic Techniques to Round SDP Relaxations. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala |
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou |
Finding Almost-Perfect Graph Bisections. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Prasad Raghavendra, David Steurer |
Rounding Semidefinite Programming Hierarchies via Global Correlation. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu |
Agnostic Learning of Monomials by Halfspaces is Hard. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP 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 | Prasad Raghavendra, David Steurer, Madhur Tulsiani |
Reductions Between Expansion Problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | James R. Lee, Prasad Raghavendra |
Coarse Differentiation and Multi-flows in Planar Graphs. |
Discrete & Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra |
Approximating Sparsest Cut in Graphs of Bounded Treewidth |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu |
Agnostic Learning of Monomials by Halfspaces is Hard |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer, Madhur Tulsiani |
Reductions Between Expansion Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra |
Approximating Sparsest Cut in Graphs of Bounded Treewidth. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer |
Graph expansion and the unique games conjecture. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer, Prasad Tetali |
Approximations for the isoperimetric and spectral profile of graphs and related parameters. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
graph expansion, small-set expansion, sparse principal component analysis, spectral profile, approximation algorithm, semidefinite programming |
| 1 | Ilias Diakonikolas, Prahladh Harsha, Adam Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan |
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
average sensitivity, boolean function, fourier analysis, noise sensitivity, polynomial threshold function |
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers. |
TOCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan |
Average sensitivity and noise sensitivity of polynomial threshold functions |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra |
Perfectly reliable and secure message transmission tolerating mobile adversary. |
IJACT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Learning Halfspaces with Noise. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer |
Towards computing the Grothendieck constant. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra |
Buffer management for colored packets with deadlines. |
SPAA |
2009 |
DBLP DOI BibTeX RDF |
dram scheduling, online algorithms, buffer management, packets scheduling, earliest deadline first |
| 1 | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu |
Agnostic Learning of Monomials by Halfspaces Is Hard. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Hardness of Learning, Dictatorship Tests, PCPs, Agnostic Learning |
| 1 | Prasad Raghavendra, David Steurer |
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
SDP hierarchies, Sherali-Adams hierarchy, integrality gap construction, approximation algorithms, semidefinite programming, hardness of approximation, unique games conjecture |
| 1 | Prasad Raghavendra, David Steurer |
How to Round Any CSP. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
rounding scheme, approximation algorithm, sensitivity analysis, semidefinite programming, constraint satisfaction problems, dimension reduction, integrality gap |
| 1 | T. S. Jayram, Swastik Kopparty, Prasad Raghavendra |
On the Communication Complexity of Read-Once AC^0 Formulae. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List decoding tensor products and interleaved codes. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
Johnson bound, generalized hamming weights, interleaved codes, linear transformations, list decoding, tensor products |
| 1 | James R. Lee, Prasad Raghavendra |
Coarse Differentiation and Multi-flows in Planar Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra |
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra |
Optimal algorithms and inapproximability results for every CSP? |
STOC |
2008 |
DBLP DOI BibTeX RDF |
dictatorship tests, rounding schemes, semidefinite programming, constraint satisfaction problem, unique games conjecture |
| 1 | Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz |
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
linear and semidefinite programming, metric labelling, multiway cut, integrality gaps, unique games conjecture |
| 1 | Prasad Raghavendra |
A Note on Yekhanin's Locally Decodable Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan |
On Proactive Perfectly Secure Message Transmission. |
ACISP |
2007 |
DBLP DOI BibTeX RDF |
Perfectly Secure Communication, Proactive security |
| 1 | Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh |
Improved Approximation Algorithms for the Spanning Star Forest Problem. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | James R. Lee, Prasad Raghavendra |
Coarse Differentiation and Multi-flows in Planar Graphs. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
A 3-query PCP over integers. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
sparse linear equations, hardness of approximation, probabilistically checkable proofs, linearity testing |
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Learning Halfspaces with Noise. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Learning Halfspaces with Noise. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #58 of 58 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")