#### Filter Results:

- Full text PDF available (84)

#### Publication Year

1996

2017

- This year (4)
- Last 5 years (27)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Dimitris Achlioptas
- PODS
- 2001

A classic result of Johnson and Lindenstrauss asserts that any set of <i>n</i> points in <i>d</i>-dimensional Euclidean space can be embedded into <i>k</i>-dimensional Euclidean space where <i>k</i> is logarithmic in <i>n</i> and independent of <i>d</i> so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions… (More)

- Dimitris Achlioptas
- J. Comput. Syst. Sci.
- 2003

A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space—where k is logarithmic in n and independent of d—so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the… (More)

- Dimitris Achlioptas, Frank McSherry
- COLT
- 2005

We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixture-sample, let μi, Ci, wi denote the empirical mean, covariance matrix, and mixing weight of the i-th component. We prove that a very simple algorithm, namely spectral projection… (More)

Call a disjunction of k Boolean variables a k-clause. For a set V of n Boolean variables, let Ck(V ) denote the set of all 2n possible k-clauses on V . A random k-CNF formula Fk(n,m) is formed by selecting uniformly, independently and with replacement m clauses from Ck and taking their conjunction. The study of such random k-CNF formulas has attracted… (More)

- Dimitris Achlioptas, Assaf Naor
- STOC
- 2004

For every d > 0, let k<inf>d</inf> be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n,d/n) is either k<inf>d</inf> or k<inf>d+1</inf> almost surely. If d ∈ (2k log k - log k, 2k log k) we further prove that the chromatic number almost surely equals k+1.

- Dimitris Achlioptas
- Theor. Comput. Sci.
- 2001

It is widely believed that the probability of satis"ability for random k-SAT formulae exhibits a sharp threshold as a function of their clauses-to-variables ratio. For the most studied case, k = 3, there have been a number of results during the last decade providing upper and lower bounds for the threshold’s potential location. All lower bounds in this vein… (More)

In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intriguingly, experimental results with various models for generating random CSP instances suggest that the probability of such problems having a solution exhibits a “threshold–like”… (More)

- Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore
- J. ACM
- 2005

Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaining this graph structure can be a surprisingly difficult task, as edges cannot be explicitly queried. For instance, empirical studies of the network of Internet Protocol (IP)… (More)

- Dimitris Achlioptas, Amin Coja-Oghlan
- 2008 49th Annual IEEE Symposium on Foundations of…
- 2008

For many random constraint satisfaction problems, by now there exist asymptotically tight estimates of the largest constraint density for which solutions exist. At the same time, for many of these problems, all known polynomial-time algorithms stop finding solutions at much smaller densities. For example, it is well-known that it is easy to color a random… (More)

- Dimitris Achlioptas, Ehud Friedgut
- Random Struct. Algorithms
- 1999

Let f k (n; p) denote the probability that the random graph G(n; p) is k-colorable. We show that for every k 3, there exists d k (n) such that for any > 0, lim n!1 f k (n; d k (n) ? n) = 1 and lim n!1 f k (n; d k (n) + n) = 0 : As a result we conclude that for any given value of n the the chromatic number of G(n; d=n) is concentrated in one value for all… (More)