#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1997

2018

- This year (1)
- Last 5 years (7)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ehud Friedgut
- 1998

Consider G(n, p) to be the probability space of random graphs on n vertices with edge probability p. We will be considering subsets of this space defined by monotone graph properties. A monotoneâ€¦ (More)

- Ehud Friedgut
- Combinatorica
- 1998

Consider a function f : f0;1g n ! f0;1g. The sensitivity of a point v 2 f0;1g n is jfv 0 : f (v 0) 6 = f (v); dist(v; v 0) = 1gj, i.e. the number of neighbors of the point in the discrete cube onâ€¦ (More)

- Ehud Friedgut
- Combinatorica
- 2008

Spectral graph theory studies the connections between the properties of a graph G and the eigenvalues and eigenvectors of its adjacency matrix A(G). The matrix A(G) is symmetric and thus has realâ€¦ (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â€¦ (More)

A set of permutations I âŠ‚ Sn is said to be k-intersecting if any two permutations in I agree on at least k points. We show that for any k âˆˆ N, if n is sufficiently large depending on k, then theâ€¦ (More)

- Noga Alon, Ehud Friedgut
- J. Comb. Theory, Ser. A
- 2000

Let Ïƒ âˆˆ Sk and Ï„ âˆˆ Sn be permutations. We say Ï„ contains Ïƒ if there exist 1 â‰¤ x1 < x2 < . . . < xk â‰¤ n such that Ï„(xi) < Ï„(xj) if and only if Ïƒ(i) < Ïƒ(j). If Ï„ does not contain Ïƒ we say Ï„ avoids Ïƒ.â€¦ (More)

- Irit Dinur, Ehud Friedgut
- Combinatorics, Probability & Computing
- 2009

A family J of subsets of {1, . . . , n} is called a j-junta if there exists J âŠ† {1, . . . , n}, with |J | = j, such that the membership of a set S in J depends only on S âˆ© J . In this paper weâ€¦ (More)

- Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi
- ATVA
- 2004

The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problemsâ€¦ (More)

- Ehud Friedgut, Gil Kalai, Noam Nisan
- 2008 49th Annual IEEE Symposium on Foundations ofâ€¦
- 2008

The Gibbard-Satterthwaite theorem states that every non-trivial voting method among at least 3 alternatives can be strategically manipulated. We prove a quantitative version of theâ€¦ (More)

- Ehud Friedgut
- Random Struct. Algorithms
- 2005