Biography:Martin Grohe

From HandWiki
Short description: German mathematician and computer scientist

Martin Grohe (born 1967)[1] is a German mathematician and computer scientist known for his research on parameterized complexity, mathematical logic, finite model theory, the logic of graphs, database theory, and descriptive complexity theory. He is a University Professor of Computer Science at RWTH Aachen University, where he holds the Chair for Logic and Theory of Discrete Systems.[2]

Education

Grohe earned his doctorate (dr. rer. nat.) at the University of Freiburg in 1994. His dissertation, The Structure of Fixed-Point Logics, was supervised by Heinz-Dieter Ebbinghaus.[3] After postdoctoral research at the University of California, Santa Cruz and Stanford University, he earned his habilitation at the University of Freiburg in 1998.[4]

Books

Grohe is the author of Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic 47, Cambridge University Press, 2017).[5] In 2011, Grohe and Johann A. Makowsky published as editors the 558th proceedings of the AMS-ASL special session on Model Theoretic Methods in Finite Combinatorics, which was held on January 5-8 2009 in Washington, DC. With Jörg Flum, he is the co-author of Parameterized Complexity Theory (Springer, 2006).[6]

  • Grohe, Martin (17 August 2017). Descriptive Complexity, Canonisation, and Definable Graph Structure Theory. Cambridge University Press. doi:10.1017/9781139028868. ISBN 978-1-107-01452-7. 
  • Grohe, Martin; Makowsky, Johann A. (2011). Model Theoretic Methods in Finite Combinatorics: AMS-ASL Joint Special Session, January 5-8, 2009, Washington, DC. 558. Washington, DC: American Mathematical Soc.. ISBN 978-0-8218-4943-9. 
  • Flum, Jörg; Grohe, M. (2006). Parameterized complexity theory. Berlin: Springer. ISBN 978-3-540-29953-0. OCLC 262692167. 

Recognition

Grohe won the Heinz Maier–Leibnitz Prize awarded by the German Research Foundation in 1999.[4] He was elected as an ACM Fellow in 2018 for "contributions to logic in computer science, database theory, algorithms, and computational complexity".[7]

References

  1. Birth year from German National Library catalog entry, retrieved 2018-12-08.
  2. Dr. rer. nat., Universitätsprofessor Martin Grohe, RWTH Aachen University, http://www.lics.rwth-aachen.de/cms/LICS/Der-Lehrstuhl/Team/Dozierende/~ocwf/Martin-Grohe/?lidx=1&allou=1, retrieved 2018-12-08 
  3. Martin Grohe at the Mathematics Genealogy Project
  4. 4.0 4.1 Martin Grohe, 1999 Heinz Maier-Leibnitz Prize, University of Freiburg, https://uni-freiburg.de/university/university-at-a-glance/outstanding-achievements/heinz-maier-leibnitz-prize/martin-grohe/, retrieved 2021-08-08 
  5. Review of Descriptive Complexity, Canonisation, and Definable Graph Structure Theory:
    • Michel, Pascal, "none", Mathematical Reviews 
    • Segoufin, Luc (2017), "none", The Bulletin of Symbolic Logic 23 (4): 493–494, doi:10.1017/bsl.2018.1 
  6. Reviews of Parameterized Complexity Theory:
  7. ACM Recognizes 2017 Fellows for Making Transformative Contributions and Advancing Technology in the Digital Age, Association for Computing Machinery, December 11, 2017, https://www.acm.org/media-center/2017/december/fellows-2017 

External links