The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jeff Kahn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  46. Entropy bounds for perfect matchings and Hamiltonian cycles. [Citation Graph (, )][DBLP]


  47. Hamiltonian cycles in Dirac graphs. [Citation Graph (, )][DBLP]


  48. Thresholds and Expectation Thresholds. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002