Harry Mairson

Harry Mairson

Harry George Mairson is a theoretical computer scientist and Professor of Computer Science in the [http://www.bio.brandeis.edu/volen/ 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. [http://www.brandeis.edu/registrar/bulletin/covers/print20062007/printed2006_2007.pdf Brandeis University Bulletin 2006-2007] ]

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. 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). [http://theory.csail.mit.edu/~nickh/Machtey.html FOCS Best Student Paper Award (Machtey Award)] ] 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.National Science Foundation proposal 0702312] 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.

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.

External links

* [http://www.cs.brandeis.edu/~mairson/ Harry Mairson at Brandeis University]
* [http://www.brandeis.edu/facguide/faculty.php?emplid=ea30cbe920c0b5d91ca520aa10359d76b79027dc Brandeis University Faculty Guide: Harry Mairson]
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/Mairson:Harry_G=.html DBLP: Harry G. Mairson]
* [http://genealogy.math.ndsu.nodak.edu/html/id.phtml?id=100754 The Mathematics Genealogy Project - Harry Mairson]

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Stable marriage problem — In mathematics, the stable marriage problem (SMP) is the problem of finding a stable matching mdash; a matching in which no element of the first matched set prefers an element of the second matched set that also prefers the first element.It is… …   Wikipedia

  • Jeffrey Ullman — Infobox Scientist name = Jeffrey Ullman image width = caption = birth date = Birth date and age|1942|11|22|mf=y birth place = death date = death place = residence = citizenship = American nationality = American ethnicity = field = work… …   Wikipedia

  • Conjunctive query — In database theory, a conjunctive query is a restricted form of first order queries. A large part of queries issued on relational databases can be written as conjunctive queries, and large parts of other first order queries can be written as… …   Wikipedia

  • Konjunktive Anfrage — Konjunktive Anfragen sind eine Einschränkung von Anfragen der Prädikatenlogik und haben eine Reihe an wünschenswerten Eigenschaften, die in der Datenbanktheorie intensiv untersucht worden sind. Viele Anfragen an relationale Datenbanken und damit… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”