Martin Fürer

Department of Computer Science and Engineering
The Pennsylvania State University
346F IST Building
University Park, PA 16802-6106


Phone: (814) 863-1857
Fax: (814) 865-3176
Email: furer AT cse.psu.edu
URL: http://www.cse.psu.edu/~furer

My research Interests:
  • Graph Algorithms
  • Approximation Algorithms to Combinatorial Optimization Problems
  • Computational Complexity
  • Randomized and Parallel Algorithms
  • The Graph Isomorphism Problem
    • My Faster Integer Mulitplication Algorithm Pdf
    An earlier version has appeared in the Proceedings of the 39th ACM STOC 2007 conference, pp. 57-66.
    Some Publications
    I am on the Editorial Board of the electronic
    Journal of Graph Algorithms and Applications.
    Teaching: Spring 08: CSE/MATH 588 Complexity in Computer Algebra, 
    Office hours
    Link to my Graduate Faculty page, and the CSE Theory page