Martin Fürer

Citado por

	Total	Desde 2019
Citas	3819	1160
Índice h	24	13
Índice i10	47	18

260

130

195

1987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202416 15 14 21 18 35 30 46 59 51 71 51 60 39 52 48 55 56 58 90 117 130 154 119 175 118 177 133 130 152 139 148 164 152 182 197 242 223

Acceso público

Ver todo

5 artículos

1 artículo

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Shiva KasiviswanathanAmazon Machine LearningDirección de correo verificada de amazon.com
Jin-Yi CaiUniversity of Wisconsin - MadisonDirección de correo verificada de cs.wisc.edu
Neil ImmermanCollege of Computer and Information Sciences, UMass, AmherstDirección de correo verificada de cs.umass.edu
Stathis (Efstathios) ZachosCS Professor, NTUADirección de correo verificada de cs.ntua.gr
Mahdi BelbasiPh.D.Dirección de correo verificada de psu.edu
Serge GaspersProfessor, UNSW Sydney, AustraliaDirección de correo verificada de cse.unsw.edu.au
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusDirección de correo verificada de mpi-inf.mpg.de
Carlos HoppenInstituto de Matemática e Estatística, Universidade Federal do Rio Grande do SulDirección de correo verificada de ufrgs.br
Vilmar TrevisanProfessor of Mathematics, UFRGSDirección de correo verificada de mat.ufrgs.br
Xin HeProfessor of Computer Science and Engineering, University at BuffaloDirección de correo verificada de buffalo.edu
Alexander ZelikovskyDistinguished University Professor at Georgia State UniversityDirección de correo verificada de gsu.edu
David P. JacobsProfessor Emeritus of Computer Science, Clemson UniversityDirección de correo verificada de clemson.edu
Bhaskar DasGuptaProfessor of Computer Science, University of Illinois at ChicagoDirección de correo verificada de uic.edu
Donald BeaverIndependent ScholarDirección de correo verificada de post.harvard.edu
kashyap dixitpennsylvania state university, iit kanpur, ibm research, AmazonDirección de correo verificada de cse.psu.edu
Webb MillerPenn State University, UC Santa Barbara, ArizonaDirección de correo verificada de bx.psu.edu
Aris PagourtzisNational Technical University of AthensDirección de correo verificada de cs.ntua.gr
Yishay MansourTel Aviv UniversityDirección de correo verificada de tauex.tau.ac.il
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceDirección de correo verificada de weizmann.ac.il

Seguir

Martin Fürer

Professor of Computer Science and Engineering, Pennsylvania State University

Dirección de correo verificada de cse.psu.edu - Página principal

Algorithms and Computational Complexity


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	858	1992
Faster Integer Multiplication M Fürer Proceedings of the Thirty-Ninth Symposium on Theory of Computing, 57-66, 2007	637	2007
Approximating the minimum-degree Steiner tree to within one of optimal M Furer, B Raghavachari Journal of Algorithms 17 (3), 409-423, 1994	279	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	136	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	74	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	63	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
Weisfeiler-Lehman refinement requires at least a linear number of iterations M Fürer Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001	47	2001
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
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
Approximating the-set packing problem by local improvements M Fürer, H Yu International Symposium on Combinatorial Optimization, 408-420, 2014	41	2014
The tight deterministic time hierarchy M Fürer Proceedings of the fourteenth annual ACM symposium on Theory of computing, 8-16, 1982	41	1982
Alternation and the Ackermann case of the decision problem M Fürer L’Enseignement Math 27, 137-162, 1981	41	1981

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores