SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Avner Magen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Shlomo Hoory, Avner Magen, Toniann Pitassi
Monotone Circuits for the Majority Function. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2006, pp:410-425 [Conf]
Ding Liu, Bernard Chazelle, Avner Magen
Approximate range searching in higher dimension. [Citation Graph (0, 0)][DBLP]
CCCG, 2004, pp:154-157 [Conf]
Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
Toward a Model for Backtracking and Dynamic Programming. [Citation Graph (0, 0)][DBLP]
IEEE Conference on Computational Complexity, 2005, pp:308-322 [Conf]
Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas
On-Line Algorithms for Market Equilibria. [Citation Graph (0, 0)][DBLP]
COCOON, 2005, pp:596-607 [Conf]
Eitan Bachmat, Tao-Kai Lam, Avner Magen
A Rigorous Analysis for Set-Up Time Models - A Metric Perspective. [Citation Graph (0, 0)][DBLP]
COCOON, 2006, pp:387-397 [Conf]
Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. [Citation Graph (0, 0)][DBLP]
FOCS, 2003, pp:318-0 [Conf]
Allan Borodin, David Cashman, Avner Magen
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?. [Citation Graph (0, 0)][DBLP]
ICALP, 2005, pp:943-955 [Conf]
Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
Simple Permutations Mix Well. [Citation Graph (0, 0)][DBLP]
ICALP, 2004, pp:770-781 [Conf]
Avner Magen
Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications. [Citation Graph (0, 0)][DBLP]
RANDOM, 2002, pp:239-253 [Conf]
Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
Sublinear-time approximation of Euclidean minimum spanning tree. [Citation Graph (0, 0)][DBLP]
SODA, 2003, pp:813-822 [Conf]
Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami
A sublinear algorithm for weakly approximating edit distance. [Citation Graph (0, 0)][DBLP]
STOC, 2003, pp:316-324 [Conf]
Bernard Chazelle, Ding Liu, Avner Magen
Sublinear geometric algorithms. [Citation Graph (0, 0)][DBLP]
STOC, 2003, pp:531-540 [Conf]
Nathan Linial, Avner Magen, Assaf Naor
Girth and euclidean distortion. [Citation Graph (0, 0)][DBLP]
STOC, 2002, pp:705-711 [Conf]
Nathan Linial, Avner Magen, Michael E. Saks
Trees and Euclidean Metrics. [Citation Graph (0, 0)][DBLP]
STOC, 1998, pp:169-175 [Conf]
Robert Krauthgamer, Nathan Linial, Avner Magen
Metric Embeddings--Beyond One-Dimensional Distortion. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 2004, v:31, n:3, pp:339-356 [Journal]
Nathan Linial, Avner Magen
Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:157-171 [Journal]
Bernard Chazelle, Ding Liu, Avner Magen
Sublinear Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2005, v:35, n:3, pp:627-646 [Journal]
Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2005, v:35, n:1, pp:91-109 [Journal]
Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
Simple permutations mix well. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:348, n:2-3, pp:251-261 [Journal]
Hamed Hatami, Avner Magen, Evangelos Markakis
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l₁ Embeddability of Negative Type Metrics. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:164-179 [Conf]
Bernard Chazelle, Ding Liu, Avner Magen
Approximate range searching in higher dimension. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2008, v:39, n:1, pp:24-29 [Journal]
Hamed Hatami, Avner Magen, Vangelis Markakis
Integrality gaps of semidefinite programs for Vertex Cover and relations to $\ell_1$ embeddability of Negative Type metrics [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Avner Magen
Dimensionality Reductions in l₂ that Preserve Volumes and Distance to Affine Spaces. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 2007, v:38, n:1, pp:139-153 [Journal]
Near Optimal Dimensionality Reductions That Preserve Volumes. [Citation Graph (, )][DBLP]
Optimal Sherali-Adams Gaps from Pairwise Independence. [Citation Graph (, )][DBLP]
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy. [Citation Graph (, )][DBLP]
Online Embeddings. [Citation Graph (, )][DBLP]
On the nonexistence of dimension reduction for $\ell2_2$ metrics. [Citation Graph (, )][DBLP]
Sublinear Geometric Algorithms. [Citation Graph (, )][DBLP]
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. [Citation Graph (, )][DBLP]
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. [Citation Graph (, )][DBLP]
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities. [Citation Graph (, )][DBLP]
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain. [Citation Graph (, )][DBLP]
On Quadratic Threshold CSPs. [Citation Graph (, )][DBLP]
Low Rank Matrix-Valued Chernoff Bounds and Applications [Citation Graph (, )][DBLP]
Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.306secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP