Authors: ARORA S LUND C MOTWANI R SUDAN M SZEGEDY M

Citation: S. Arora et al., PROOF VERIFICATION AND THE HARDNESS OF APPROXIMATION-PROBLEMS, JOURNAL OF THE ACM, 45(3), 1998, pp. 501-555

Authors: LOVASZ L PACH J SZEGEDY M

Citation: L. Lovasz et al., ON CONWAY THRACKLE CONJECTURE, Discrete & computational geometry, 18(4), 1997, pp. 369-376

Authors: FEIGE U GOLDWASSER S LOVASZ L SAFRA S SZEGEDY M

Citation: U. Feige et al., INTERACTIVE PROOFS AND THE HARDNESS OF APPROXIMATING CLIQUES, Journal of the ACM, 43(2), 1996, pp. 268-292

Authors: PACH J SHAHROKHI F SZEGEDY M

Citation: J. Pach et al., APPLICATIONS OF THE CROSSING NUMBER, Algorithmica, 16(1), 1996, pp. 111-117

Authors: HALLDORSSON MM SZEGEDY M

Citation: Mm. Halldorsson et M. Szegedy, LOWER BOUNDS FOR ONLINE GRAPH-COLORING, Theoretical computer science, 130(1), 1994, pp. 163-174

Authors: SZEGEDY M

Citation: M. Szegedy, FUNCTIONS WITH BOUNDED SYMMETRICAL COMMUNICATION COMPLEXITY, PROGRAMSOVER COMMUTATIVE MONOIDS, AND ACC, Journal of computer and system sciences, 47(3), 1993, pp. 405-423