default search action
Daniel J. Kleitman
Person information
- affiliation: MIT, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2013
- [j96]Daniel J. Kleitman, Aditya Shastri, Vera T. Sós:
Editorial. Discret. Appl. Math. 161(9): 1169 (2013) - [j95]Shan-Yuan Ho, Daniel J. Kleitman:
An odd kind of BCH code. Discret. Appl. Math. 161(9): 1216-1220 (2013) - [j94]Yupei Xiong, Damon Gulczynski, Daniel J. Kleitman, Bruce L. Golden, Edward A. Wasil:
A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. Optim. Lett. 7(7): 1597-1609 (2013)
2000 – 2009
- 2006
- [j93]Paul Erdös, Daniel J. Kleitman:
Extremal problems among subsets of a set. Discret. Math. 306(10-11): 923-931 (2006) - [j92]Jacob Fox, Daniel J. Kleitman:
On Rado's Boundedness Conjecture. J. Comb. Theory A 113(1): 84-100 (2006) - 2005
- [j91]Daniel J. Kleitman, Rom Pinchasi:
A Note on Caterpillar-Embeddings with No Two Parallel Edges. Discret. Comput. Geom. 33(2): 223-229 (2005) - 2004
- [j90]Alex Coventry, Daniel J. Kleitman, Bonnie Berger:
msari. Proc. Natl. Acad. Sci. USA 101(33): 12102-12107 (2004) - 2003
- [j89]P. Acosta, A. Bassa, A. Chaikin, A. Riehl, A. Tingstad, L. Zhao, Daniel J. Kleitman:
On a conjecture of Brualdi and Shen on block transitive tournaments. J. Graph Theory 44(3): 215-230 (2003) - 2002
- [j88]Noga Alon, Tom Bohman
, Ron Holzman, Daniel J. Kleitman:
On partitions of discrete boxes. Discret. Math. 257(2-3): 255-258 (2002) - 2001
- [j87]Daniel J. Kleitman, András Gyárfás, Géza Tóth:
Convex Sets in the Plane with Three of Every Four Meeting. Comb. 21(2): 221-232 (2001) - [j86]Tom Bohman
Six Lonely Runners. Electron. J. Comb. 8(2) (2001) - 2000
- [j85]Noga Alon, Kenneth A. Berman, Daniel J. Kleitman:
On a Problem in Shuffling. J. Comb. Theory A 91(1-2): 5-14 (2000)
1990 – 1999
- 1999
- [j84]Lior Pachter
A Dictionary-Based Approach for Gene Annotation. J. Comput. Biol. 6(3/4): 419-430 (1999) - [c11]Lior Pachter, Serafim Batzoglou, Valentin I. Spitkovsky, William S. Beebee, Eric S. Lander, Bonnie Berger
A dictionary based approach for gene annotation. RECOMB 1999: 285-294 - 1998
- [j83]Daniel J. Kleitman, Lior Pachter
Finding Convex Sets Among Points in the Plane. Discret. Comput. Geom. 19(3): 405-410 (1998) - 1997
- [j82]Noga Alon, Daniel J. Kleitman:
A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. Electron. J. Comb. 4(2) (1997) - [j81]Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma:
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. J. Comput. Syst. Sci. 55(3): 385-401 (1997) - 1996
- [j80]Wayne Goddard, Meir Katchalski, Daniel J. Kleitman:
Forcing Disjoint Segments in the Plane. Eur. J. Comb. 17(4): 391-395 (1996) - 1995
- [j79]Daniel J. Kleitman, Fernando R. Lasaga, Lenore J. Cowen:
Asymptotic enumeration of full graphs. J. Graph Theory 20(1): 59-69 (1995) - 1994
- [j78]Boris Aronov
Crossing Families. Comb. 14(2): 127-134 (1994) - [j77]Zoltán Füredi, Daniel J. Kleitman:
The Prison Yard Problem. Comb. 14(3): 287-300 (1994) - [j76]Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman:
On the Maximum Number of Triangles in Wheel-Free Graphs. Comb. Probab. Comput. 3: 63-75 (1994) - [j75]Wayne Goddard, Daniel J. Kleitman:
An upper bound for the Ramsey numbers r(K3, G). Discret. Math. 125(1-3): 177-182 (1994) - [j74]Jerrold R. Griggs, Daniel J. Kleitman:
Independence and the Havel-Hakimi residue. Discret. Math. 127(1-3): 209-212 (1994) - [j73]Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman:
Even Cycles in Directed Graphs. SIAM J. Discret. Math. 7(3): 474-483 (1994) - [c10]Ding-Zhu Du, D. Frank Hsu, Daniel J. Kleitman:
Modification of consecutive-d digraphs. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 75-85 - [c9]Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma:
On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates. FOCS 1994: 332-346 - 1993
- [j72]Alexander Felzenbaum, Ron Holzman, Daniel J. Kleitman:
Packing lines in a hypercube. Discret. Math. 117(1-3): 107-112 (1993) - [j71]Daniel J. Kleitman, Leonard J. Schulman
Minimally Distant Sets of Lattice Points. Eur. J. Comb. 14(3): 231-240 (1993) - [j70]Wayne Goddard, Daniel J. Kleitman:
A note on maximal triangle-free graphs. J. Graph Theory 17(5): 629-631 (1993) - 1992
- [j69]Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely:
Sharpening the LYM inequality. Comb. 12(3): 287-293 (1992) - [j68]Ron Holzman, Daniel J. Kleitman:
Sign vectors and unit vectors. Comb. 12(3): 303-316 (1992) - [j67]Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman:
Point Selections and Weak e-Nets for Convex Hulls. Comb. Probab. Comput. 1: 189-200 (1992) - [j66]Noga Alon, Daniel J. Kleitman:
Partitioning a rectangle into small perimeter rectangles. Discret. Math. 103(2): 111-119 (1992) - [j65]Zoltán Füredi, Daniel J. Kleitman:
On zero-trees. J. Graph Theory 16(2): 107-120 (1992) - [c8]Noga Alon, Daniel J. Kleitman:
Piercing Convex Sets. SCG 1992: 157-160 - 1991
- [j64]Martin Aigner, Dwight Duffus, Daniel J. Kleitman:
Partitioning a power set into union-free classes. Discret. Math. 88(2-3): 113-119 (1991) - [j63]Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer:
Set systems with no union of cardinality 0 modulom. Graphs Comb. 7(2): 97-99 (1991) - [j62]Daniel J. Kleitman, Douglas B. West:
Spanning Trees with Many Leaves. SIAM J. Discret. Math. 4(1): 99-106 (1991) - [j61]Gustav 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. 78(2): 377-381 (1991) - [c7]Boris Aronov
Crossing Families. SCG 1991: 351-356 - [c6]Daniel J. Kleitman:
Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few. Planar Graphs 1991: 95-107 - 1990
- [j60]Ding-Zhu Du, Daniel J. Kleitman:
Diameter and Radius in the Manhattan Metric. Discret. Comput. Geom. 5: 351-356 (1990) - [j59]Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman:
Sphere coverings of the hypercube with incomparable centers. Discret. Math. 83(1): 129-134 (1990) - [j58]Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman:
Representations of families of triples over GF(2). J. Comb. Theory A 53(2): 306-315 (1990) - [j57]Maria M. Klawe, Daniel J. Kleitman:
An Almost Linear Time Algorithm for Generalized Matrix Searching. SIAM J. Discret. Math. 3(1): 81-97 (1990) - [j56]Daniel J. Kleitman, Rakesh Vohra:
Computing the Bandwidth of Interval Graphs. SIAM J. Discret. Math. 3(3): 373-375 (1990)
1980 – 1989
- 1989
- [j55]Daniel J. Kleitman, Michael R. Fellows
Radius and diameter in Manhattan lattices. Discret. Math. 73(1-2): 119-125 (1989) - [j54]Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman:
A minimal cutset of the boolean lattice with almost all members. Graphs Comb. 5(1): 327-332 (1989) - [j53]Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman:
A Generalized Model for Understanding Evasiveness. Inf. Process. Lett. 30(4): 205-208 (1989) - [j52]Jerrold R. Griggs, Daniel J. Kleitman, Aditya Shastri:
Spanning trees with many leaves in cubic graphs. J. Graph Theory 13(6): 669-695 (1989) - [j51]Daniel J. Kleitman:
Divisors Without Unit-Congruent Ratios. SIAM J. Discret. Math. 2(3): 344-349 (1989) - [j50]Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman:
Pair Labeelings with Given Distance. SIAM J. Discret. Math. 2(4): 491-499 (1989) - 1988
- [c5]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: 247-256 - 1987
- [j49]Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour
The smallets n-uniform hypergraph with positive discrepancy. Comb. 7(2): 151-160 (1987) - [j48]Jichang Sha, Daniel J. Kleitman:
The number of linear extensions of subset ordering. Discret. Math. 63(2-3): 271-278 (1987) - [j47]Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. J. Graph Theory 11(3): 367-371 (1987) - 1986
- [j46]Noga Alon, Daniel J. Kleitman:
Covering a Square by Small Perimeter Rectangles. Discret. Comput. Geom. 1: 1-7 (1986) - [j45]Daniel J. Kleitman:
On a problem of Yuzvinsky on separating the n-cube. Discret. Math. 60: 207-213 (1986) - [j44]Curtis Greene, Daniel J. Kleitman:
Longest Chains in the Lattice of Integer Partitions ordered by Majorization. Eur. J. Comb. 7(1): 1-10 (1986) - 1984
- [j43]Susan F. Assmann, Daniel J. Kleitman:
Characterization of curve map graphs. Discret. Appl. Math. 8(2): 109-124 (1984) - [j42]Deborah S. Franzblau, Daniel J. Kleitman:
An Algorithm for Covering Polygons with Rectangles. Inf. Control. 63(3): 164-189 (1984) - [j41]Susan 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 5(4): 502-525 (1984) - [c4]Deborah S. Franzblau, Daniel J. Kleitman:
An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals. STOC 1984: 167-174 - 1983
- [j40]Daniel J. Kleitman, Robert A. Lew:
An algorithm for collapsing sign alternating sequences of real numbers. Discret. Appl. Math. 6(1): 49-53 (1983) - [j39]Susan F. Assmann, Daniel J. Kleitman:
The number of rounds needed to exchange information within a graph. Discret. Appl. Math. 6(2): 117-125 (1983) - [j38]Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller:
An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. J. Comput. Syst. Sci. 26(3): 339-361 (1983) - [j37]Kenneth J. Winston, Daniel J. Kleitman:
On the Asymptotic Number of Tournament Score Sequences. J. Comb. Theory A 35(2): 208-230 (1983) - 1982
- [j36]Daniel J. Kleitman, Kenneth J. Winston:
On the number of graphs without 4-cycles. Discret. Math. 41(2): 167-172 (1982) - 1981
- [j35]Daniel J. Kleitman, Kenneth J. Winston:
Forests and score vectors. Comb. 1(1): 49-54 (1981) - [j34]Daniel J. Kleitman, James B. Shearer, Dean Sturtevant:
Intersections of k-element sets. Comb. 1(4): 381-384 (1981) - [j33]Jeff Kahn, Daniel J. Kleitman:
On cross-bandwidth. Discret. Math. 33(3): 323-325 (1981) - [j32]Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman:
Inherent Complexity Trade-Offs for Range Query Problems. Theor. Comput. Sci. 16: 279-290 (1981) - [c3]Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller:
New Layouts for the Shuffle-Exchange Graph (Extended Abstract). STOC 1981: 278-292 - 1980
- [j31]Daniel J. Kleitman, James B. Shearer:
Further gossip problems. Discret. Math. 30(2): 151-156 (1980) - [j30]Steve Fisk, Daniel Abbw-Jackson, Daniel J. Kleitman:
Helly-type theorems about sets. Discret. Math. 32(1): 19-25 (1980) - [j29]Ronald L. Rivest, Albert R. Meyer
Coping with Errors in Binary Search Procedures. J. Comput. Syst. Sci. 20(3): 396-404 (1980) - [j28]Daniel J. Kleitman, David Joseph Kwiatkowski:
Further results on the Aanderaa-Rosenberg conjecture. J. Comb. Theory B 28(1): 85-95 (1980) - [j27]Daniel J. Kleitman, Kenneth J. Winston:
Ensembles and Largest Sojourns of Random Walks. SIAM J. Algebraic Discret. Methods 1(1): 15-20 (1980)
1970 – 1979
- 1979
- [j26]Douglas B. West, Daniel J. Kleitman:
Skew chain orders and sets of rectangles. Discret. Math. 27(1): 99-102 (1979) - [j25]David E. Daykin, Daniel J. Kleitman, Douglas B. West:
The Number of Meets between Two Subsets of a Lattice. J. Comb. Theory A 26(2): 135-156 (1979) - 1978
- [j24]S. Chaiken, Daniel J. Kleitman:
Matrix Tree Theorems. J. Comb. Theory A 24(3): 377-381 (1978) - [c2]Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer:
Coping with Errors in Binary Search Procedures (Preliminary Report). STOC 1978: 227-232 - 1977
- [j23]Jerrold R. Griggs, Daniel J. Kleitman:
A three part Sperner theorem. Discret. Math. 17(3): 281-289 (1977) - 1976
- [j22]Daniel J. Kleitman:
More on complementary trees. Discret. Math. 15(4): 373-378 (1976) - [j21]Curtis Greene, Daniel J. Kleitman:
The Structure of Sperner k-Families. J. Comb. Theory A 20(1): 41-68 (1976) - [j20]Curtis Greene, Daniel J. Kleitman:
Strong Versions of Sperner's Theorem. J. Comb. Theory A 20(1): 80-88 (1976) - [j19]Daniel J. Kleitman:
Some New Results on the Littlewood-Offord Problem. J. Comb. Theory A 20(1): 89-113 (1976) - [j18]Daniel J. Kleitman:
Extremal Properties of Collections of Subsets Containing No Two Sets and Their Union. J. Comb. Theory A 20(3): 390-392 (1976) - [j17]Daniel J. Kleitman:
A note on the parity of the number of crossings of a graph. J. Comb. Theory B 21(1): 88-89 (1976) - [j16]Daniel J. Kleitman, David Joseph Kwiatkowski:
A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences. J. Comb. Theory A 21(2): 129-136 (1976) - 1975
- [j15]Elliot Bird, Curtis Greene, Daniel J. Kleitman:
Automorphisms of lexicographic products. Discret. Math. 11(3): 191-198 (1975) - [c1]Daniel J. Kleitman, Michael M. Krieger:
An Optimal Bound for Two Dimensional Bin Packing. FOCS 1975: 163-168 - 1974
- [j14]Paul Erdös, Daniel J. Kleitman:
Extremal problems among subsets of a set. Discret. Math. 8(3): 281-294 (1974) - [j13]Daniel J. Kleitman, Thomas L. Magnanti:
On the Number of Latent Subsets of Intersecting Collections. J. Comb. Theory A 16(2): 215-220 (1974) - [j12]Armin Claus, Daniel J. Kleitman:
Cost allocation in networks: The bulk supplier problem. Networks 4(1): 1-17 (1974) - [j11]Daniel J. Kleitman:
A Note on Perfect Elimination Digraphs. SIAM J. Comput. 3(4): 280-282 (1974) - 1973
- [j10]Daniel J. Kleitman, D. L. Wang:
Algorithms for constructing graphs and digraphs with given valences and factors. Discret. Math. 6(1): 79-88 (1973) - [j9]Daniel J. Kleitman, E. C. Milner:
On the average size of the sets in a Sperner family. Discret. Math. 6(2): 141-147 (1973) - [j8]Daniel J. Kleitman, Joel H. Spencer:
Families of k-independent sets. Discret. Math. 6(3): 255-262 (1973) - [j7]D. L. Wang, Daniel J. Kleitman:
On the existence of N-connected graphs with prescribed degrees (n ≧ 2). Networks 3(3): 225-239 (1973) - [j6]Armin Claus, Daniel J. Kleitman:
Cost allocation for a spanning tree. Networks 3(4): 289-304 (1973) - 1972
- [j5]Daniel J. Kleitman, B. L. Rothschild:
A generalization of Kaplansky's game. Discret. Math. 2(2): 173-178 (1972) - 1971
- [j4]Ole J. Heilmann, Daniel J. Kleitman, Elliott H. Lieb, Seymour Sherman:
Some positive definite functions on sets and their application to the Ising model. Discret. Math. 1(1): 19-27 (1971) - [j3]Daniel J. Kleitman, M. Edelberg, David Lubell:
Maximal sized antichains in partial orders. Discret. Math. 1(1): 47-53 (1971) - [j2]Daniel J. Kleitman:
An algorithm for certain multi-commodity flow problems. Networks 1(1): 75-90 (1971) - 1970
- [j1]B. Rothfarb, H. Frank, D. M. Rosenbaum, Kenneth Steiglitz, Daniel J. Kleitman:
Optimal Design of Offshore Natural-Gas Pipeline Systems. Oper. Res. 18(6): 992-1020 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: