Márió Szegedy - Concepedia

Author

Márió Szegedy

Rutgers, The State University of New Jersey

Also Known As

M SZEGEDY, M. Szegedy, Mario Szegedy, Mittal, Rajat, Márió Szegedy, Richter, Peter C. (Peter Courtland), Szegedy, M., Szegedy, Mario

157

Publications

11.1K

Citations

H-Index

Concepts

All Affiliations

Rutgers, The State University of New Jersey AT&T (United States)University of Chicago Tel Aviv University Nokia (United States)

About

Márió Szegedy is an author at Rutgers, The State University of New Jersey specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	30	48	9K
2	Natural Sciences	8	8	425
3	Education	5	5	567
4	Business	3	3	120
5	Arts	1	1	72

Márió Szegedy

Publications

10.5K

Citations

H-Index

Page 1

	Year	Citations
Proof verification and the hardness of approximation problems Sanjeev Arora, Carsten Lund, Rajeev Motwani, Journal of the ACM Computational Complexity TheoryEngineeringMembership ProofsVerificationComputational Complexity	1998	1.4K
The Space Complexity of Approximating the Frequency Moments Noga Alon, Yossi Matias, Márió Szegedy Journal of Computer and System Sciences EngineeringInformation TheoryKolmogorov ComplexitySpace ComplexityComputational Complexity	1999	1.2K
The space complexity of approximating the frequency moments Noga Alon, Yossi Matias, Márió Szegedy Computational Complexity TheoryEngineeringInformation TheoryFrequency MomentsKolmogorov Complexity	1996	840
Proof verification and hardness of approximation problems Sanjeev Arora, Carsten Lund, R. Motwani, Computational Complexity TheoryEngineeringVerificationComputational ComplexityRandom Bits	1992	741
Checking computations in polylogarithmic time László Babai, Lance Fortnow, Leonid A. Levin, Computational Complexity TheoryEngineeringVerificationComputer-aided VerificationComputational Complexity	1991	617
Quantum Speed-Up of Markov Chain Based Algorithms Márió Szegedy Spectral TheoryQuantum ScienceEngineeringQuantum ComputingQuantum Optimization Algorithm	2004	607
Interactive proofs and the hardness of approximating cliques Uriel Feige, Shafi Goldwasser, László Lovász, Journal of the ACM EngineeringVerificationAutomated ProofComputational ComplexityFormal Verification	1996	517
On the degree of boolean functions as real polynomials Noam Nisan, Márió Szegedy Computational Complexity Circuit ComplexityBoolean FunctionReal Algebraic GeometryBoolean Functions	1994	401
Approximating clique is almost NP-complete Uriel Feige, S. Goldwasser, László Lovász, Mathematical ProgrammingEngineeringNetwork AnalysisEducationComputational Complexity	2002	397
Quantum Algorithms for the Triangle Problem Frédéric Magniez, Miklós Sántha, Márió Szegedy SIAM Journal on Computing EngineeringComputational ComplexityQuantum EngineeringQuantum ComputingTriangle Problem	2007	319

Page 1