Martin Fürer
Affiliations: Pennsylvania State University, University Park, USA
According to our database^{1},
Martin Fürer
authored at least 82 papers
between 1976 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org

on cse.psu.edu
On csauthors.net:
Bibliography
2021
CoRR, 2021
Proceedings of the WALCOM: Algorithms and Computation, 2021
Proceedings of the Combinatorial Optimization and Applications, 2021
2020
Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
2019
A Spaceefficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation.
CoRR, 2019
A SpaceEfficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization.
Proceedings of the Computer Science  Theory and Applications, 2019
2018
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
2017
Theor. Comput. Sci., 2017
Theory Comput. Syst., 2017
Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set.
CoRR, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the Algorithms and Complexity  10th International Conference, 2017
Proceedings of the Algorithms and Complexity  10th International Conference, 2017
2016
Encyclopedia of Algorithms, 2016
Proceedings of the Combinatorial Algorithms  27th International Workshop, 2016
2014
Comb. Probab. Comput., 2014
CoRR, 2014
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks.
Algorithmica, 2014
Proceedings of the LATIN 2014: Theoretical Informatics  11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Proceedings of the LATIN 2014: Theoretical Informatics  11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Proceedings of the Combinatorial Optimization  Third International Symposium, 2014
Proceedings of the Computer Science  Theory and Applications, 2014
2013
Theor. Comput. Sci., 2013
CoRR, 2013
2012
J. Comput. Geom., 2012
Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted TreeWidth.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Proceedings of the Fun with Algorithms  6th International Conference, 2012
2011
Proceedings of the Algorithms and Computation  22nd International Symposium, 2011
2010
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded TreeWidth.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
SIAM J. Comput., 2009
Proceedings of the Proceedings Fifth Workshop on Developments in Computational ModelsComputational Models From Nature, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
2007
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007
Proceedings of the Algorithmic Aspects in Information and Management, 2007
2006
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees.
Proceedings of the Computer Science, 2006
2005
Electron. Colloquium Comput. Complex., 2005
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005
2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (01) Matrix.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004
Quadratic Convergence for Scaling of Matrices.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004
2001
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
1999
Discret. Math., 1999
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
1998
Random Struct. Algorithms, 1998
1997
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
1996
Parallel Process. Lett., 1996
Int. J. Found. Comput. Sci., 1996
1995
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
J. Algorithms, 1995
Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity.
Proceedings of the Sixth Annual ACMSIAM Symposium on Discrete Algorithms, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
SIAM J. Discret. Math., 1994
J. Algorithms, 1994
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
1993
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
1992
Comb., 1992
Proceedings of the Algorithm Theory, 1992
O(n log log n)Work Parallel Algorithms for StraightLine Grid Embeddings of Planar Graphs.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992
Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree.
Proceedings of the Third Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1992
1991
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991
1989
IEEE Trans. Computers, 1989
On Completeness and Soundness in Interactive Proof Systems.
Adv. Comput. Res., 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987
1986
Proceedings of the VLSI Algorithms and Architectures, 1986
1985
Proceedings of the Automata, 1985
1984
J. Comput. Syst. Sci., 1984
1983
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems).
Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983
1982
The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth.
Theor. Comput. Sci., 1982
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
1980
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection.
Proceedings of the Automata, 1980
1976
Proceedings of the Komplexität von Entscheidungsproblemen, Ein Seminar, 1976
Proceedings of the Komplexität von Entscheidungsproblemen, Ein Seminar, 1976