Mario Szegedy

Dikutip oleh

	Semua	Sejak 2020
Kutipan	15336	3686
indeks-h	43	25
indeks-i10	81	50

800

400

200

600

1991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202538 91 134 236 259 246 219 264 203 206 218 258 330 349 474 497 593 506 539 564 504 537 575 596 543 610 550 552 674 670 642 670 770 791 140

Akses publik

Lihat semua

13 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Noga AlonPrinceton University and Tel Aviv UniversityEmail yang diverifikasi di tau.ac.il
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityEmail yang diverifikasi di cs.harvard.edu
Sanjeev AroraProfessor of Computer Science, Princeton UniversityEmail yang diverifikasi di princeton.edu
Yossi MatiasGoogleEmail yang diverifikasi di tau.ac.il
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestEmail yang diverifikasi di cs.elte.hu
Lance FortnowIllinois Institute of TechnologyEmail yang diverifikasi di iit.edu
Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT SingaporeEmail yang diverifikasi di liafa.univ-paris-diderot.fr
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemEmail yang diverifikasi di cs.huji.ac.il
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityEmail yang diverifikasi di post.tau.ac.il
Robert SpalekundisclosedEmail yang diverifikasi di ucw.cz
Leonid A. LevinEmail yang diverifikasi di bu.edu
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestEmail yang diverifikasi di renyi.hu
Ilan NewmanProfessor of Computer Science, University of HaifaEmail yang diverifikasi di cs.haifa.ac.il
Magnús M. HalldórssonProfessor of Computer Science, Reykjavik UniversityEmail yang diverifikasi di ru.is
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyEmail yang diverifikasi di igi.tugraz.at
Gyorgy Turan University of Illinois at Chicago, and Hungarian Academy of SciencesEmail yang diverifikasi di uic.edu

Ikuti

Mario Szegedy

Professor of Computer Science, Rutgers University

Email yang diverifikasi di cs.rutgers.edu - Beranda

Complexity Theory Combinatorics Quantum Computing Geometry


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
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	3195	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	2597	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	877	1991
Quantum speed-up of Markov chain based algorithms M Szegedy 45th Annual IEEE symposium on foundations of computer science, 32-41, 2004	799	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	576	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	487	2007
Efficient testing of large graphs N Alon, E Fischer, M Krivelevich, M Szegedy Combinatorica 20 (4), 451-476, 2000	480	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	198	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	180	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

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama