Martin Fürer
Martin Fürer
Professor of Computer Science and Engineering, Pennsylvania State University
Verified email at cse.psu.edu - Homepage
Title
Cited by
Cited by
Year
Faster Integer Multiplication
M Fürer
Proceedings of the Thirty-Ninth Symposium on Theory of Computing, 57-66, 2007
5282007
An optimal lower bound on the number of variables for graph identification
JY Cai, M Fürer, N Immerman
Combinatorica 12 (4), 389-410, 1992
5091992
Approximating the minimum-degree Steiner tree to within one of optimal
M Furer, B Raghavachari
Journal of Algorithms 17 (3), 409-423, 1994
2411994
Approximation of k-set cover by semi-local optimization
R Duh, M Fürer
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
1981997
Approximating the minimum degree spanning tree to within one from the optimal degree
M Fürer, B Raghavachari
Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms …, 1992
1581992
On completeness and soundness in interactive proof systems
M Furer, O Goldreich, Y Mansour, M Sipser, S Zachos
Advances in Computing Research 5, 429-442, 1989
1151989
Approximating Maximum Independent Set in Bounded Degree Graphs.
P Berman, M Fürer
Soda 94, 365-371, 1994
1101994
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
M Fürer, SP Kasiviswanathan
International Conference on Algorithmic Applications in Management, 47-57, 2007
682007
Probabilistic quantifiers vs. distrustful adversaries
S Zachos, M Furer
International Conference on Foundations of Software Technology and …, 1987
641987
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)
M Fürer
Symposium on Recursive Combinatorics, 312-319, 1983
541983
An NC approximation algorithm for minimum degree spanning tree problem
M FURER
Proc. of the 28th Annual Allerton Conf. on Communication, Control and …, 1990
531990
The complexity of Presburger arithmetic with bounded quantifier alternation depth
M Fürer
Theoretical Computer Science 18 (1), 105-111, 1982
421982
A faster algorithm for finding maximum independent sets in sparse graphs
M Fürer
Latin American Symposium on Theoretical Informatics, 491-501, 2006
392006
The complexity of the inequivalence problem for regular expressions with intersection
M Fürer
International Colloquium on Automata, Languages, and Programming, 234-245, 1980
391980
Improved hardness results for approximating the chromatic number
M Furer
Proceedings of IEEE 36th Annual Foundations of Computer Science, 414-421, 1995
381995
Normal forms for trivalent graphs and graphs of bounded valence
M Fürer, W Schnyder, E Specker
Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983
371983
The tight deterministic time hierarchy
M Fürer
Proceedings of the fourteenth annual ACM symposium on Theory of computing, 8-16, 1982
371982
An exponential time 2-approximation algorithm for bandwidth
M Fürer, S Gaspers, SP Kasiviswanathan
International Workshop on Parameterized and Exact Computation, 173-184, 2009
292009
Alternation and the Ackermann case of the decision problem
M Fürer
L’Enseignement Math 27, 137-162, 1981
291981
The power of randomness for communication complexity
M Furer
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
261987
The system can't perform the operation now. Try again later.
Articles 1–20