Martin Furer

    • 1097 Citations
    • 15 h-Index
    1980 …2019

    Research output per year

    If you made any changes in Pure these will be visible here soon.

    Research Output

    • 1097 Citations
    • 15 h-Index
    • 44 Conference contribution
    • 19 Article
    • 4 Conference article
    • 1 Paper
    Filter
    Article
    2019

    Eigenvalue location in graphs of small clique-width

    Fürer, M., Hoppen, C., Jacobs, D. P. & Trevisan, V., Jan 1 2019, In : Linear Algebra and Its Applications. 560, p. 56-85 30 p.

    Research output: Contribution to journalArticle

    2017

    Efficient computation of the characteristic polynomial of a threshold graph

    Fürer, M., Jan 2 2017, In : Theoretical Computer Science. 657, p. 3-10 8 p.

    Research output: Contribution to journalArticle

    2 Scopus citations

    Space Saving by Dynamic Algebraization Based on Tree-Depth

    Fürer, M. & Yu, H., Aug 1 2017, In : Theory of Computing Systems. 61, 2, p. 283-304 22 p.

    Research output: Contribution to journalArticle

    3 Scopus citations
    2014

    Approximately counting embeddings into random graphs

    Fürer, M. & Kasiviswanathan, S. P., Nov 2 2014, In : Combinatorics Probability and Computing. 23, 6, p. 1028-1056 29 p.

    Research output: Contribution to journalArticle

    1 Scopus citations

    Efficient computation of the characteristic polynomial of a tree and related tasks

    Furer, M., Jan 1 2014, In : Algorithmica. 68, 3, p. 626-642 17 p.

    Research output: Contribution to journalArticle

    5 Scopus citations
    2013

    An exponential time 2-approximation algorithm for bandwidth

    Fürer, M., Gaspers, S. & Kasiviswanathan, S. P., Nov 4 2013, In : Theoretical Computer Science. 511, p. 23-31 9 p.

    Research output: Contribution to journalArticle

    3 Scopus citations
    2010

    On the power of combinatorial and spectral invariants

    Fürer, M., Apr 15 2010, In : Linear Algebra and Its Applications. 432, 9, p. 2373-2380 8 p.

    Research output: Contribution to journalArticle

    3 Scopus citations
    2004
    3 Scopus citations
    1999

    Characterizations of bipartite Steinhaus graphs

    Chang, G. J., DasGupta, B., Dymàček, W. M., Fürer, M., Koerlin, M., Lee, Y. S. & Whaley, T., Mar 28 1999, In : Discrete Mathematics. 199, 1-3, p. 11-25 15 p.

    Research output: Contribution to journalArticle

    4 Scopus citations
    1998

    Algorithms for coloring semi-random graphs

    Subramanian, C. R., Furer, M. & Veni Madhavan, C. E., Jan 1 1998, In : Random Structures and Algorithms. 13, 2, p. 125-158 34 p.

    Research output: Contribution to journalArticle

    7 Scopus citations
    1996

    Parallel edge coloring approximation

    Fürer, M., Jan 1 1996, In : Parallel Processing Letters. 6, 3, p. 321-329 9 p.

    Research output: Contribution to journalArticle

    5 Scopus citations
    1995

    An efficient parallel algorithm for finding hamiltonian cycles in dense directed graphs

    Furer, M. & Raghavachari, B., Jan 1 1995, In : Journal of Algorithms. 18, 2, p. 203-220 18 p.

    Research output: Contribution to journalArticle

    1994

    Approximating the minimum-degree steiner tree to within one of optimal

    Furer, M. & Raghavachari, B., Jan 1 1994, In : Journal of Algorithms. 17, 3, p. 409-423 15 p.

    Research output: Contribution to journalArticle

    134 Scopus citations
    1992

    An optimal lower bound on the number of variables for graph identification

    Cai, J. Y., Fürer, M. & Immerman, N., Dec 1 1992, In : Combinatorica. 12, 4, p. 389-410 22 p.

    Research output: Contribution to journalArticle

    225 Scopus citations
    1989

    AT2-Optimal Galois Field Multiplier for VLSI

    Fürer, M. & Mehlhorn, K., Sep 1989, In : IEEE Transactions on Computers. 38, 9, p. 1333-1336 4 p.

    Research output: Contribution to journalArticle

    5 Scopus citations
    1987
    9 Scopus citations
    1984

    Data structures for distributed counting

    Fürer, M., Apr 1984, In : Journal of Computer and System Sciences. 28, 2, p. 231-243 13 p.

    Research output: Contribution to journalArticle

    14 Scopus citations
    1982

    The complexity of presburger arithmetic with bounded quantifier alternation depth

    Furer, M., Jan 1 1982, In : Theoretical Computer Science. 18, 1, p. 105-111 7 p.

    Research output: Contribution to journalArticle

    24 Scopus citations