Ernst Mayr (computer scientist)

Last updated

Ernst W. Mayr
Born (1950-05-18) 18 May 1950 (age 73)
Alma mater Massachusetts Institute of Technology
Technical University of Munich
Scientific career
Fields Computer science, Mathematics
Institutions Stanford University
Technical University of Munich
Goethe University Frankfurt

Ernst Wilhelm Mayr (born 18 May 1950) is a German computer scientist and mathematician. He received the Gottfried Wilhelm Leibniz Prize in 1997 awarded for his contributions to theoretical computer science. [1]

Mayr's research in computer science covers algorithms and complexity theory. He also explores symbolic mathematics/computer algebra and methods in bioinformatics. His principal interests lie in describing and modeling parallel and distributed programs and systems, the design and analysis of efficient parallel algorithms and programming paradigms, the design of algorithm solutions for scheduling and load balancing problems and investigation of their complexity theory. He also explores polynomial ideals and their complexity and algorithms as well as algorithms for searching and analyzing extensive bioinformatic data. [2]

After studying mathematics at Technical University of Munich with a scholarship from the Maximilianeum foundation [3] and computer science at Massachusetts Institute of Technology in Cambridge, Mayr did his doctorate at Technical University of Munich in 1980. In 1982, he became assistant professor of computer science at Stanford University, where he also participated in the Presidential Young Investigator Program. In 1988, he was appointed to the Chair of Theoretical Computer Science at Goethe University Frankfurt. Mayr has held the Chair of Efficient Algorithms at Technical University of Munich since 1993 where he also served as the dean of his faculty from 2000 to 2003. [4] In 1997 he co-founded[ citation needed ] the annual international conference Computer Algebra in Scientific Computing with Vladimir P. Gerdt and served as a general chair from 1998 to 2013.

Related Research Articles

<span class="mw-page-title-main">Gregory Chaitin</span> Argentine-American mathematician

Gregory John Chaitin is an Argentine-American mathematician and computer scientist. Beginning in the late 1960s, Chaitin made contributions to algorithmic information theory and metamathematics, in particular a computer-theoretic result equivalent to Gödel's incompleteness theorem. He is considered to be one of the founders of what is today known as algorithmic complexity together with Andrei Kolmogorov and Ray Solomonoff. Along with the works of e.g. Solomonoff, Kolmogorov, Martin-Löf, and Leonid Levin, algorithmic information theory became a foundational part of theoretical computer science, information theory, and mathematical logic. It is a common subject in several computer science curricula. Besides computer scientists, Chaitin's work draws attention of many philosophers and mathematicians to fundamental problems in mathematical creativity and digital philosophy.

<span class="mw-page-title-main">Stephen Cook</span> American-Canadian computer scientist, contributor to complexity theory

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 emeritus at the University of Toronto, Department of Computer Science and Department of Mathematics.

Computer science is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. One well known subject classification system for computer science is the ACM Computing Classification System devised by the Association for Computing Machinery.

<span class="mw-page-title-main">Richard M. Karp</span> American mathematician

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

<span class="mw-page-title-main">Theoretical computer science</span> Subfield of computer science and mathematics

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, formal language theory, the lambda calculus and type theory.

Computational science, also known as scientific computing, technical computing or scientific computation (SC), is a division of science that uses advanced computing capabilities to understand and solve complex physical problems. This includes

<span class="mw-page-title-main">Nitin Saxena</span> Indian mathematician and computer scientist

Nitin Saxena is an Indian scientist in mathematics and theoretical computer science. His research focuses on computational complexity.

<span class="mw-page-title-main">Friedrich L. Bauer</span> German computer scientist

Friedrich Ludwig "Fritz" Bauer was a German pioneer of computer science and professor at the Technical University of Munich.

<span class="mw-page-title-main">Leslie Valiant</span> British American computer scientist

Leslie Gabriel Valiant is a British American computer scientist and computational theorist. He was born to a chemical engineer father and a translator mother. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".

<span class="mw-page-title-main">Leibniz Prize</span> German research award

The Gottfried Wilhelm Leibniz Prize, or Leibniz Prize, is awarded by the German Research Foundation to "exceptional scientists and academics for their outstanding achievements in the field of research". Since 1986, up to ten prizes have been awarded annually to individuals or research groups working at a research institution in Germany or at a German research institution abroad. It is considered the most important research award in Germany.

<span class="mw-page-title-main">Kurt Mehlhorn</span> German computer scientist (born 1949)

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.

<span class="mw-page-title-main">Yuri Gurevich</span> American computer scientist

Yuri Gurevich, Professor Emeritus at the University of Michigan, is an American computer scientist and mathematician and the inventor of abstract state machines.

<span class="mw-page-title-main">Susanne Albers</span> German theoretical computer scientist

Susanne Albers is a German theoretical computer scientist and professor of computer science at the Department of Informatics of the Technical University of Munich. She is a recipient of the Otto Hahn Medal and the Leibniz Prize.

<span class="mw-page-title-main">Constantinos Daskalakis</span> Greek computer scientist

Constantinos Daskalakis is a Greek theoretical computer scientist. He is a professor at MIT's Electrical Engineering and Computer Science department and a member of the MIT Computer Science and Artificial Intelligence Laboratory. He was awarded the Rolf Nevanlinna Prize and the Grace Murray Hopper Award in 2018.

<span class="mw-page-title-main">Reinhard Wilhelm</span> German computer scientist

Reinhard Wilhelm is a German computer scientist.

Emmerich (Emo) Welzl is a computer scientist known for his research in computational geometry. He is a professor in the Institute for Theoretical Computer Science at ETH Zurich in Switzerland.

<span class="mw-page-title-main">Alan Edelman</span> American mathematician

Alan Stuart Edelman is an American mathematician and computer scientist. He is a professor of applied mathematics at the Massachusetts Institute of Technology (MIT) and a Principal Investigator at the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL) where he leads a group in applied computing. In 2004, he founded a business called Interactive Supercomputing which was later acquired by Microsoft. Edelman is a fellow of American Mathematical Society (AMS), Society for Industrial and Applied Mathematics (SIAM), Institute of Electrical and Electronics Engineers (IEEE), and Association for Computing Machinery (ACM), for his contributions in numerical linear algebra, computational science, parallel computing, and random matrix theory. He is one of the cocreators of the technical programming language Julia.

Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.

<span class="mw-page-title-main">TUM School of Computation, Information and Technology</span>

The TUM School of Computation, Information and Technology (CIT) is a school of the Technical University of Munich, established in 2022 by the merger of three former departments. As of 2022, it is structured into the Department of Mathematics, the Department of Computer Engineering, the Department of Computer Science, and the Department of Electrical Engineering.

References

  1. Leibniz award-winners, Technical University of Munich Leibniz award-winners Archived 29 July 2016 at the Wayback Machine
  2. Ernst W. Mayr at Technical University of Munich.
  3. Scholars of the Maximilianeum from 1969 Archived 4 March 2016 at the Wayback Machine .
  4. 40 Jahre Informatik in Munchen: 1967 – 2007Festschrift Computer Science at Technical University of Munich. Archived 16 June 2011 at the Wayback Machine