The following pages link to Avner Magen (Q430837):
Displaying 39 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Metric embeddings -- beyond one-dimensional distortion (Q701786) (← links)
- Analysis of set-up time models: a metric perspective (Q935161) (← links)
- Low distortion Euclidean embeddings of trees (Q1269777) (← links)
- Girth and Euclidean distortion (Q1606019) (← links)
- Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders (Q1850474) (← links)
- Dimensionality reductions in \(\ell_{2}\) that preserve volumes and distance to affine spaces (Q2385151) (← links)
- Approximate range searching in higher dimension (Q2456663) (← links)
- Simple permutations mix well (Q2581269) (← links)
- Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy (Q2911610) (← links)
- (Q2913812) (← links)
- On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities (Q2920127) (← links)
- (Q3002766) (← links)
- How well can primal-dual and local-ratio algorithms perform? (Q3189012) (← links)
- Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities (Q3503845) (← links)
- Near Optimal Dimensionality Reductions That Preserve Volumes (Q3541817) (← links)
- On Quadratic Threshold CSPs (Q3557031) (← links)
- Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain (Q3569826) (← links)
- Girth and euclidean distortion (Q3579194) (← links)
- A sublinear algorithm for weakly approximating edit distance (Q3581249) (← links)
- Sublinear geometric algorithms (Q3581255) (← links)
- Online Embeddings (Q3588411) (← links)
- A Rigorous Analysis for Set-Up Time Models – A Metric Perspective (Q3591308) (← links)
- Monotone Circuits for the Majority Function (Q3595404) (← links)
- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics (Q3603463) (← links)
- Optimal Sherali-Adams Gaps from Pairwise Independence (Q3638873) (← links)
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy (Q3638882) (← links)
- (Q4440441) (← links)
- (Q4471376) (← links)
- (Q4542534) (← links)
- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to $\ell_1$ Embeddability of Negative Type Metrics (Q5189507) (← links)
- Low Rank Matrix-Valued Chernoff Bounds and Approximate Matrix Multiplication (Q5365128) (← links)
- Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy (Q5390606) (← links)
- (Q5403036) (← links)
- Automata, Languages and Programming (Q5466512) (← links)
- Sublinear Geometric Algorithms (Q5470705) (← links)
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (Q5700570) (← links)
- Automata, Languages and Programming (Q5716841) (← links)
- Computing and Combinatorics (Q5716981) (← links)
