Martin Fürer

Department of Computer Science and Engineering
The Pennsylvania State University
111 IST Building
University Park, PA 16802-6822


Office: 346F IST Building
Phone: (814) 863-1857
Dept. Fax: (814) 865-3176
Email: furer AT cse.psu.edu
URL: http://www.cse.psu.edu/~furer




My research Interests:
  • Graph Algorithms
  • Combinatorial and Algebraic Algorithms
  • Approximation Algorithms to Combinatorial Optimization Problems
  • Computational Complexity
  • Randomized and Parallel Algorithms
  • The Graph Isomorphism Problem

  • My Faster Integer Multiplication Algorithm (SIAM J. Comp. 39, 3, pp. 979-1005 (2009)).
    Sicomp subscribers click here.
    An earlier version has appeared in the Proceedings of the 39th ACM STOC 2007 conference,
    pp. 57-66 (Best paper award STOC 2007).
    Article on the Faster Integer Multiplication Algorithm (page 1, 2, 3)
    in the German Newspaper DIE ZEIT Nr. 49, November 27, 2008.

    Some Publications
    I am on the Editorial Board of
    Journal of Graph Algorithms and Applications and
    Information and Computation
    Teaching: 
    Fall 2013:  CMPSC 464, Introduction to the Theory of Computation,  104 Rackley, T R 2:30 PM - 3:45 PM


    Office hours:   T R  4 - 5 pm

    Link to my Graduate Faculty page, and the CSE Theory page
    Thank you for your interest in Internship positions.
    I have no money for such positions and I have stopped responding to the requests individually.