 | 2008 |
|---|
| 47 |       | Anders Johansson,
Jeff Kahn,
Van H. Vu:
Factors in random graphs.
Random Struct. Algorithms 33(1): 1-28 (2008) |
| 2007 |
|---|
| 46 | | Jeff Kahn,
G. I. L. Kalai:
Thresholds and Expectation Thresholds.
Combinatorics, Probability & Computing 16(3): 495-502 (2007) |
| 2006 |
|---|
| 45 | | Jacob van den Berg,
Olle Häggström,
Jeff Kahn:
Some conditional correlation inequalities for percolation and related processes.
Random Struct. Algorithms 29(4): 417-435 (2006) |
| 2004 |
|---|
| 44 |  | David Galvin,
Jeff Kahn:
On Phase Transition in the Hard-Core Model on Math.
Combinatorics, Probability & Computing 13(2): 137-164 (2004) |
| 2002 |
|---|
| 43 | | Ehud Friedgut,
Jeff Kahn,
Avi Wigderson:
Computing Graph Properties by Randomized Subcube Partitions.
RANDOM 2002: 105-113 |
| 2001 |
|---|
| 42 | | Jeff Kahn,
János Komlós:
Singularity Probabilities For Random Matrices Over Finite Fields.
Combinatorics, Probability & Computing 10(2): (2001) |
| 2000 |
|---|
| 41 | | Jeff Kahn,
Jeong Han Kim,
László Lovász,
Van H. Vu:
The Cover Time, the Blanket Time, and the Matthews Bound.
FOCS 2000: 467-475 |
| 40 | | Jeff Kahn,
Michael E. Saks,
Clifford D. Smyth:
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture.
IEEE Conference on Computational Complexity 2000: 98-103 |
| 39 | | Jeff Kahn:
A Normal Law for Matchings.
Combinatorica 20(3): 339-391 (2000) |
| 38 | | Jeff Kahn:
Asymptotics of the list-chromatic index for multigraphs.
Random Struct. Algorithms 17(2): 117-156 (2000) |
| 1999 |
|---|
| 37 | | Jeff Kahn,
Alexander Lawrenz:
Generalized Rank Functions and an Entropy Argument.
J. Comb. Theory, Ser. A 87(2): 398-403 (1999) |
| 1998 |
|---|
| 36 | | Jeff Kahn,
Yang Yu:
Log-Concave Functions And Poset Probabilities.
Combinatorica 18(1): 85-99 (1998) |
| 35 | | Jeff Kahn,
Jeong Han Kim:
Random Matchings in Regular Graphs.
Combinatorica 18(2): 201-226 (1998) |
| 1997 |
|---|
| 34 | | Jeff Kahn,
P. Mark Kayll:
On the Stochastic Independence Properties of Hard-Core Distributions.
Combinatorica 17(3): 369-391 (1997) |
| 33 | | Jeff Kahn,
P. Mark Kayll:
Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size.
J. Comb. Theory, Ser. A 78(2): 199-235 (1997) |
| 1996 |
|---|
| 32 | | Jeff Kahn,
Nathan Linial,
Alex Samorodnitsky:
Inclusion-Exclusion: Exact and Approximate.
Combinatorica 16(4): 465-477 (1996) |
| 31 | | Jeff Kahn:
Asymptotically Good List-Colorings.
J. Comb. Theory, Ser. A 73(1): 1-59 (1996) |
| 30 | | Jeff Kahn:
Asymptotics of the Chromatic Index for Multigraphs.
J. Comb. Theory, Ser. B 68(2): 233-254 (1996) |
| 29 | | Jeff Kahn:
A linear programming perspective on the Frankl - Rödl - Pippenger theorem.
Random Struct. Algorithms 8(2): 149-157 (1996) |
| 1995 |
|---|
| 28 | | Jeff Kahn,
Jeong Han Kim:
Entropy and Sorting.
J. Comput. Syst. Sci. 51(3): 390-399 (1995) |
| 1994 |
|---|
| 27 | | Jeff Kahn,
Gil Kalai:
A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs.
J. Comb. Theory, Ser. A 68(2): 317-339 (1994) |
| 1993 |
|---|
| 26 | | Zoltán Füredi,
Jeff Kahn,
Paul D. Seymour:
On the fractional matching polytope of a hypergraph.
Combinatorica 13(2): 167-180 (1993) |
| 1992 |
|---|
| 25 | | Jeff Kahn,
Jeong Han Kim:
Entropy and Sorting
STOC 1992: 178-187 |
| 24 | | Jeff Kahn,
Paul D. Seymour:
A fractional version of the Erdös-Faber-Lovász conjecture.
Combinatorica 12(2): 155-160 (1992) |
| 23 | | Jeff Kahn:
On a problem of Erdös and Lovász: random lines in a projective plane.
Combinatorica 12(4): 417-423 (1992) |
| 22 | | Jeff Kahn:
Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors.
J. Comb. Theory, Ser. A 59(1): 31-39 (1992) |
| 1991 |
|---|
| 21 | | Jeff Kahn,
Roy Meshulam:
On mod p transversals.
Combinatorica 11(1): 17-22 (1991) |
| 20 | | Jeff Kahn,
Nathan Linial:
Balancing extensions via Brunn-Minkowski.
Combinatorica 11(4): 363-368 (1991) |
| 1990 |
|---|
| 19 | | Zoltán Füredi,
Jeff Kahn,
Daniel J. Kleitman:
Sphere coverings of the hypercube with incomparable centers.
Discrete Mathematics 83(1): 129-134 (1990) |
| 1989 |
|---|
| 18 | | Joel Friedman,
Jeff Kahn,
Endre Szemerédi:
On the Second Eigenvalue in Random Regular Graphs
STOC 1989: 587-598 |
| 17 | | Endre Boros,
Zoltán Füredi,
Jeff Kahn:
Maximal intersecting families and affine regular polygons in PG(2, q).
J. Comb. Theory, Ser. A 52(1): 1-9 (1989) |
| 16 | | Jeff Kahn,
J. C. Lagarias,
Hans S. Witsenhausen:
Single-Suit Two-Person Card Play III. The Misère Game.
SIAM J. Discrete Math. 2(3): 329-343 (1989) |
| 1988 |
|---|
| 15 | | Jeff Kahn,
Gil Kalai,
Nathan Linial:
The Influence of Variables on Boolean Functions (Extended Abstract)
FOCS 1988: 68-80 |
| 1987 |
|---|
| 14 | | Jeff Kahn:
On Lattices with Möbius Function ±1, 0.
Discrete & Computational Geometry 2: 1-8 (1987) |
| 13 | | Jeff Kahn,
Michael E. Saks:
On the widths of finite distributive lattices.
Discrete Mathematics 63(2-3): 183-195 (1987) |
| 1986 |
|---|
| 12 | | Andrzej Ehrenfeucht,
Jeff Kahn,
Roger D. Maddux,
Jan Mycielski:
Addendum to the paper "On the dependence of functions on their variables".
J. Comb. Theory, Ser. A 42(2): 317 (1986) |
| 1985 |
|---|
| 11 | | Jeff Kahn:
A problem of P. Seymour on nonbinary matroids.
Combinatorica 5(4): 319-323 (1985) |
| 1984 |
|---|
| 10 | | Jeff Kahn,
Michael E. Saks:
Every Poset Has a Good Comparison
STOC 1984: 299-301 |
| 9 | | Jeff Kahn,
Michael E. Saks:
A polyomino with no stochastic function.
Combinatorica 4(2): 181-182 (1984) |
| 8 | | Jeff Kahn,
Michael E. Saks,
Dean Sturtevant:
A topological approach to evasiveness.
Combinatorica 4(4): 297-306 (1984) |
| 7 | | Jeff Kahn:
A Geometric Approach to Forbidden Minors for GF(3).
J. Comb. Theory, Ser. A 37(1): 1-12 (1984) |
| 6 | | Jeff Kahn:
A family of perfect graphs associated with directed graphs.
J. Comb. Theory, Ser. B 37(3): 279-282 (1984) |
| 1983 |
|---|
| 5 | | Jeff Kahn,
Michael E. Saks,
Dean Sturtevant:
A Topological Approach to Evasiveness
FOCS 1983: 31-33 |
| 1982 |
|---|
| 4 | | Andrzej Ehrenfeucht,
Jeff Kahn,
Roger D. Maddux,
Jan Mycielski:
On the Dependence of Functions on Their Variables.
J. Comb. Theory, Ser. A 33(1): 106-108 (1982) |
| 1981 |
|---|
| 3 | | Jeff Kahn,
Daniel J. Kleitman:
On cross-bandwidth.
Discrete Mathematics 33(3): 323-325 (1981) |
| 1980 |
|---|
| 2 | | Ram Prakash Gupta,
Jeff Kahn,
Neil Robertson:
On the maximum number of diagonals of a circuit in a graph.
Discrete Mathematics 32(1): 37-43 (1980) |
| 1 | | Jeff Kahn:
Inversive Planes Satisfying the Bundle Theorem.
J. Comb. Theory, Ser. A 29(1): 1-19 (1980) |
