The following pages link to Prasad Raghavendra (Q693757):
Displayed 50 items.
- Buffer management for colored packets with deadlines (Q693758) (← links)
- Coarse differentiation and multi-flows in planar graphs (Q848676) (← links)
- Perfectly reliable and secure message transmission tolerating mobile adversary (Q1017544) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Improved approximation algorithms for the spanning star forest problem (Q2392922) (← links)
- On mimicking networks representing minimum terminal cuts (Q2446595) (← links)
- Bounding the average sensitivity and noise sensitivity of polynomial threshold functions (Q2875180) (← links)
- Approximations for the isoperimetric and spectral profile of graphs and related parameters (Q2875190) (← links)
- Graph expansion and the unique games conjecture (Q2875199) (← links)
- Lower Bounds on the Size of Semidefinite Programming Relaxations (Q2941550) (← links)
- Hardness of Solving Sparse Overdetermined Linear Systems (Q2947543) (← links)
- (Q2969633) (← links)
- Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) (← links)
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627) (← links)
- List Decoding Tensor Products and Interleaved Codes (Q3115873) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- Approximate Constraint Satisfaction Requires Large LP Relaxations (Q3177811) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness (Q3541788) (← links)
- (Q3549614) (← links)
- (Q3549676) (← links)
- (Q3549708) (← links)
- Hardness of Learning Halfspaces with Noise (Q3558021) (← links)
- Approximating Sparsest Cut in Graphs of Bounded Treewidth (Q3588403) (← links)
- Improved Approximation Algorithms for the Spanning Star Forest Problem (Q3603455) (← links)
- Coarse Differentiation and Multi-flows in Planar Graphs (Q3603468) (← links)
- On Proactive Perfectly Secure Message Transmission (Q3608939) (← links)
- On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique (Q4554356) (← links)
- The matching problem has no small symmetric SDP (Q4575655) (← links)
- On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique (Q4575656) (← links)
- (Q4598219) (← links)
- (Q4633863) (← links)
- (Q4638054) (← links)
- Agnostic Learning of Monomials by Halfspaces Is Hard (Q4910575) (← links)
- Bypassing UGC from Some Optimal Geometric Inapproximability Results (Q4962201) (← links)
- Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs (Q4978005) (← links)
- Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
- (Q5009564) (← links)
- (Q5111409) (← links)
- (Q5111411) (← links)
- Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
- HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS (Q5122161) (← links)
- Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond (Q5144947) (← links)
- Lifting sum-of-squares lower bounds: degree-2 to degree-4 (Q5144970) (← links)
- List Decodable Learning via Sum of Squares (Q5146772) (← links)
- Extended Formulation Lower Bounds for Refuting Random CSPs (Q5146784) (← links)
- Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES (Q5171221) (← links)
- How to Round Any CSP (Q5171222) (← links)
- Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones (Q5236328) (← links)
- Many sparse cuts via higher eigenvalues (Q5415540) (← links)