Michael Fellows
Michael Ralph Fellows (born June 15, 1952 in Upland , California ) is an American - Australian - Canadian mathematician and computer scientist .
biography
Fellows studied mathematics at Sonoma State University with a bachelor's degree and earned his master's degree from the University of California at San Diego , where he received his doctorate in 1985 under Michael Fredman ( Encoding graphs in graphs ). He was from 1985 Assistant Professor at Washington State University , from 1986 Assistant Professor at the University of New Mexico and from 1987 Associate Professor at the University of Idaho . In 1990 he became Associate Professor and in 1995 Professor at the University of Victoria and in 1999 Reader in Theoretical Computer Science at Victoria University of Wellington . From 2001 to 2010 he was Professor of Computer Science at the University of Newcastle and from 2010 to 2015 Professor ( Australian Professoral Fellow ) at Charles Darwin University and has been Professor at Bergen University since 2016 ( Elite Professor of Computer Science).
In 2014 he became a Fellow of the European Association for Theoretical Computer Science . In 2007 he received a Humboldt Research Award with which he was with Rolf Niedermeier in Jena. In 2007 he became a Fellow of the Institute for Advanced Study in Durham. He is an Honorary Fellow of the Royal Society of New Zealand .
He is particularly concerned with complexity theory and founded the field of parameterized complexity and parameterized algorithms with Rod Downey , which he applies to big data problems. He also published on computer science education. As a mathematician, he studied graph minors and, with Neal Koblitz, studied cryptography , including Kid Krypto for teaching children based on various combinatorial problems.
In 2014 he received the Nerode Prize of the European Association for Theoretical Computer Science with Hans Bodlaender, Rod Downey, Danny Hermelin, Lance Fortnow and Rahul Santhanam. In the two excellent papers, the authors show that a large class of FPT problems do not have a polynomial kernel.
In 1999 Michael Fellows married the computer scientist Frances A. Rosamond .
In addition to the US citizenship, he has those of Australia and Canada.
Fonts
- with Rod Downey: Parametrized Complexity , Springer, Monographs in Computer Science 1999
- with R. Downey: Fixed-parameter tractability and completeness , 4 parts, part 1 (Basic Results), SIAM Journal on Computing, Volume 24, 1995, pp. 873–921, part 2 (The completeness for W [1]), Theoretical Computer Science, Volume 141, 1995, pp. 109-131, Part 3 (Some structural aspects of the W-Hierarchy) in: K. Ambos-Spies, S. Homer, U. Schoning (Eds.), Complexity theory. Current Research, Cambridge University Press 1993, pp. 166-191, Part 4 (On Completeness for W [P] and PSPACE analogues) with Abrahamson, Annals of Pure and Applied Logic, Volume 73, 1995, pp. 235-276
- with Nancy Casey: This is MEGA-Mathematics , Los Alamos National Labs 1992
- with Tim Bell, Ian Witten: Computer Science Unplugged ... offline activities and games for all ages , 1996 (there is also a Teachers Edition), pdf , version 2015, pdf
literature
- The Multivariate Algorithmic Revolution and Beyond, Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, Vol. 7370 Subseries: Theoretical Computer Science and General Issues (Bodlaender, HL; Downey, R .; Fomin , FV; Marx, D. (Eds.)), Springer 2012
Web links
Individual evidence
- ↑ Michael Fellows in the Mathematics Genealogy Project (English)
- ^ Fellows, Koblitz, Kid Krypto, Crypto 92
- ↑ 2014 EATCS-IPEC Nerode Prize
| personal data | |
|---|---|
| SURNAME | Fellows, Michael |
| ALTERNATIVE NAMES | Fellows, Michael Ralph (full name) |
| BRIEF DESCRIPTION | American-Australian-Canadian computer scientist and mathematician |
| DATE OF BIRTH | June 15, 1952 |
| PLACE OF BIRTH | Upland , California |