Márió Szegedy
Rutgers Sexual and Reproductive Health and Rights(NL)
Publications by Year
Research Areas
Complexity and Algorithms in Graphs, Quantum Computing Algorithms and Architecture, Advanced Graph Theory Research, Computability, Logic, AI Algorithms, Cryptography and Data Security
Most-Cited Works
- → Proof verification and the hardness of approximation problems(1998)1,401 cited
- → The Space Complexity of Approximating the Frequency Moments(1999)1,166 cited
- → Proof verification and hardness of approximation problems(1992)741 cited
- → Checking computations in polylogarithmic time(1991)618 cited
- → Quantum Speed-Up of Markov Chain Based Algorithms(2004)610 cited
- → Interactive proofs and the hardness of approximating cliques(1996)517 cited
- → On the degree of boolean functions as real polynomials(1994)401 cited