Harry Mairson | |
---|---|
Alma mater | Yale University Stanford University |
Known for | type inference for the ML programming language Hindley–Milner type inference |
Scientific career | |
Institutions | Stanford University Boston University Brandeis University |
Thesis | The Program Complexity of Searching a Table (1983) |
Doctoral advisor | Jeffrey Ullman |
Website | https://www.cs.brandeis.edu/~mairson/ |
Harry George Mairson is a theoretical computer scientist and professor of computer science in the Volen National Center for Complex Systems at Brandeis University in Waltham, Massachusetts. His research is in the fields of logic in computer science, lambda calculus and functional programming, type theory and constructive mathematics, computational complexity theory, and algorithmics. [1]
His Ph.D. thesis, The Program Complexity of Searching a Table, won the Machtey Award at the 1983 IEEE Symposium on Foundations of Computer Science (FOCS). [2] Mairson was a Postdoctoral researcher at INRIA Rocqencourt from 1984 to 1985, at Stanford University in 1985, and at the University of Oxford in 1986. [3] He held a visiting professor position from 1999 to 2001 at Boston University. From 2005 to 2007, Mairson has served as the Chair of the Faculty Senate at Brandeis. He is currently an Associate Editor of the journal Logical Methods in Computer Science and Information and Computation , and sits on the editorial board of Higher-Order and Symbolic Computation . [1]
Mairson's contributions to the theory of programming languages include proving that type inference for the ML programming language, so-called Hindley–Milner type inference, is complete for exponential time and that parallel beta reduction is non-elementary.
Mairson received a B.A. in mathematics from Yale University in 1978 and a Ph.D. in computer science from Stanford University in 1984 under the supervision of Jeffrey Ullman.
Stephen Arthur Cook is an American-Canadian computer scientist and mathematician who has made significant contributions to the fields of complexity theory and proof complexity. He is a university professor at the University of Toronto, Department of Computer Science and Department of Mathematics.
Juris Hartmanis was a Latvian-born American computer scientist and computational theorist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".
Manuel Blum is a Venezuelan-American computer scientist who received the Turing Award in 1995 "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking".
The UCPH Department of Computer Science is a department in the Faculty of Science at the University of Copenhagen (UCPH). It is the longest established department of Computer Science in Denmark and was founded in 1970 by Turing Award winner Peter Naur. As of 2021, it employs 82 academic staff, 126 research staff and 38 support staff. It is consistently ranked the top Computer Science department in the Nordic countries, and in 2017 was placed 9th worldwide by the Academic Ranking of World Universities.
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory.
Jeffrey David Ullman is an American computer scientist and the Stanford W. Ascherman Professor of Engineering, Emeritus, at Stanford University. His textbooks on compilers, theory of computation, data structures, and databases are regarded as standards in their fields. He and his long-time collaborator Alfred Aho are the recipients of the 2020 Turing Award, generally recognized as the highest distinction in computer science.
Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.
Eduardo Daniel Sontag is an American mathematician, and distinguished university professor at Northeastern University, who works in the fields control theory, dynamical systems, systems molecular biology, cancer and immunology, theoretical computer science, neural networks, and computational biology.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
Frances Foong Chu Yao is a Taiwanese-born American mathematician and theoretical computer scientist. She is currently a Chair Professor at the Institute for Interdisciplinary Information Sciences (IIIS) of Tsinghua University. She was Chair Professor and Head of the Department of computer science at the City University of Hong Kong, where she is now an honorary professor.
Dana Angluin is a professor emeritus of computer science at Yale University. She is known for foundational work in computational learning theory and distributed computing.
Richard Ryan Williams, known as Ryan Williams, is an American theoretical computer scientist working in computational complexity theory and algorithms.
Samuel R. (Sam) Buss is an American computer scientist and mathematician who has made major contributions to the fields of mathematical logic, complexity theory and proof complexity. He is currently a professor at the University of California, San Diego, Department of Computer Science and Department of Mathematics.
Noam Nisan is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory.
Jaikumar Radhakrishnan is an Indian computer scientist specialising in combinatorics and communication complexity. He has served as dean of the School of Technology and Computer Science at the Tata Institute of Fundamental Research, Mumbai, India, where he is currently a senior professor.
Marcus William Feldman is the Burnet C. and Mildred Finley Wohlford Professor of Biological Sciences, director of the Morrison Institute for Population and Resource Studies, and co-director of the Center for Computational, Evolutionary and Human Genomics (CEHG) at Stanford University. He is an Australian-born mathematician turned American theoretical biologist, best known for his mathematical evolutionary theory and computational studies in evolutionary biology, and for originating with L. L. Cavalli-Sforza the theory of cultural evolution.
Oscar H. Ibarra is a Filipino-American theoretical computer scientist, prominent for work in automata theory, formal languages, design and analysis of algorithms and computational complexity theory. He was a Professor of the Department of Computer Science at the University of California-Santa Barbara until his retirement in 2011. Previously, he was on the faculties of UC Berkeley (1967-1969) and the University of Minnesota (1969-1990). He is currently a Distinguished Professor Emeritus at UCSB.
Deborah A. Joseph is an American computer scientist known for her research in computational geometry, computational biology, and computational complexity theory. She is a professor emeritus of computer science at the University of Wisconsin–Madison.
Nissim Francez is an Israeli professor, emeritus in the computer science faculty at the Technion, and former head of computational linguistics laboratory in the faculty.
Jin-Yi Cai is a Chinese American mathematician and computer scientist. He is a professor of computer science, and also the Steenbock Professor of Mathematical Sciences at the University of Wisconsin–Madison. His research is in theoretical computer science, especially computational complexity theory. In recent years he has concentrated on the classification of computational counting problems, especially counting graph homomorphisms, counting constraint satisfaction problems, and Holant problems as related to holographic algorithms.