Martin Fürer Explained

Martin Fürer is a Swiss Computer Scientist and a professor of Computer Science at Pennsylvania State University. He is mostly known for his work on fast integer multiplication.

Research and career

One of Fürer's notable results is his fast integer multiplication algorithm STOC presented in 2007 and published in 2009 .[1] His main research is on Graph Theory Algorithms, Approximation Algorithms, Fixed Parameter Tractable Algorithm, and Computational Complexity.[2]

He obtained his PhD in Mathematics from ETH Zurich in 1978 under supervision of Ernst P. Specker and has been a faculty member at Pennsylvania State University since 1987.[3] He is on the editorial board of Journal of Graph Algorithms and Applications[4] and Information and Computation.[5]

Notes and References

  1. Web site: ACM SIGACT - STOC Best Paper Award .
  2. Web site: Martin Furer's Home Page . Martin . Fürer . Penn State . 2023-09-07.
  3. Web site: EECS Directory | Penn State Engineering .
  4. Web site: https://web.archive.org/web/20230830040809/https://jgaa.info/. 2023-08-30. Journal of Graph Algorithms and Applications.
  5. Web site: Editorial board - Information and Computation. https://web.archive.org/web/20230526175222/https://www.sciencedirect.com/journal/information-and-computation/about/editorial-board. 2023-05-26.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Martin Fürer".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2025, A B Cryer, All Rights Reserved. Cookie policy.