Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kahn, Jeff"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hamiltonian cycles in Dirac graphs
Bill Cuckler
,
Jeff Kahn
Combinatorica
29
(3), 2009, pp. 299-326
Entropy bounds for perfect matchings and Hamiltonian cycles
Bill Cuckler
,
Jeff Kahn
Combinatorica
29
(3), 2009, pp. 327-335
A dual version of Reimer's inequality and a proof of Rudich's conjecture
Jeff Kahn
,
Michael Saks
,
Cliff Smyth
Proceedings of the 15th Annual IEEE Conference on Computational Complexity (Florence, Italy, July 4-7, 2000)
, 2000, pp. 98-103
A normal law for matchings
Jeff Kahn
Combinatorica
20
(3), 2000, pp. 339-391
Random matchings in reagular graphs
Jeff Kahn
,
Jeong Han Kim
Combinatorica
18
(2), 1998, pp. 201-226
Log-concave functions and poset probabilities
Jeff Kahn
,
Yang Yu
Combinatorica
18
(1), 1998, pp. 85-99
On the stochastic independence properties of hard-core distributions
Jeff Kahn
,
P. Mark Kayll
Combinatorica
17
(3), 1997, pp. 369-391
Fractional v. integral covers in hypergraphs of bounded edge size
Jeff Kahn
,
P. Mark Kayll
Journal of Combinatorial Theory Series A
78
(2), 1997, pp. 199-235
Inclusion-exclusion: Exact and approximate
Jeff Kahn
,
Nathan Linial
,
Alex Samorodnitsky
Combinatorica
16
(4), 1996, pp. 465-477
Asymptotically good list-colorings
Jeff Kahn
Journal of Combinatorial Theory Series A
73
(1), 1996, pp. 1-59
Asymptotics of the chromatic index for multigraphs
Jeff Kahn
Journal of Combinatorial Theory Series B
68
(2), 1996, pp. 233-254
Entropy and sorting
Jeff Kahn
,
Jeong Han Kim
Journal of Computer and System Sciences
51
(3), 1995, pp. 390-399
A problem of Füredi and Seymour on covering intersecting families by pairs
Jeff Kahn
,
Gil Kalai
Journal of Combinatorial Theory Series A
68
(2), 1994, pp. 317-339
Entropy and sorting
Jeff Kahn
,
Jeong Han Kim
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 178-187
A fractional version of the Erdŏs-Faber-Lovász conjecture
Jeff Kahn
,
P.D. Seymour
Combinatorica
12
, 1992, pp. 155-160
Coloring nearly-disjoint hypergraphs with
n+o(n)
colors
Jeff Kahn
Journal of Combinatorial Theory Series A
59
, 1992, pp. 31-39
On a problem of Erdŏs and Lovász: random lines in a projective plane
Jeff Kahn
Combinatorica
12
(4), 1992, pp. 417-423
Balancing extensions via Brunn-Minkowski
Jeff Kahn
,
Nathan Linial
Combinatorica
11
, 1991, pp. 363-368
On
\bmod p
transversals
Jeff Kahn
,
Roy Meshulam
Combinatorica
11
, 1991, pp. 17-22
Maximal intersecting families and affine regular polygons in
PG(2,q)
Endre Boros
,
Zoltán Füredi
,
Jeff Kahn
Journal of Combinatorial Theory Series A
52
, 1989, pp. 1-9
On the second eigenvalue of random regular graphs
Joel Friedman
,
Jeff Kahn
,
Endre Szemerédi
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 587-598
A problem of P. Seymour on nonbinary matroids
Jeff Kahn
Combinatorica
5
, 1985, pp. 319-323
A topological approach to evasiveness
Jeff Kahn
,
Michael Saks
,
Dean Sturtevant
Combinatorica
4
, 1984, pp. 297-306
A polyomino with no stochastic function
Jeffry Kahn
,
Michael Saks
Combinatorica
4
, 1984, pp. 181-182
A geometric approach to forbidden minors for
GF(3)
Jeff Kahn
Journal of Combinatorial Theory Series A
37
, 1984, pp. 1-12
Seiten 1
2
>