| On sets of integers containing no k elements in arithmetic progression E Szemerédi Acta Arith 27 (199-245), 2, 1975 | 1637 | 1975 |
| Regular partitions of graphs. E Szemerédi Stanford University, 1975 | 1453 | 1975 |
| Storing a Sparse Table with 0(1) Worst Case Access Time ML Fredman, J Komlós, E Szemerédi Journal of the ACM (JACM) 31 (3), 538-544, 1984 | 1269 | 1984 |
| An 0 (n log n) sorting network M Ajtai, J Komlós, E Szemerédi Proceedings of the fifteenth annual ACM symposium on Theory of computing, 1-9, 1983 | 1230 | 1983 |
| Proof of a conjecture of P. Erdős A Hajnal Combin. Theory Appl. 2, 601, 1970 | 836 | 1970 |
| Sorting inc logn parallel steps M Ajtai, J Komlós, E Szemerédi Combinatorica 3, 1-19, 1983 | 708 | 1983 |
| Extremal problems in discrete geometry E Szemerédi, WT Trotter Combinatorica 3, 381-392, 1983 | 686 | 1983 |
| Many hard examples for resolution V Chvátal, E Szemerédi Journal of the ACM (JACM) 35 (4), 759-768, 1988 | 612 | 1988 |
| Triple systems with no six points carrying three triangles IZ Ruzsa, E Szemerédi Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai 18 (939-945), 2, 1978 | 567 | 1978 |
| Crossing-free subgraphs M Ajtai, V Chvátal, MM Newborn, E Szemerédi North-Holland Mathematics Studies 60, 9-12, 1982 | 503 | 1982 |
| A note on Ramsey numbers M Ajtai, J Komlós, E Szemerédi Journal of Combinatorial Theory, Series A 29 (3), 354-360, 1980 | 479 | 1980 |
| Limit distribution for the existence of Hamiltonian cycles in a random graph J Komlós, E Szemerédi Discrete mathematics 43 (1), 55-63, 1983 | 378 | 1983 |
| On sums and products of integers P Erdos, E Szemerédi Studies in pure mathematics, 213-218, 1983 | 351 | 1983 |
| Blow-up lemma J Komlós, GN Sárközy, E Szemerédi Combinatorica 17, 109-123, 1997 | 350 | 1997 |
| Deterministic simulation in LOGSPACE M Ajtai, J Komlós, E Szemerédi Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987 | 325 | 1987 |
| On the complexity of matrix group problems I L Babai, E Szemerédi 25th Annual Symposium onFoundations of Computer Science, 1984., 229-240, 1984 | 297 | 1984 |
| On sets of integers containing no four elements in arithmetic progression E Szemerédi Acta Mathematica Hungarica 20 (1-2), 89-104, 1969 | 291 | 1969 |
| On the second eigenvalue of random regular graphs J Friedman, J Kahn, E Szemeredi Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 290 | 1989 |
| A Dirac-type theorem for 3-uniform hypergraphs V Rödl, A Ruciński, E Szemerédi Combinatorics, Probability and Computing 15 (1-2), 229-251, 2006 | 287 | 2006 |
| On the probability that a random±1-matrix is singular J Kahn, J Komlós, E Szemerédi Journal of the American Mathematical Society 8 (1), 223-240, 1995 | 259 | 1995 |