Mario Szegedy

Citeras av

	Alla	Sedan 2020
Citat	15302	3655
h-index	43	25
i10-index	81	50

800

400

200

600

1991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202538 91 134 236 259 246 219 264 204 206 218 257 330 349 473 498 592 505 540 563 504 537 575 596 543 610 549 553 673 670 643 669 771 793 107

Offentlig åtkomst

Visa alla

13 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Noga AlonPrinceton University and Tel Aviv UniversityVerifierad e-postadress på tau.ac.il
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerifierad e-postadress på cs.harvard.edu
Sanjeev AroraProfessor of Computer Science, Princeton UniversityVerifierad e-postadress på princeton.edu
Yossi MatiasGoogleVerifierad e-postadress på tau.ac.il
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerifierad e-postadress på cs.elte.hu
Lance FortnowIllinois Institute of TechnologyVerifierad e-postadress på iit.edu
Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT SingaporeVerifierad e-postadress på liafa.univ-paris-diderot.fr
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerifierad e-postadress på cs.huji.ac.il
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityVerifierad e-postadress på post.tau.ac.il
Robert SpalekundisclosedVerifierad e-postadress på ucw.cz
Leonid A. LevinVerifierad e-postadress på bu.edu
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestVerifierad e-postadress på renyi.hu
Ilan NewmanProfessor of Computer Science, University of HaifaVerifierad e-postadress på cs.haifa.ac.il
Magnús M. HalldórssonProfessor of Computer Science, Reykjavik UniversityVerifierad e-postadress på ru.is
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyVerifierad e-postadress på igi.tugraz.at
Gyorgy Turan University of Illinois at Chicago, and Hungarian Academy of SciencesVerifierad e-postadress på uic.edu

Följ

Mario Szegedy

Professor of Computer Science, Rutgers University

Verifierad e-postadress på cs.rutgers.edu - Startsida

Complexity Theory Combinatorics Quantum Computing Geometry


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Proof verification and the hardness of approximation problems S Arora, C Lund, R Motwani, M Sudan, M Szegedy Journal of the ACM (JACM) 45 (3), 501-555, 1998	3190	1998
The space complexity of approximating the frequency moments N Alon, Y Matias, M Szegedy Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996	2591	1996
Checking computations in polylogarithmic time L Babai, L Fortnow, LA Levin, M Szegedy Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991	875	1991
Quantum speed-up of Markov chain based algorithms M Szegedy 45th Annual IEEE symposium on foundations of computer science, 32-41, 2004	796	2004
Approximating clique is almost NP-complete U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991	632	1991
Interactive proofs and the hardness of approximating cliques U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy Journal of the ACM (JACM) 43 (2), 268-292, 1996	574	1996
Threshold circuits of bounded depth A Hajnal, W Maass, P Pudlák, M Szegedy, G Turán Journal of Computer and System Sciences 46 (2), 129-154, 1993	526	1993
On the degree of Boolean functions as real polynomials N Nisan, M Szegedy Computational complexity 4, 301-313, 1994	488	1994
Quantum algorithms for the triangle problem F Magniez, M Santha, M Szegedy SIAM Journal on Computing 37 (2), 413-424, 2007	485	2007
Efficient testing of large graphs N Alon, E Fischer, M Krivelevich, M Szegedy Combinatorica 20 (4), 451-476, 2000	478	2000
Tracking join and self-join sizes in limited storage N Alon, PB Gibbons, Y Matias, M Szegedy Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 1999	371	1999
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs L Babai, N Nisant, M Szegedy Journal of Computer and System Sciences 45 (2), 204-232, 1992	329	1992
Regular languages are testable with a constant number of queries N Alon, M Krivelevich, I Newman, M Szegedy SIAM Journal on Computing 30 (6), 1842-1862, 2001	197	2001
Applications of the crossing number J Pach, F Shahrokhi, M Szegedy Proceedings of the tenth annual symposium on Computational geometry, 198-202, 1994	193	1994
Quantum query complexity of state conversion T Lee, R Mittal, BW Reichardt, R Špalek, M Szegedy 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 344-353, 2011	179	2011
Multiparty protocols and logspace-hard pseudorandom sequences L Babai, N Nisan, M Szegedy Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989	145	1989
Classical simulation of quantum supremacy circuits C Huang, F Zhang, M Newman, J Cai, X Gao, Z Tian, J Wu, H Xu, H Yu, ... arXiv preprint arXiv:2005.06787, 2020	144	2020
Lower bounds for on-line graph coloring MM Halldórsson, M Szegedy Theoretical Computer Science 130 (1), 163-174, 1994	129	1994
On the degree of Boolean functions as real polynomials N Nisan, M Szegedy Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992	124	1992
Public vs. private coin flips in one round communication games I Newman, M Szegedy Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996	121	1996

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare