Mario Szegedy
Mario Szegedy
Professor of Computer Science, Rutgers University
Verified email at cs.rutgers.edu - Homepage
Title
Cited by
Cited by
Year
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
27901998
The space complexity of approximating the frequency moments
N Alon, Y Matias, M Szegedy
Journal of Computer and system sciences 58 (1), 137-147, 1999
21771999
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
7191991
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
5671991
Quantum speed-up of Markov chain based algorithms
M Szegedy
45th Annual IEEE symposium on foundations of computer science, 32-41, 2004
5312004
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
4961996
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
4591993
Efficient testing of large graphs
N Alon, E Fischer, M Krivelevich, M Szegedy
Combinatorica 20 (4), 451-476, 2000
4022000
On the degree of Boolean functions as real polynomials
N Nisan, M Szegedy
Computational complexity 4 (4), 301-313, 1994
3861994
Quantum algorithms for the triangle problem
F Magniez, M Santha, M Szegedy
SIAM Journal on Computing 37 (2), 413-424, 2007
3752007
Tracking join and self-join sizes in limited storage
N Alon, PB Gibbons, Y Matias, M Szegedy
Journal of Computer and System Sciences 64 (3), 719-747, 2002
3272002
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
2951992
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
1802001
Applications of the crossing number
J Pach, F Shahrokhi, M Szegedy
Algorithmica 16 (1), 111-117, 1996
1721996
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
1322011
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
1321989
Lower bounds for on-line graph coloring
MM Halldórsson, M Szegedy
Theoretical Computer Science 130 (1), 163-174, 1994
1191994
On Conway's thrackle conjecture
L Lovász, J Pach, M Szegedy
Discrete & Computational Geometry 18 (4), 369-376, 1997
1071997
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
1071992
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
1061996
The system can't perform the operation now. Try again later.
Articles 1–20