default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvner Magen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j15]Per Austrin, Siavosh Benabbas, Avner Magen:
On Quadratic Threshold CSPs. Discret. Math. Theor. Comput. Sci. 14(2): 205-228 (2012)- [j14]Siavosh Benabbas, Konstantinos Georgiou, Avner Magen, Madhur Tulsiani:
SDP Gaps from Pairwise Independence. Theory Comput. 8(1): 269-289 (2012) - 2011
- [j13]Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo
, Avner Magen, Toniann Pitassi:
Toward a Model for Backtracking and Dynamic Programming. Comput. Complex. 20(4): 679-740 (2011) - [j12]Allan Borodin, David Cashman, Avner Magen:
How well can primal-dual and local-ratio algorithms perform? ACM Trans. Algorithms 7(3): 29:1-29:26 (2011) - [c27]Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, Avner Magen:
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy. FSTTCS 2011: 41-54 - [c26]Avner Magen, Anastasios Zouzias:
Low Rank Matrix-valued Chernoff Bounds and Approximate Matrix Multiplication. SODA 2011: 1422-1436 - 2010
- [j11]Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis:
Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver Hierarchy. SIAM J. Comput. 39(8): 3553-3570 (2010) - [c25]Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias:
Online Embeddings. APPROX-RANDOM 2010: 246-259 - [c24]Siavosh Benabbas, Avner Magen:
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain. IPCO 2010: 299-312 - [c23]Per Austrin, Siavosh Benabbas, Avner Magen:
On Quadratic Threshold CSPs. LATIN 2010: 332-343 - [i7]Avner Magen, Anastasios Zouzias:
Low Rank Matrix-Valued Chernoff Bounds and Applications. CoRR abs/1005.2724 (2010) - [i6]Siavosh Benabbas, Konstantinos Georgiou, Avner Magen:
The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c22]Konstantinos Georgiou, Avner Magen, Madhur Tulsiani:
Optimal Sherali-Adams Gaps from Pairwise Independence. APPROX-RANDOM 2009: 125-139 - [c21]Avner Magen, Mohammad Moharrami:
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy. APPROX-RANDOM 2009: 258-271 - [c20]Konstantinos Georgiou, Avner Magen, Iannis Tourlakis:
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. FSTTCS 2009: 203-214 - [i5]Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen:
Toward a Model for Backtracking and Dynamic Programming. Electron. Colloquium Comput. Complex. TR09 (2009) - [i4]Konstantinos Georgiou, Avner Magen, Madhur Tulsiani:
Optimal Sherali-Adams Gaps from Pairwise Independence. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j10]Bernard Chazelle, Ding Liu, Avner Magen:
Approximate range searching in higher dimension. Comput. Geom. 39(1): 24-29 (2008) - [j9]Hamed Hatami, Avner Magen, Evangelos Markakis:
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics. SIAM J. Discret. Math. 23(1): 178-194 (2008) - [j8]Eitan Bachmat, Tao-Kai Lam, Avner Magen:
Analysis of set-up time models: A metric perspective. Theor. Comput. Sci. 401(1-3): 172-180 (2008) - [c19]Avner Magen, Anastasios Zouzias:
Near Optimal Dimensionality Reductions That Preserve Volumes. APPROX-RANDOM 2008: 523-534 - [c18]Mohammad Moharrami, Avner Magen:
On the nonexistence of dimension reduction for ℓ22 metrics. CCCG 2008 - [c17]Konstantinos Georgiou, Avner Magen, Iannis Tourlakis:
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities. IPCO 2008: 140-153 - 2007
- [j7]Avner Magen:
Dimensionality Reductions in l2 that Preserve Volumes and Distance to Affine Spaces. Discret. Comput. Geom. 38(1): 139-153 (2007) - [c16]Hamed Hatami, Avner Magen, Evangelos Markakis:
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics. APPROX-RANDOM 2007: 164-179 - [c15]Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis:
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. FOCS 2007: 702-712 - 2006
- [j6]Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory Comput. 2(4): 65-90 (2006) - [c14]Shlomo Hoory, Avner Magen, Toniann Pitassi:
Monotone Circuits for the Majority Function. APPROX-RANDOM 2006: 410-425 - [c13]Eitan Bachmat, Tao-Kai Lam, Avner Magen:
A Rigorous Analysis for Set-Up Time Models - A Metric Perspective. COCOON 2006: 387-397 - [i3]Hamed Hatami, Avner Magen, Vangelis Markakis:
Integrality gaps of semidefinite programs for Vertex Cover and relations to ℓ1 embeddability of Negative Type metrics. CoRR abs/cs/0601011 (2006) - [i2]Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis:
Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j5]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. SIAM J. Comput. 35(1): 91-109 (2005) - [j4]Bernard Chazelle, Ding Liu, Avner Magen:
Sublinear Geometric Algorithms. SIAM J. Comput. 35(3): 627-646 (2005) - [j3]Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff:
Simple permutations mix well. Theor. Comput. Sci. 348(2-3): 251-261 (2005) - [c12]Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi:
Toward a Model for Backtracking and Dynamic Programming. CCC 2005: 308-322 - [c11]Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas:
On-Line Algorithms for Market Equilibria. COCOON 2005: 596-607 - [c10]Allan Borodin, David Cashman, Avner Magen:
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?. ICALP 2005: 943-955 - [i1]Bernard Chazelle, Ding Liu, Avner Magen:
Sublinear Geometric Algorithms. Sublinear Algorithms 2005 - 2004
- [j2]Robert Krauthgamer, Nathan Linial, Avner Magen:
Metric Embeddings--Beyond One-Dimensional Distortion. Discret. Comput. Geom. 31(3): 339-356 (2004) - [c9]Ding Liu, Bernard Chazelle, Avner Magen:
Approximate range searching in higher dimension. CCCG 2004: 154-157 - [c8]Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff:
Simple Permutations Mix Well. ICALP 2004: 770-781 - 2003
- [c7]Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS 2003: 318-327 - [c6]Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler:
Sublinear-time approximation of Euclidean minimum spanning tree. SODA 2003: 813-822 - [c5]Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami:
A sublinear algorithm for weakly approximating edit distance. STOC 2003: 316-324 - [c4]Bernard Chazelle, Ding Liu, Avner Magen:
Sublinear geometric algorithms. STOC 2003: 531-540 - 2002
- [c3]Avner Magen:
Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications. RANDOM 2002: 239-253 - [c2]Nathan Linial, Avner Magen, Assaf Naor:
Girth and euclidean distortion. STOC 2002: 705-711 - 2001
- [b1]Avner Magen:
On the Euclidicity of metric spaces. Hebrew University of Jerusalem, Israel, 2001 - 2000
- [j1]Nathan Linial, Avner Magen:
Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders. J. Comb. Theory B 79(2): 157-171 (2000)
1990 – 1999
- 1998
- [c1]Nathan Linial, Avner Magen, Michael E. Saks:
Trees and Euclidean Metrics. STOC 1998: 169-175
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
