Daniel I. A. Cohen

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Daniel Isaac Aryeh Cohen (born 1946) is an American mathematician and computer scientist who is now a professor emeritus at Hunter College.[1]

Cohen earned a bachelor's degree in mathematics from Princeton University in 1967[1][2] and already as an undergraduate published a research paper about Sperner's lemma, which he learned about from Hans Rademacher.[3] He completed his doctorate in 1975 from Harvard University under the joint supervision of Andrew M. Gleason and Gian-Carlo Rota.[4] He was a mathematician at Hunter College in 1981 when the computer science department was founded, and became one of five initial computer science professors there.[5]

Cohen is the author of the textbooks Basic Techniques of Combinatorial Theory (John Wiley & Sons, 1979)[6] and Introduction to Computer Theory (John Wiley & Sons, 1986; 2nd ed., 1996).

An undergraduate award for a graduating senior at Hunter College, the Daniel I.A. Cohen Prize for Academic Excellence in Theoretical Computer Science, was named after Cohen.[7]

References[edit]

  1. ^ a b Faculty in Hunter's Computer Science Department, Hunter College, retrieved 2015-09-27.
  2. ^ Graduation year from Cohen, Daniel I. A. (January 18, 2012), "Holding the line on A's", Letters to the editor, Princeton Alumni Weekly.
  3. ^ Cohen, Daniel I. A. (1967), "On the Sperner lemma", Journal of Combinatorial Theory, 2 (4): 585–587, doi:10.1016/s0021-9800(67)80062-0.
  4. ^ Daniel I. A. Cohen at the Mathematics Genealogy Project.
  5. ^ CS Department History, Hunter College, retrieved 2015-09-27.
  6. ^ Buchanan, Iain (1980), "Basic Techniques of Combinatorial Theory", Book Selection, Journal of the Operational Research Society, 31: 85, doi:10.1057/jors.1980.16.
  7. ^ Ruth Hauptman wins inaugural Daniel I. A. Cohen Prize for Excellence in Theoretical Computer Science, Hunter College, retrieved 2015-09-27.