Avner Magen

Q: What Schools Are Affiliated With Avner Magen

Avner Magen is affiliated with the following schools: Hebrew University of Jerusalem, University of Toronto

Avner Magen's AcademicInfluence.com Rankings

Avner Magen

Computer Science

#10294

World Rank

#10799

Historical Rank

Database

#10079

World Rank

#10695

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Avner Magen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Avner Magen was an associate professor of computer science at the University of Toronto whose research focused on the theory of metric embeddings, discrete geometry and computational geometry. He completed his undergraduate and graduate studies at the Hebrew University of Jerusalem, and received his Ph.D. in Computer Science in 2002, under the supervision of Nati Linial. He held a postdoctoral fellowship at NEC Research in Princeton, New Jersey, from 2000 until 2002. He joined the University of Toronto in 2002, first as a postdoctoral fellow, and then as an assistant professor in 2004. He was promoted to associate professor in 2009.

(See a Problem?)

Avner Magen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Rank bounds and integrality gaps for cutting planes procedures (2003) (126)
A sublinear algorithm for weakly approximating edit distance (2003) (99)
Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications (2002) (80)
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy (2007) (71)
SDP Gaps from Pairwise Independence (2012) (59)
Toward a Model for Backtracking and Dynamic Programming (2005) (58)
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (2005) (57)
Low rank matrix-valued chernoff bounds and approximate matrix multiplication (2010) (53)
Sublinear geometric algorithms (2003) (49)
Girth and euclidean distortion (2002) (40)
Dimensionality Reductions in ℓ2 that Preserve Volumes and Distance to Affine Spaces (2007) (38)
Optimal Sherali-Adams Gaps from Pairwise Independence (2009) (36)
Near Optimal Dimensionality Reductions That Preserve Volumes (2008) (29)
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy (2009) (28)
Simple permutations mix well (2005) (26)
Approximate range searching in higher dimension (2004) (26)
Sublinear-time approximation of Euclidean minimum spanning tree (2003) (25)
Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders (2000) (23)
Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver Hierarchy (2010) (22)
Monotone Circuits for the Majority Function (2006) (21)
Girth and Euclidean distortion (2002) (19)
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics (2006) (18)
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain (2010) (18)
How well can primal-dual and local-ratio algorithms perform? (2005) (18)
Trees and Euclidean metrics (1998) (16)
Robust Algorithms for Max Independent Set on Minor-Free Graphs Based on the Sherali-Adams Hierarchy (2009) (15)
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities (2008) (15)
Low distortion euclidean embeddings of trees (1998) (13)
Metric Embeddings—Beyond One-Dimensional Distortion (2004) (12)
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy (2011) (9)
On Quadratic Threshold CSPs (2010) (7)
Limitations of the Sherali-Adams Lift and Project System: Compromising Local and Global Arguments (2008) (7)
The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs (2010) (7)
Designing oligo libraries taking alternative splicing into account (2001) (6)
Randomized Primitives For Linear Algebra and Applications (2013) (6)
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities (2009) (5)
Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy (2006) (5)
On the nonexistence of dimension reduction for ℓ22 metrics (2008) (4)
Online Embeddings (2010) (3)
Sub-linear approximation of euclidean minimum spanning tree (2005) (3)
Analysis of set-up time models: A metric perspective (2008) (3)
Low Rank Matrix-Valued Chernoff Bounds and Applications (2010) (3)
On-Line Algorithms for Market Equilibria (2005) (3)
On-line embeddings (2010) (2)
On the nonexistence of dimension reduction for $\ell2_2$ metrics. (2008) (2)
Results from a one dimensional code for simulating the ductile break-up process of shaped charge jets and expanding rings (1994) (1)
A Rigorous Analysis for Set-Up Time Models - A Metric Perspective (2006) (1)
CSC 2411-Linear Programming and Combinatorial Optimization ∗ Lecture 12 : Approximation Algorithms using Tools from LP (2005) (0)
On the Euclidicity of metric spaces (2001) (0)
Low distortion Eu lidean embeddings of treesNathan (1999) (0)
CSC 2411-Linear Programming and Combinatorial Optimization � Lecture 3 : Geometric Aspects of Linear Programming and an Introduction to the Simplex Algorithm (2005) (0)
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 8: Ellipsoid Algorithm (2005) (0)
Sublinear geometrie algorithms (2003) (0)
Approximating the Weight of the Eu lidean Minimum Spanning Tree inSublinear (2008) (0)

This paper list is powered by the following services:

Other Resources About Avner Magen

en.wikipedia.org

What Schools Are Affiliated With Avner Magen?

Avner Magen is affiliated with the following schools: