Márió Szegedy

Publications

10.5K

Citations

H-Index

1986

Active since

Affiliations

Rutgers, The State University of New Jersey(Current)

AT&T (United States)

University of Chicago

Tel Aviv University

Nokia (United States)

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

Top concepts

EngineeringComputer ScienceComputational ComplexityDiscrete MathematicsGraph TheoryCombinatorial OptimizationQuantum ScienceQuantum ComputingQuantum EntanglementQuantum Algorithms

Publications per year

1986–2021

Publications

Proof verification and the hardness of approximation problems

Sanjeev Arora, Carsten Lund, Rajeev Motwani et al. · Journal of the ACM · 1998 · 1.4K citations · Full text

Computational Complexity Theory, Engineering, Membership Proofs +17

The Space Complexity of Approximating the Frequency Moments

Noga Alon, Yossi Matias, Márió Szegedy · Journal of Computer and System Sciences · 1999 · 1.2K citations

Engineering, Information Theory, Kolmogorov Complexity +6

The space complexity of approximating the frequency moments

Noga Alon, Yossi Matias, Márió Szegedy · 1996 · 840 citations

Computational Complexity Theory, Engineering, Information Theory +14

Proof verification and hardness of approximation problems

Sanjeev Arora, Carsten Lund, R. Motwani et al. · 1992 · 741 citations

Computational Complexity Theory, Engineering, Verification +17

Checking computations in polylogarithmic time

László Babai, Lance Fortnow, Leonid A. Levin et al. · 1991 · 617 citations · Full text

Computational Complexity Theory, Engineering, Verification +16

Rows per page

1–5 of 70