#### Filter Results:

- Full text PDF available (295)

#### Publication Year

1974

2018

- This year (13)
- Last 5 years (95)
- Last 10 years (170)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
- J. Comput. Syst. Sci.
- 2000

We define and study the notion of min-wise independent families of permutations. We say that F âŠ† Sn is min-wise independent if for any set X âŠ† [n] and any x âˆˆ X, when Ï€ is chosen at random in F weâ€¦ (More)

- Alan M. Frieze, Ravi Kannan
- Combinatorica
- 1999

- Alan M. Frieze, Ravi Kannan, Santosh Vempala
- FOCS
- 1998

We consider the problem of approximating a given <i>m</i> Ã— <i>n</i> matrix <b>A</b> by another matrix of specified rank <i>k</i>, which is smaller than <i>m</i> and <i>n</i>. The Singular Valueâ€¦ (More)

- References, Milind Dawande, +12 authors A H G Rinnooy Kan
- 1993

item in the big bin and obtains a profit of 1 while OPT = 2. This also shows that ordering bins in non-increasing capacities does not help improve the performance of Greedy. 5 Conclusions Anâ€¦ (More)

- Martin E. Dyer, Alan M. Frieze, Ravi Kannan
- STOC
- 1989

We present a randomised polynomial time algorithm for approximating the volume of a convex body <italic>K</italic> in <italic>n</italic>-dimensional Euclidean space. The proof of correctness of theâ€¦ (More)

- Alan M. Frieze, Stephen Suen
- J. Algorithms
- 1996

We consider the performance of two algorithms, GUC and SC studied by Chao and Franco 2], 3], and Chvv atal and Reed 4], when applied to a random instance ! of a boolean formula in conjunctive normalâ€¦ (More)

- Alan M. Frieze, Giulia Galbiati, Francesco Maffioli
- Networks
- 1982

The traveling salesman problem has the following simple description: given a complete digraph on n nodes with an n X n matrix Ild(i,j)ll> 0 giving the lengths of arcs ( i , j ) find a minimum lengthâ€¦ (More)

- Alan M. Frieze
- Discrete Applied Mathematics
- 1985

Suppose we are given a complete graph on n vertices in which the lengths o f the edges are independent identically distributed non-negative random variables. Suppose that their common distributionâ€¦ (More)

- Sanjeev Arora, Alan M. Frieze, Haim Kaplan
- FOCS
- 1996

We present approximation schemes for \dense" instances of many well-known NP-hard problems, including 0-1 quadratic-assignment, (an optimization formulation of) graphisomorphism,â€¦ (More)

We define and study the notion of min-wise independent families of permutations. We say that F âŠ† Sn is min-wise independent if for any set X âŠ† [n] and any x âˆˆ X , when Ï€ is chosen at random in F weâ€¦ (More)