#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1998

2012

- This year (0)
- Last 5 years (0)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen
- computational complexity
- 2005

We propose a model called priority branching trees (pBT) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson and Rackoff, as well asâ€¦ (More)

- Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
- Theory of Computing
- 2006

We present a new method for proving rank lower bounds for Cutting Planes (CP) and several procedures based on lifting due to LovÃ¡sz and Schrijver (LS), when viewed as proof systems forâ€¦ (More)

- Avner Magen
- RANDOM
- 2002

Let X be a subset of n points of the Euclidean space, and let 0 < Îµ < 1. A classical result of Johnson and Lindenstrauss [JL84] states that there is a projection ofX onto a subspace of dimensionâ€¦ (More)

- Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis
- 48th Annual IEEE Symposium on Foundations ofâ€¦
- 2007

Linear and semidefinite programming are highly successful approaches for obtaining good approximations for NP-hard optimization problems. For example, breakthrough approximation algorithms for Maxâ€¦ (More)

- Siavosh Benabbas, Konstantinos Georgiou, Avner Magen, Madhur Tulsiani
- Theory of Computing
- 2012

This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P contains the support of aâ€¦ (More)

- Tugkan Batu, Funda ErgÃ¼n, +4 authors Rahul Sami
- STOC
- 2003

We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and B, runs in timeâ€¦ (More)

- Avner Magen, Anastasios Zouzias
- SODA
- 2011

In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let <i>A</i> âˆˆ R<sup><i>n</i>x<i>m</i></sup> and <i>B</i> âˆˆâ€¦ (More)

- Allan Borodin, David Cashman, Avner Magen
- ICALP
- 2005

- Ding Liu, Bernard Chazelle, Avner Magen
- CCCG
- 2004

Applying standard dimensionality reduction techniques, we show how to perform approximate range searching in higher dimension while avoiding the curse of dimensionality. Given n points in a unit ballâ€¦ (More)

- Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
- ICALP
- 2004

We study the random composition of a small family of O(n) simple permutations on {0, 1}n. Specifically we ask what is the number of compositions needed to achieve a permutation that is close toâ€¦ (More)