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

My research Interests
  • Graph Algorithms and Algebraic Graph Theory
  • Width Parameters and Fixed Parameter Tractability
  • Combinatorial and Algebraic Algorithms
  • Approximation Algorithms to Combinatorial Optimization Problems
  • Computational Complexity
  • Randomized and Parallel Algorithms
  • The Graph Isomorphism Problem

  • Some of my most significant research results
    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
    Fall 2016: CSE 597.2, Graphs of Bounded Widths - Theory and Algorithms, EE West 105, TR 9:05 - 10:20 AM
    2015/2016: Sabbatical. (COPPE, Univ. Fed. do Rio de Janeiro; Math, Unive. Fed. do Rio Grande do Sul; Computer Science, ETH-Zürich)
    Spring 2015: Cmpsc 464, Introduction to the Theory of Computation, 102 Leonhard, TR 2:30 - 3:45 PM

    Office hours:   Tuesday, Thursday  11 - 12.

    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.