Michael Fellows

From Wikipedia, the free encyclopedia
Jump to: navigation, search
For other people of the same name, see Mike Fellows.
Michael Ralph Fellows
Born San Diego, California, US
Residence Australia
Nationality American, Canadian, Australian
Fields
Computer science
Institutions Charles Darwin University, Northern Territory, Australia
Alma mater University of California, San Diego (Ph.D., 1985, Computer Science; M.A.,1982, Mathematics)
Sonoma State University (B.A., 1980, Mathematics)
Doctoral advisor Michael Fredman (mathematician)

Michael Ralph (Mike) Fellows (born June 15, 1952 in Upland, California) is an American computer scientist and Professor at Charles Darwin University, Australia, and Director of the Parameterized Complexity Research Unit (PCRU).

Biography[edit]

Fellows received his BA in Mathematics from Sonoma State University, and at the University of California, San Diego (UCSD) his M.A. in Mathematics in 1982 and in 1985 his Ph.D. in Computer Science with the dissertation Encoding Graphs in Graphs.[1]

Fellows is professor at Charles Darwin University, Australia,[2] and Director of the Parameterized Complexity Research Unit (PCRU).[3] He has taught in the United States, Canada, New Zealand and Australia. In 2007, Fellows was awarded the Alexander von Humboldt Research Award.[4] His German host was Rolf Niedermeier and Mike spent part of 2007 and most of 2008 at the Friedrich-Schiller-Universität in Jena, Germany, working with Rolf Niedermeier. Also in 2007, Mike became one of the first Fellows of the Institute of Advanced Study (Durham), UK[5] and a Fellow of Grey College at the University of Durham. Also he was awarded an Australian Research Council Professorial Fellowship for five years, beginning 2010.[6] In 2014 he became one of ten inaugural fellows of the European Association for Theoretical Computer Science.[7]

He is an Area Editor for the Journal of Computer and System Sciences since 2004, and Advising Editor for the special Section on Parameterized Complexity in the Journal of Computer and System Sciences.[8] He is Associate Editor for ACM Transactions on Algorithms.[9] In 2008 was Guest Editor for a special double issue of The Computer Journal with 15 surveys on Parameterized Complexity.[10] Also he is Guest Editor (with others) for a Special Issue on Parameterized Complexity in the Journal of Combinatorial Optimization to be published in 2010.[11] He is a member of the Steering Committee for the conference series International Workshop on Parameterized and Exact Computation, proceedings published by Springer in Lecture Notes in Computer Science.

In 1999, he married Frances Novak Rosamond, also a scientist, who shares his love of mathematics and adventure.

Work[edit]

Fellows is recognized as one of the founders of parameterized complexity, a complexity framework that uses structure in hard problems for the design and analysis of algorithms for their solution. Parameterized complexity has strong connections to algorithmic engineering, and is increasingly important in fields as diverse as Artificial Intelligence, Cognitive Science, and Bioinformatics. Fellows is also known for his innovative science communication.

Dagstuhl Seminar 12241 Data Reduction and Problem Kernels June 10 – 15, 2012 was the occasion to honour Michael R. Fellows on the Occasion of His 60th Birthday. He was presented with a Springer festschrift: The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated Michael R. Fellows on the Occasion of His 60th Birthday. Editors: Hans L. Bodlaender and Rod Downey and Fedor V. Fomin and Daniel Marx. Springer LNCS 7370, DOI 10.1007/978-3- 642-30891-8_8), 2012.

Mike Fellows has won three major awards in 2014.

1) EATCS Fellow 2014. Mike has been conferred one of the inaugural first 10 EATCS Fellows for "his role in founding the field of parameterized complexity theory, which has become a major subfield of research in theoretical computer science, and for being a leader in computer science education" (.[12] The award will be presented at ICALP.

2) EATCS-NERODE Prize 2014. This award at ALGO/ESA and is for a series of papers on how to establish lower bounds on kernelization. The two papers and prize winners are: On problems without polynomial kernels, Hans Bodlaender, Rodney Downey, Michael Fellows, Danny Hermelin. Journal of Computer and System Sciences 2009. Infeasibility of instance compression and succinct PCPs for NP, Lance Fortnow, Rahul Santhanam, same journal 2011.

3) ABZ International Medal of Honor for Fundamental Contributions to Computer Science Education. This award through ETH-Zurich is for Mike’s outreach to kids and the community. Fellows wrote Computer Science Unplugged! (www.csunplugged.org with New Zealand colleagues Tim Bell (University of Canterbury, NZ) and Ian Witten (Otago University, NZ). activities are the basis of workshops sponsored by Google across the world. They are used in codeweek.au and in curriculum in UK. The book has been translated into 19 languages. It is a global grass-roots movement. Mike and Frances Rosamond give workshops to Aboriginal schools in Australia, India and around the world.

Professor Fellow says, “The activities are based on modern research in computer science and mathematics. These materials can be used to make early education more exciting and engaging,” Woven through Computer Science Unplugged is the importance of story: that presenting math and computing topics through story-telling and drama can captivate children and adults alike, and provides a whole new level of engagement. Mike’s activities are about thinking outside the box, whether sharing the unknowns of computer science and mathematics with elementary school children or running a mathematics event in a park.”

Mike is an Australian Professorial Fellow at Charles Darwin University, Australia. He is Visiting Professor at Royal Holloway University of London. In 2006, he was an inaugural Fellow of the Institute of Advanced Study, Durham University, and at that time a Best Fellow of Grey College. In 2007, Mike received an Alexander von Humboldt Research Award. He collaborates extensively around the world.

Computer Science Unplugged![edit]

Fellow's books Computer Science Unplugged![13] written with Tim Bell and Ian Witten, and This is MEGA-Mathematics!,[14] with Nancy Casey convey sophisticated concepts such as intractability, sorting networks, and cryptography. They have won several science popularization awards, and been translated into languages including Japanese, Korean, Arabic, Hebrew, Chinese, Spanish, Swedish, and German, with more translations underway.

Unplugged! was part of the famous British Fraraday Christmas Lectures in 2008, which was given by Professor Christopher M. Bishop[15] of UK Microsoft Research.

Passion plays about mathematics[edit]

Fellows is also the author of several passion plays about mathematics, with mathematical proofs enacted on-stage, which were performed at the Fringe Theatre in British Columbia.

Publications[edit]

He has published three books and over 150 scientific articles[16][17] Books:

  • 1985. Encoding Graphs in Graphs. Dissertation
  • 1990. Constructive Complexity, with Karl Abrahamson and Michael A. Langston
  • 1992. This is MEGA-Mathematics, with Nancy Casey
  • 1992. Parameterized computational feasibility, with Rod G. Downey
  • 2002. Computer Science Unplugged!, with Tim Bell and Ian Witten,

References[edit]

  1. ^ Michael Fellows on Mathematical Genealogy Project]. Accessed Dec 7, 2012.
  2. ^ Michael Fellows Profile University of Newcastle
  3. ^ PCRU Website Director of the Parameterized Complexity Research Unit under the Division of Research at the University of Newcastle, Australia
  4. ^ 'Fellows Receives Alexander von Humboldt Research Award'
  5. ^ University of Durham, Institute of Advanced Study Laureate of the Institute of Advanced Study, University of Durham
  6. ^ University of Newcastle Announcement Australian Research Council Professorial Fellowship
  7. ^ Aceto, Luca (March 5, 2014), "EATCS Fellows class of 2014 named", Process Algebra Diary .
  8. ^ Vol51 Issue 1, Journal of Computer and Systems Sciences
  9. ^ Editorial Board ACM Transactions on Algorithms
  10. ^ JCSS Editorial Board The Computer Journal, Oxford Journals
  11. ^ IWPEC 2009 International Workshop on Parameterized and Exact Algorithms: IWPEC
  12. ^ http://www.eatcs.org/index.php/eatcs-fellows)
  13. ^ Computer Science Unplugged! website
  14. ^ This is MEGA-Mathematics!
  15. ^ Professor Christopher M. Bishop
  16. ^ Michael Fellows on DBLP
  17. ^ Michael Fellows, ACM Authors

External links[edit]