fbpx
Wikipedia

Martin Fürer

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]

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. ^ . Archived from the original on 2023-08-30.
  6. ^ . Archived from the original on 2023-05-26.


martin, fürer, this, biography, living, person, relies, much, references, primary, sources, please, help, adding, secondary, tertiary, sources, contentious, material, about, living, persons, that, unsourced, poorly, sourced, must, removed, immediately, especia. This biography of a living person relies too much on references to primary sources Please help by adding secondary or tertiary sources Contentious material about living persons that is unsourced or poorly sourced must be removed immediately especially if potentially libelous or harmful Find sources Martin Furer news newspapers books scholar JSTOR August 2023 Learn how and when to remove this template message Martin Furer 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 editOne of Furer s notable results is his fast integer multiplication algorithm STOC presented in 2007 and published in 2009 Furer 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 Selected publications editFurer Martin 2009 Faster Integer Multiplication SIAM Journal on Computing vol 39 Society for Industrial and Applied Mathematics SIAM pp 979 1005 doi 10 1137 070711761References edit ACM SIGACT STOC Best Paper Award Furer Martin Martin Furer s Home Page Penn State Retrieved 2023 09 07 Martin Furer at the Mathematics Genealogy Project EECS Directory Penn State Engineering Journal of Graph Algorithms and Applications Archived from the original on 2023 08 30 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 vte Retrieved from https en wikipedia org w index php title Martin Furer amp oldid 1188804742, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.