| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jacob Fox, Daniel J. Kleitman |
On Rado's Boundedness Conjecture.  |
J. Comb. Theory, Ser. A  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Daniel J. Kleitman |
Extremal problems among subsets of a set. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Rom Pinchasi |
A Note on Caterpillar-Embeddings with No Two Parallel Edges. |
Discrete & Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman |
On partitions of discrete boxes. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Ron Holzman, Daniel J. Kleitman |
Six Lonely Runners. |
Electr. J. Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Daniel J. Kleitman, András Gyárfás, Géza Tóth |
Convex Sets in the Plane with Three of Every Four Meeting. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 52A35 |
| 1 | Noga Alon, Kenneth A. Berman, Daniel J. Kleitman |
On a Problem in Shuffling. |
J. Comb. Theory, Ser. A |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Lior Pachter, Serafim Batzoglou, Valentin I. Spitkovsky, E. Banks, Eric S. Lander, Daniel J. Kleitman, Bonnie Berger |
A Dictionary-Based Approach for Gene Annotation. |
Journal of Computational Biology |
1999 |
DBLP BibTeX RDF |
|
| 1 | 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. |
RECOMB |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Lior Pachter |
Finding Convex Sets Among Points in the Plane. |
Discrete & Computational Geometry |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Daniel J. Kleitman |
A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. |
Electr. J. Comb. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma |
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Meir Katchalski, Daniel J. Kleitman |
Forcing Disjoint Segments in the Plane. |
Eur. J. Comb. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Daniel J. Kleitman |
An upper bound for the Ramsey numbers r(K3, G). |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jerrold R. Griggs, Daniel J. Kleitman |
Independence and the Havel-Hakimi residue. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman |
On the Maximum Number of Triangles in Wheel-Free Graphs. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman |
Crossing Families. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Daniel J. Kleitman |
The Prison Yard Problem. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman |
Even Cycles in Directed Graphs. |
SIAM J. Discrete Math. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma |
On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
reliable Boolean circuits design, partially unreliable gates, gate failure, short-circuit model, von Neumann model, worst-case faults, post-test alterations, tight bound, random faults, fault-tolerant circuits |
| 1 | Alexander Felzenbaum, Ron Holzman, Daniel J. Kleitman |
Packing lines in a hypercube. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Leonard J. Schulman |
Minimally Distant Sets of Lattice Points. |
Eur. J. Comb. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Daniel J. Kleitman |
Partitioning a rectangle into small perimeter rectangles. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman |
Point Selections and Weak e-Nets for Convex Hulls. |
Combinatorics, Probability & Computing |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Holzman, Daniel J. Kleitman |
Sign vectors and unit vectors. |
Combinatorica |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely |
Sharpening the LYM inequality. |
Combinatorica |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Daniel J. Kleitman |
Piercing Convex Sets. |
Symposium on Computational Geometry |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | G. Burosch, János Demetrovics, Gyula O. H. Katona, Daniel J. Kleitman, Alexander A. Sapozhenko |
On the Number of Databases and Closure Operations. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Aigner, Dwight Duffus, Daniel J. Kleitman |
Partitioning a power set into union-free classes. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Daniel J. Kleitman, Richard Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer |
Set systems with no union of cardinality 0 modulom. |
Graphs and Combinatorics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Douglas B. West |
Spanning Trees with Many Leaves. |
SIAM J. Discrete Math. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman |
Crossing Families. |
Symposium on Computational Geometry |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman |
Representations of families of triples over GF(2). |
J. Comb. Theory, Ser. A |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman |
Sphere coverings of the hypercube with incomparable centers. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ding-Zhu Du, Daniel J. Kleitman |
Diameter and Radius in the Manhattan Metric. |
Discrete & Computational Geometry |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Rakesh Vohra |
Computing the Bandwidth of Interval Graphs. |
SIAM J. Discrete Math. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria M. Klawe, Daniel J. Kleitman |
An Almost Linear Time Algorithm for Generalized Matrix Searching. |
SIAM J. Discrete Math. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman |
A Generalized Model for Understanding Evasiveness. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Michael R. Fellows |
Radius and diameter in Manhattan lattices. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman |
A minimal cutset of the boolean lattice with almost all members. |
Graphs and Combinatorics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman |
Pair Labeelings with Given Distance. |
SIAM J. Discrete Math. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman |
Divisors Without Unit-Congruent Ratios. |
SIAM J. Discrete Math. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Larry Finkelstein, Daniel J. Kleitman, Frank Thomson Leighton |
Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. |
AWOC |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Jichang Sha, Daniel J. Kleitman |
The number of linear extensions of subset ordering. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour |
The smallets n-uniform hypergraph with positive discrepancy. |
Combinatorica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman |
On a problem of Yuzvinsky on separating the n-cube. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Daniel J. Kleitman |
Covering a Square by Small Perimeter Rectangles. |
Discrete & Computational Geometry |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Deborah S. Franzblau, Daniel J. Kleitman |
An Algorithm for Covering Polygons with Rectangles |
Information and Control |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | S. F. Assmann, David S. Johnson, Daniel J. Kleitman, Joseph Y.-T. Leung |
On a Dual Version of the One-Dimensional Bin Packing Problem. |
J. Algorithms |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Deborah S. Franzblau, Daniel J. Kleitman |
An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals |
STOC |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth J. Winston, Daniel J. Kleitman |
On the Asymptotic Number of Tournament Score Sequences. |
J. Comb. Theory, Ser. A |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller |
An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. |
J. Comput. Syst. Sci. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Kenneth J. Winston |
On the number of graphs without 4-cycles. |
Discrete Mathematics |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman |
Inherent Complexity Trade-Offs for Range Query Problems. |
Theor. Comput. Sci. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Kahn, Daniel J. Kleitman |
On cross-bandwidth. |
Discrete Mathematics |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Kenneth J. Winston |
Forests and score vectors. |
Combinatorica |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, James B. Shearer, Dean Sturtevant |
Intersections of k-element sets. |
Combinatorica |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller |
New Layouts for the Shuffle-Exchange Graph (Extended Abstract) |
STOC |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, D. J. Kwiatkowski |
Further results on the Aanderaa-Rosenberg conjecture. |
J. Comb. Theory, Ser. B |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Steve Fisk, Daniel Abbw-Jackson, Daniel J. Kleitman |
Helly-type theorems about sets. |
Discrete Mathematics |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer |
Coping with Errors in Binary Search Procedures. |
J. Comput. Syst. Sci. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Chaiken, Daniel J. Kleitman |
Matrix Tree Theorems. |
J. Comb. Theory, Ser. A |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer |
Coping with Errors in Binary Search Procedures (Preliminary Report) |
STOC |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman |
A note on the parity of the number of crossings of a graph. |
J. Comb. Theory, Ser. B |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman |
Some New Results on the Littlewood-Offord Problem. |
J. Comb. Theory, Ser. A |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Curtis Greene, Daniel J. Kleitman |
Strong Versions of Sperner's Theorem. |
J. Comb. Theory, Ser. A |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman |
Extremal Properties of Collections of Subsets Containing No Two Sets and Their Union. |
J. Comb. Theory, Ser. A |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Curtis Greene, Daniel J. Kleitman |
The Structure of Sperner k-Families. |
J. Comb. Theory, Ser. A |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, D. J. Kwiatkowski |
A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences. |
J. Comb. Theory, Ser. A |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, Michael M. Krieger |
An Optimal Bound for Two Dimensional Bin Packing |
FOCS |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, T. L. Magnanti |
On the Number of Latent Subsets of Intersecting Collections. |
J. Comb. Theory, Ser. A |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman |
A Note on Perfect Elimination Digraphs. |
SIAM J. Comput. |
1974 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")