M. Szegedy

[4] S. Arora and S. Safra. Probabilistic Checkable Proofs: A New Characterization of NP. JACM, (2008)

S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof Verification, ...

traversal sequences, and the complexity of maze problems. In 20th FOCS, pages 218-223, 1979.

Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles (2008)

Pach, János, Chen, X., Szegedy, M., Tardos, Gábor

All Quantum Adversary Methods are Equivalent (2006)

Spalek, R., Szegedy, M.

The quantum adversary method and classical formula size lower bounds (2005)

Laplante, S., Lee, T.J., Szegedy, M.

All Quantum Adversary Methods are Equivalent (2005)

Spalek, R., Szegedy, M.

The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equal: spectral adversary [Barnum, Saks, and...

All Quantum Adversary Methods are Equivalent (2005)

Spalek, R., Szegedy, M.

The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equal: spectral adversary [Barnum, Saks, and...

The number of simplices embracing the origin (2003)

Pach, János, Szegedy, M.

On Conway's thrackle conjecture. (1997)

Lovász, L., Pach, János, Szegedy, M.

Applications of the crossing number. (1996)

Pach, János, Shahrokhi, F., Szegedy, M.