Martin Fürer

Martin Fürer is a Swiss Computer Scientist and a professor of Computer Science at Pennsylvania State University. His main research is on Graph Theory Algorithms, Approximation Algorithms, Fixed Parameter Tractable Algorithms, and Computational Complexity. He is mostly known for his work on Fast Integer Multiplication. He obtained his PhD in Mathematics from ETH Zurich in 1978^[1] and has been a faculty member at Pennsylvania State University since 1987.

References

P ≟ NP

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

This article "Martin Fürer" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Martin Fürer. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.

This page exists already on Wikipedia.