Martin Fürer

Cited by

	All	Since 2019
Citations	3769	1114
h-index	24	13
i10-index	47	18

260

130

195

1987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202416 15 14 21 18 35 30 46 59 51 71 51 59 39 52 48 55 56 58 90 117 130 154 119 175 118 178 132 130 152 139 147 164 151 180 196 244 179

Public access

View all

5 articles

1 article

available

not available

Based on funding mandates

Co-authors

Shiva KasiviswanathanAmazon Machine LearningVerified email at amazon.com
Jin-Yi CaiUniversity of Wisconsin - MadisonVerified email at cs.wisc.edu
Neil ImmermanCollege of Computer and Information Sciences, UMass, AmherstVerified email at cs.umass.edu
Stathis (Efstathios) ZachosCS Professor, NTUAVerified email at cs.ntua.gr
Mahdi BelbasiPh.D.Verified email at psu.edu
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Carlos HoppenInstituto de Matemática e Estatística, Universidade Federal do Rio Grande do SulVerified email at ufrgs.br
Vilmar TrevisanProfessor of Mathematics, UFRGSVerified email at mat.ufrgs.br
Xin HeProfessor of Computer Science and Engineering, University at BuffaloVerified email at buffalo.edu
Alexander ZelikovskyDistinguished University Professor at Georgia State UniversityVerified email at gsu.edu
David P. JacobsProfessor Emeritus of Computer Science, Clemson UniversityVerified email at clemson.edu
Bhaskar DasGuptaProfessor of Computer Science, University of Illinois at ChicagoVerified email at uic.edu
Donald BeaverIndependent ScholarVerified email at post.harvard.edu
kashyap dixitpennsylvania state university, iit kanpur, ibm research, AmazonVerified email at cse.psu.edu
Webb MillerPenn State University, UC Santa Barbara, ArizonaVerified email at bx.psu.edu
Aris PagourtzisNational Technical University of AthensVerified email at cs.ntua.gr
Yishay MansourTel Aviv UniversityVerified email at tauex.tau.ac.il
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il

Martin Fürer

Professor of Computer Science and Engineering, Pennsylvania State University

Verified email at cse.psu.edu - Homepage

Algorithms and Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	834	1992
Faster Integer Multiplication M Fürer Proceedings of the Thirty-Ninth Symposium on Theory of Computing, 57-66, 2007	630	2007
Approximating the minimum-degree Steiner tree to within one of optimal M Furer, B Raghavachari Journal of Algorithms 17 (3), 409-423, 1994	277	1994
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	219	1997
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	182	1992
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	147	1989
Approximating maximum independent set in bounded degree graphs P Berman, M Fürer Proceedings of the fifth annual ACM-SIAM Symposium on discrete algorithms …, 1994	135	1994
Algorithms for Counting 2-Sat Solutions and Colorings with Applications M Fürer, SP Kasiviswanathan Algorithmic Aspects in Information and Management: Third International …, 2007	78	2007
Probabilistic quantifiers vs. distrustful adversaries S Zachos, M Furer International Conference on Foundations of Software Technology and …, 1987	73	1987
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems) M Fürer Logic and Machines: Decision Problems and Complexity: Proceedings of the …, 1984	69	1984
On the combinatorial power of the Weisfeiler-Lehman algorithm M Fürer International Conference on Algorithms and Complexity, 260-271, 2017	62	2017
An NC approximation algorithm for minimum degree spanning tree problem M Furer Proc. of the 28th Annual Allerton Conf. on Communication, Control and …, 1990	55	1990
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	48	1983
The complexity of Presburger arithmetic with bounded quantifier alternation depth M Fürer Theoretical Computer Science 18 (1), 105-111, 1982	47	1982
A faster algorithm for finding maximum independent sets in sparse graphs M Fürer LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, Valdivia …, 2006	45	2006
Weisfeiler-Lehman refinement requires at least a linear number of iterations M Fürer Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001	44	2001
The complexity of the inequivalence problem for regular expressions with intersection M Fürer International Colloquium on Automata, Languages, and Programming, 234-245, 1980	44	1980
The tight deterministic time hierarchy M Fürer Proceedings of the fourteenth annual ACM symposium on Theory of computing, 8-16, 1982	41	1982
Approximating the-set packing problem by local improvements M Fürer, H Yu International Symposium on Combinatorial Optimization, 408-420, 2014	39	2014
Improved hardness results for approximating the chromatic number M Furer Proceedings of IEEE 36th Annual Foundations of Computer Science, 414-421, 1995	39	1995

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors