About
Professor Daniel Kleitman is a faculty member in the Massachusetts Institute of Technology (MIT) Department of Mathematics, where he has taught courses such as 18.310 Principles of Discrete Applied Mathematics, 18.01 Calculus, and 18.022 Calculus. His academic rank is Professor, with a career spanning decades in combinatorics, discrete mathematics, and interdisciplinary applications.
- Teaches 18.310 (Discrete Applied Mathematics)
- Teaches 18.01 (Calculus)
- Teaches 18.022 (Multivariable Calculus)
Research Interests
Professor Kleitman’s work lies at the intersection of combinatorics, graph theory, and discrete applied mathematics. His research explores:- Theoretical foundations of discrete mathematics
- Error-correcting codes and cryptographic algorithms
- Applications to computer science, biology, and physics
- Geometric and probabilistic methods in combinatorics
Publications Trends
His publications since 1980 emphasize combinatorics, graph theory, and algorithm design. Key areas include:- Combinatorial geometry (convex sets, planarity)
- Network optimization (spanning trees, linear programming)
- Coding theory (Shannon bounds, BCH codes)
- Interdisciplinary applications (gene recognition, urban homicide analysis)
0Publications listed
Find Daniel Kleitman elsewhere
Related Searches
You Might Also Like
- DDaniel J. KleitmanMassachusetts Institute of Technology · Professor
Pedro Alves Martins RodriguesUniversity of Lisbon · Assistant Professor
Michael KrivelevichUniversity of Novi Sad · Professor- MMichael SaksRutgers, The State University of New Jersey · Professor
- WWagner, StephanGraz University of Technology · Professor
Darij GrinbergLudwig Maximilian University of Munich · Assistant Professor