World's Best Scientists 2026 revealed!
Daniel J. Kleitman

Daniel J. Kleitman

D-Index & Metrics

Computer Science

D-Index
46
Citations
9354
World Ranking
6811
National Ranking
2994

Mathematics

D-Index
50
Citations
10207
World Ranking
1081
National Ranking
502

Research.com Recognitions

  • 1973 - Fellow of the American Academy of Arts and Sciences

Overview

Daniel J. Kleitman is a researcher affiliated with MIT in the United States. Their work primarily spans the field of Computer Science, with contributions across several subfields including Geometry and Topology, Computer Graphics and Computer-Aided Design, and Computer Vision and Pattern Recognition.

Their research interests are reflected in key topics such as Mathematics and Applications, Computational Geometry and Mesh Generation, and Digital Image Processing Techniques. These areas form the basis of their scholarly output and academic contributions.

Recent publications by Kleitman include:

  • The Game of Life (2021) published in Inference International Review of Science
  • Points and Lines (2020) published in Inference International Review of Science
  • Issue Information-TOC (2023) published in Studies in Applied Mathematics

Frequent collaborators in Kleitman's work include Jianke Yang, Dmitry Pelinovski, T. R. Akylas, Ruth Baker, and Alfredo Cabrera. These co-authors have contributed alongside Kleitman in various research projects and publications.

Kleitman's work is often featured in venues such as Inference International Review of Science, where they have published multiple papers, as well as Studies in Applied Mathematics.

In recognition of their contributions to academia, Kleitman was honored as a Fellow of the American Academy of Arts and Sciences in 1973.

Best Publications

  • Algorithms for Loop Matchings

    Ruth Nussinov;George Pieczenik;Jerrold R. Griggs;Daniel J. Kleitman

  • Families of k-independent sets

    Daniel J. Kleitman;Joel Spencer

  • Asymptotic enumeration of partial orders on a finite set

    D. J. Kleitman;B. L. Rothschild

  • Proof techniques in the theory of finite sets

    Curtis Greene;Daniel J. Kleitman

  • The structure of sperner k-families

    Curtis Greene;Daniel J Kleitman

  • The Design of Minimum-Cost Survivable Networks

    K. Steiglitz;P. Weiner;D. Kleitman

  • Traditional Galleries Require Fewer Watchmen

    J. Kahn;M. Klawe;D. Kleitman

  • Spanning trees with many leaves

    Daniel J. Kleitman;Douglas B. West

  • The crossing number of K5,n

    Daniel J. Kleitman;Daniel J. Kleitman

  • Coping with errors in binary search procedures

    Ronald L. Rivest;Albert R. Meyer;Daniel J. Kleitman;Karl Winklmann

  • Algorithms for constructing graphs and digraphs with given valences and factors

    D. J. Kleitman;D. L. Wang

  • On a dual version of the one-dimensional bin packing problem

    Susan F. Assmann;David S. Johnson;Daniel J. Kleitman;Joseph Y.-T. Leung

  • Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem

    Noga Mordechai Alon;Daniel J. Kleitman

  • A quasi-polynomial bound for the diameter of graphs of polyhedra

    Gil Kalai;Daniel J. Kleitman

  • Cost allocation for a spanning tree

    Armin Claus;Daniel J. Kleitman

  • Matrix Tree Theorems

    S. Chaiken;Daniel J. Kleitman

  • On the number of graphs without 4-cycles

    Daniel J. Kleitman;Kenneth J. Winston

  • On a combinatorial conjecture of Erdös

    Unknown

  • Strong Versions of Sperner’s Theorem

    Curtis Greene;Daniel J Kleitman

  • Point Selections and Weak ε-Nets for Convex Hulls

    Noga Alon;Noga Alon;Imre Bárány;Imre Bárány;Zoltán Füredi;Daniel J. Kleitman

  • On Dedekind’s problem: The number of monotone Boolean functions

    Daniel Kleitman

  • On Dedekind’s problem: the number of isotone Boolean functions. II

    D. Kleitman;G. Markowsky

Frequent Co-Authors

Noga Alon
Noga Alon Tel Aviv University
Zoltán Füredi
Zoltán Füredi University of Illinois at Urbana-Champaign
Wayne Goddard
Wayne Goddard Clemson University
Joel Spencer
Joel Spencer Courant Institute of Mathematical Sciences
Eric S. Lander
Eric S. Lander Broad Institute
Serafim Batzoglou
Serafim Batzoglou Stanford University
Douglas B. West
Douglas B. West University of Illinois at Urbana-Champaign
Imre Bárány
Imre Bárány Alfréd Rényi Institute of Mathematics

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a degree in Mathematics opens doors to various advanced educational paths and lucrative careers. For those interested in applied mathematical skills, a master in data analytics offers specialized knowledge in interpreting complex data, a growing field with high demand across industries.

Many Mathematics graduates also consider expanding their business acumen through an MBA. If accessibility and flexibility are priorities, exploring the easiest mba to get into or the easiest mba program can streamline the transition into leadership roles without compromising credential value.

For those aiming for executive-level expertise in business alongside their quantitative skills, dba programs online provide accessible pathways to doctoral qualifications, ideal for career advancement or academic ambitions.

Exploring these related online degrees not only enhances career flexibility but also equips graduates with diverse competencies tailored to the evolving job market.

Best Scientists Citing Daniel J. Kleitman

Trending Scientists

Recently Published Articles