Martin Fürer

Add links
From Wikipedia, the free encyclopedia

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[edit]

One of Fürer's notable results is his fast integer multiplication algorithm STOC presented in 2007 and published in 2009 (Fürer (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[3] and has been a faculty member at Pennsylvania State University since 1987.[4] He is on the editorial board of Journal of Graph Algorithms and Applications[5] and Information and Computation.[6] He is listed as a teacher for the CMPSC 464 course at Penn State in Fall 2024.

Selected publications[edit]

  • Fürer, Martin (2009), "Faster Integer Multiplication", SIAM Journal on Computing, vol. 39, Society for Industrial and Applied Mathematics (SIAM), pp. 979–1005, doi:10.1137/070711761

References[edit]

  1. ^ "ACM SIGACT - STOC Best Paper Award".
  2. ^ Fürer, Martin. "Martin Furer's Home Page". Penn State. Retrieved 2023-09-07.
  3. ^ Martin Fürer at the Mathematics Genealogy Project
  4. ^ "EECS Directory | Penn State Engineering".
  5. ^ "Journal of Graph Algorithms and Applications". Archived from the original on 2023-08-30.
  6. ^ "Editorial board - Information and Computation". Archived from the original on 2023-05-26.


P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Martin_Fürer&oldid=1205106533"