Daniel J. Kleitman

From MaRDI portal
Person:228778

Available identifiers

zbMath Open kleitman.daniel-jWikidataQ782922 ScholiaQ782922MaRDI QIDQ228778

List of research outcomes

PublicationDate of PublicationType
Coping with errors in binary search procedures (Preliminary Report)2014-03-14Paper
An odd kind of BCH code2013-11-29Paper
A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts2013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q52955792007-07-30Paper
Extremal problems among subsets of a set. (Reprint)2006-08-04Paper
On Rado's boundedness conjecture2006-03-16Paper
A note on caterpillar-embeddings with no two parallel edges2005-04-15Paper
On partitions of discrete boxes2002-12-02Paper
Convex sets in the plane with three of every four meeting2002-02-13Paper
Recent developments in computational gene recognition2001-11-11Paper
Six lonely runners2001-10-16Paper
On a problem in shuffling2001-03-04Paper
Finding convex sets among points in the plane1999-03-18Paper
On the design of reliable Boolean circuits that contain partially unreliable gates1998-08-04Paper
A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture1998-02-15Paper
https://portal.mardi4nfdi.de/entity/Q43478961997-08-11Paper
Acyclic matchings1997-05-04Paper
Forcing disjoint segments in the plane1996-07-02Paper
https://portal.mardi4nfdi.de/entity/Q48825551996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48590131996-04-23Paper
The prison yard problem1995-08-01Paper
https://portal.mardi4nfdi.de/entity/Q43266441995-04-18Paper
On the Maximum Number of Triangles in Wheel-Free Graphs1995-03-09Paper
An upper bound for the Ramsey numbers \(r(K_ 3,G)\)1994-09-11Paper
https://portal.mardi4nfdi.de/entity/Q42846141994-08-29Paper
https://portal.mardi4nfdi.de/entity/Q31382901994-08-28Paper
Crossing families1994-08-11Paper
Independence and the Havel-Hakimi residue1994-06-09Paper
Point Selections and Weak ε-Nets for Convex Hulls1994-05-30Paper
https://portal.mardi4nfdi.de/entity/Q42846101994-03-24Paper
Packing lines in a hypercube1994-03-20Paper
A note on maximal triangle‐free graphs1994-03-17Paper
Even Cycles in Directed Graphs1994-01-01Paper
Minimally distant sets of lattice points1993-08-25Paper
Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40284771993-03-28Paper
Sharpening the LYM inequality1993-01-17Paper
On the product of sign vectors and unit vectors1993-01-17Paper
Partitioning a rectangle into small perimeter rectangles1993-01-16Paper
Piercing convex sets1993-01-16Paper
A quasi-polynomial bound for the diameter\\of graphs of polyhedra1992-09-27Paper
On zero-trees1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39832561992-06-27Paper
Set systems with no union of cardinality 0 modulo \(m\)1992-06-25Paper
Partitioning a power set into union-free classes1992-06-25Paper
Representations of families of triples over \(GF(2)\)1992-06-25Paper
Sphere coverings of the hypercube with incomparable centers1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39721351992-06-25Paper
On the number of databases and closure operations1991-01-01Paper
Spanning Trees with Many Leaves1991-01-01Paper
Diameter and radius in the Manhattan metric1990-01-01Paper
An Almost Linear Time Algorithm for Generalized Matrix Searching1990-01-01Paper
Computing the Bandwidth of Interval Graphs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57493461990-01-01Paper
An addition theorem on the integers modulo \(n\)1989-01-01Paper
Radius and diameter in Manhattan lattices1989-01-01Paper
A minimal cutset of the Boolean lattice with almost all members1989-01-01Paper
Minimum cutsets for an element of a Boolean lattice1989-01-01Paper
A generalized model for understanding evasiveness1989-01-01Paper
Spanning trees with many leaves in cubic graphs1989-01-01Paper
Pair Labellings with Given Distance1989-01-01Paper
Divisors without Unit-Congruent Ratios1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32010671988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38082951988-01-01Paper
The smallest n-uniform hypergraph with positive discrepancy1987-01-01Paper
The number of linear extensions of subset ordering1987-01-01Paper
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number1987-01-01Paper
Covering a square by small perimeter rectangles1986-01-01Paper
Longest chains in the lattice of integer partitions ordered by majorization1986-01-01Paper
On a problem of Yuzvinsky on separating the n-cube1986-01-01Paper
Characterization of curve map graphs1984-01-01Paper
On a dual version of the one-dimensional bin packing problem1984-01-01Paper
Superantichains in the Lattice of Partitions of a Set1984-01-01Paper
An algorithm for covering polygons with rectangles1984-01-01Paper
On the asymptotic number of tournament score sequences1983-01-01Paper
The number of rounds needed to exchange information within a graph1983-01-01Paper
An asymptotically optimal layout for the shuffle-exchange graph1983-01-01Paper
An algorithm for collapsing sign alternating sequences of real numbers1983-01-01Paper
Traditional Galleries Require Fewer Watchmen1983-01-01Paper
A Statistical Procedure for Cluster Recognition with Application to Atlanta Leukemia-Lymphoma Data1983-01-01Paper
On the number of graphs without 4-cycles1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39443511982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39607811982-01-01Paper
Inherent complexity trade-offs for range query problems1981-01-01Paper
On cross-bandwidth1981-01-01Paper
Intersections of k-element sets1981-01-01Paper
Forests and score vectors1981-01-01Paper
On the Partial Sums of the Rearrangements of a Complex Series1981-01-01Paper
A Monotonicity Property of Partial Orders1981-01-01Paper
Some Results on Systems of Finite Sets That Satisfy a Certain Intersection Condition1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39476671981-01-01Paper
Set Orderings Requiring Costliest Alphabetic Binary Trees1981-01-01Paper
Covering Regions by Rectangles1981-01-01Paper
Helly-type theorems about sets1980-01-01Paper
Coping with errors in binary search procedures1980-01-01Paper
Further gossip problems1980-01-01Paper
Further results on the Aanderaa-Rosenberg conjecture1980-01-01Paper
The Asymptotic Number of Lattices1980-01-01Paper
Ensembles and Largest Sojourns of Random Walks1980-01-01Paper
The number of meets between two subsets of a lattice1979-01-01Paper
Skew chain orders and sets of rectangles1979-01-01Paper
Probabilities of Independent Choices Being Ordered1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39414351979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41935101979-01-01Paper
Matrix tree theorems1978-01-01Paper
Some Optimization Problems with Bulk-Service Queues1978-01-01Paper
On Two-Terminal Control of a Shuttle Service1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41964361978-01-01Paper
Algorithms for Loop Matchings1978-01-01Paper
A three part Sperner theorem1977-01-01Paper
Maximal Rectilinear Crossing of Cycles1977-01-01Paper
On the Existence of Simultaneous Edge Disjoint Realizations of Degree Sequences with “Few” Edges1977-01-01Paper
The degree sequences of self-complementary graphs1976-01-01Paper
Extremal properties of collections of subsets containing no two sets and their union1976-01-01Paper
A lower bound on the length of a sequence containing all permutations as subsequences1976-01-01Paper
More on complementary trees1976-01-01Paper
A note on the parity of the number of crossings of a graph1976-01-01Paper
Some new results on the Littlewood-Offord problem1976-01-01Paper
Strong versions of Sperner's theorem1976-01-01Paper
The Number of Semigroups of Order n1976-01-01Paper
Extensions of the Erdös-Ko-Rado Theorem1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41336581976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41407611976-01-01Paper
The structure of Sperner k-families1976-01-01Paper
The structure of Sperner k-families1976-01-01Paper
The structure of Sperner k-families1976-01-01Paper
Automorphisms of lexicographic products1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40446051975-01-01Paper
Counting Trees in a Certain Class of Graphs1975-01-01Paper
Asymptotic Enumeration of Partial Orders on a Finite Set1975-01-01Paper
Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40749051975-01-01Paper
On Dedekind's Problem: The Number of Isotone Boolean Functions. II1975-01-01Paper
A Note on Some Subset Identities1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40972911975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41035771975-01-01Paper
Algorithms1975-01-01Paper
Extremal problems among subsets of a set1974-01-01Paper
On the number of latent subsets of intersecting collections1974-01-01Paper
A Note on Random Triangles1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40505981974-01-01Paper
Complementary Trees and Independent Matchings1974-01-01Paper
Cost allocation in networks: The bulk supplier problem1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773131974-01-01Paper
Increasing paths in edge ordered graphs1973-01-01Paper
On the average size of the sets in a Sperner family1973-01-01Paper
Families of \(k\)-independent sets1973-01-01Paper
Cost allocation for a spanning tree1973-01-01Paper
Normalized Matching in Direct Products of Partial Orders1973-01-01Paper
A generalization of Kaplansky's game1972-01-01Paper
How many sums of vectors can lie in a circle of diameter \(\sqrt 2?\)1972-01-01Paper
Another Proof of a Result of Perry on Chains of Finite Sets1972-01-01Paper
Finding Uncomplemented Trees1972-01-01Paper
Maximal sized antichains in partial orders1971-01-01Paper
Some positive definite functions on sets and their application to the Ising model1971-01-01Paper
On Collections of Subsets Containing No 4-Member Boolean Algebra1971-01-01Paper
Configurations Maximizing the Number of Pairs of Hamming‐Adjacent Lattice Points1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56368861971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56403711971-01-01Paper
An algorithm for certain multi‐commodity flow problems1971-01-01Paper
On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors1970-01-01Paper
A matching theorem for graphs1970-01-01Paper
Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops1970-01-01Paper
The Number of Finite Topologies1970-01-01Paper
Proportions of Irreducible Diagrams1970-01-01Paper
The crossing number of K5,n1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56168651970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56183741970-01-01Paper
Packing Squares in Rectangles I1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56617351970-01-01Paper
On subsets contained in a family of non-commensurable subsets of a finite set1969-01-01Paper
On Dedekind's Problem: The Number of Monotone Boolean Functions1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55428101968-01-01Paper
On families of subsets of a finite set containing no two disjoint sets and their union1968-01-01Paper
On a conjecture of milner on k-graphs with non-disjoint edges1968-01-01Paper
On coloring graphs to maximize the proportion of multicolored k-edges1968-01-01Paper
Maximal number of subsets of a finite set No k of which are pairwise disjoint1968-01-01Paper
On a Combinatorial Problem of Erdos1966-01-01Paper
Families of Non-disjoint subsets1966-01-01Paper
On a combinatorial conjecture of Erdös1966-01-01Paper
On a lemma of Littlewood and Offord on the distribution of certain sums1965-01-01Paper
Some results on analytic functions in local field theory1959-01-01Paper
On the parity of K-baryon vertices1959-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Daniel J. Kleitman