The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel J. Kleitman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. G. Burosch, János Demetrovics, Gyula O. H. Katona, Daniel J. Kleitman, Alexander A. Sapozhenko
    On the Number of Databases and Closure Operations. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:78, n:2, pp:377-381 [Journal]
  2. Larry Finkelstein, Daniel J. Kleitman, Frank Thomson Leighton
    Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:247-256 [Conf]
  3. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:351-356 [Conf]
  4. Noga Alon, Daniel J. Kleitman
    Piercing Convex Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:157-160 [Conf]
  5. Daniel J. Kleitman, Michael M. Krieger
    An Optimal Bound for Two Dimensional Bin Packing [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:163-168 [Conf]
  6. Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma
    On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:332-346 [Conf]
  7. Lior Pachter, Serafim Batzoglou, Valentin I. Spitkovsky, William S. Beebee, Eric S. Lander, Bonnie Berger, Daniel J. Kleitman
    A dictionary based approach for gene annotation. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:285-294 [Conf]
  8. Deborah S. Franzblau, Daniel J. Kleitman
    An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:167-174 [Conf]
  9. Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
    New Layouts for the Shuffle-Exchange Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:278-292 [Conf]
  10. Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
    Coping with Errors in Binary Search Procedures (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:227-232 [Conf]
  11. Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour
    The smallets n-uniform hypergraph with positive discrepancy. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:2, pp:151-160 [Journal]
  12. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:127-134 [Journal]
  13. Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
    Sharpening the LYM inequality. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:287-293 [Journal]
  14. Zoltán Füredi, Daniel J. Kleitman
    The Prison Yard Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:3, pp:287-300 [Journal]
  15. Ron Holzman, Daniel J. Kleitman
    Sign vectors and unit vectors. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:303-316 [Journal]
  16. Daniel J. Kleitman, András Gyárfás, Géza Tóth
    Convex Sets in the Plane with Three of Every Four Meeting. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:221-232 [Journal]
  17. Daniel J. Kleitman, James B. Shearer, Dean Sturtevant
    Intersections of k-element sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:381-384 [Journal]
  18. Daniel J. Kleitman, Kenneth J. Winston
    Forests and score vectors. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:1, pp:49-54 [Journal]
  19. Tom Bohman, Ron Holzman, Daniel J. Kleitman
    Six Lonely Runners. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  20. Noga Alon, Daniel J. Kleitman
    A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  21. Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman
    Point Selections and Weak e-Nets for Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:189-200 [Journal]
  22. Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman
    On the Maximum Number of Triangles in Wheel-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:63-75 [Journal]
  23. Ding-Zhu Du, Daniel J. Kleitman
    Diameter and Radius in the Manhattan Metric. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:351-356 [Journal]
  24. Noga Alon, Daniel J. Kleitman
    Covering a Square by Small Perimeter Rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:1-7 [Journal]
  25. Daniel J. Kleitman, Rom Pinchasi
    A Note on Caterpillar-Embeddings with No Two Parallel Edges. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:223-229 [Journal]
  26. Daniel J. Kleitman, Lior Pachter
    Finding Convex Sets Among Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:405-410 [Journal]
  27. Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman
    On partitions of discrete boxes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:255-258 [Journal]
  28. Paul Erdös, Daniel J. Kleitman
    Extremal problems among subsets of a set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:923-931 [Journal]
  29. Wayne Goddard, Meir Katchalski, Daniel J. Kleitman
    Forcing Disjoint Segments in the Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:4, pp:391-395 [Journal]
  30. Daniel J. Kleitman, Leonard J. Schulman
    Minimally Distant Sets of Lattice Points. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:3, pp:231-240 [Journal]
  31. Deborah S. Franzblau, Daniel J. Kleitman
    An Algorithm for Covering Polygons with Rectangles [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:63, n:3, pp:164-189 [Journal]
  32. Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman
    A Generalized Model for Understanding Evasiveness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:4, pp:205-208 [Journal]
  33. S. F. Assmann, David S. Johnson, Daniel J. Kleitman, Joseph Y.-T. Leung
    On a Dual Version of the One-Dimensional Bin Packing Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:502-525 [Journal]
  34. Lior Pachter, Serafim Batzoglou, Valentin I. Spitkovsky, E. Banks, Eric S. Lander, Daniel J. Kleitman, Bonnie Berger
    A Dictionary-Based Approach for Gene Annotation. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:3/4, pp:- [Journal]
  35. Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
    An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:3, pp:339-361 [Journal]
  36. Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma
    On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:3, pp:385-401 [Journal]
  37. Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
    Coping with Errors in Binary Search Procedures. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:3, pp:396-404 [Journal]
  38. Noga Alon, Kenneth A. Berman, Daniel J. Kleitman
    On a Problem in Shuffling. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:5-14 [Journal]
  39. S. Chaiken, Daniel J. Kleitman
    Matrix Tree Theorems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:24, n:3, pp:377-381 [Journal]
  40. Jacob Fox, Daniel J. Kleitman
    On Rado's Boundedness Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:84-100 [Journal]
  41. Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman
    Representations of families of triples over GF(2). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:53, n:2, pp:306-315 [Journal]
  42. Curtis Greene, Daniel J. Kleitman
    The Structure of Sperner k-Families. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:20, n:1, pp:41-68 [Journal]
  43. Curtis Greene, Daniel J. Kleitman
    Strong Versions of Sperner's Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:20, n:1, pp:80-88 [Journal]
  44. Daniel J. Kleitman
    Some New Results on the Littlewood-Offord Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:20, n:1, pp:89-113 [Journal]
  45. Daniel J. Kleitman
    Extremal Properties of Collections of Subsets Containing No Two Sets and Their Union. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:20, n:3, pp:390-392 [Journal]
  46. Daniel J. Kleitman, D. J. Kwiatkowski
    A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:2, pp:129-136 [Journal]
  47. Daniel J. Kleitman, T. L. Magnanti
    On the Number of Latent Subsets of Intersecting Collections. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:16, n:2, pp:215-220 [Journal]
  48. Kenneth J. Winston, Daniel J. Kleitman
    On the Asymptotic Number of Tournament Score Sequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:35, n:2, pp:208-230 [Journal]
  49. Daniel J. Kleitman, D. J. Kwiatkowski
    Further results on the Aanderaa-Rosenberg conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:1, pp:85-95 [Journal]
  50. Daniel J. Kleitman
    A note on the parity of the number of crossings of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:1, pp:88-89 [Journal]
  51. Daniel J. Kleitman
    A Note on Perfect Elimination Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1974, v:3, n:4, pp:280-282 [Journal]
  52. Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman
    Even Cycles in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:474-483 [Journal]
  53. Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman
    Pair Labeelings with Given Distance. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:4, pp:491-499 [Journal]
  54. Maria M. Klawe, Daniel J. Kleitman
    An Almost Linear Time Algorithm for Generalized Matrix Searching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:81-97 [Journal]
  55. Daniel J. Kleitman
    Divisors Without Unit-Congruent Ratios. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:344-349 [Journal]
  56. Daniel J. Kleitman, Rakesh Vohra
    Computing the Bandwidth of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:373-375 [Journal]
  57. Daniel J. Kleitman, Douglas B. West
    Spanning Trees with Many Leaves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:99-106 [Journal]
  58. Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman
    Inherent Complexity Trade-Offs for Range Query Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:279-290 [Journal]
  59. Steve Fisk, Daniel Abbw-Jackson, Daniel J. Kleitman
    Helly-type theorems about sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:1, pp:19-25 [Journal]
  60. Jeff Kahn, Daniel J. Kleitman
    On cross-bandwidth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:3, pp:323-325 [Journal]
  61. Daniel J. Kleitman, Kenneth J. Winston
    On the number of graphs without 4-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:2, pp:167-172 [Journal]
  62. Daniel J. Kleitman
    On a problem of Yuzvinsky on separating the n-cube. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:207-213 [Journal]
  63. Jichang Sha, Daniel J. Kleitman
    The number of linear extensions of subset ordering. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:271-278 [Journal]
  64. Daniel J. Kleitman, Michael R. Fellows
    Radius and diameter in Manhattan lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:119-125 [Journal]
  65. 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]
  66. Martin Aigner, Dwight Duffus, Daniel J. Kleitman
    Partitioning a power set into union-free classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:113-119 [Journal]
  67. Noga Alon, Daniel J. Kleitman
    Partitioning a rectangle into small perimeter rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:2, pp:111-119 [Journal]
  68. Alexander Felzenbaum, Ron Holzman, Daniel J. Kleitman
    Packing lines in a hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:117, n:1-3, pp:107-112 [Journal]
  69. Wayne Goddard, Daniel J. Kleitman
    An upper bound for the Ramsey numbers r(K3, G). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:177-182 [Journal]
  70. Jerrold R. Griggs, Daniel J. Kleitman
    Independence and the Havel-Hakimi residue. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:209-212 [Journal]

Search in 0.036secs, Finished in 0.039secs
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