!!Endre Szemerédi - Selected publications
\\
Fredman ML, Komlós J, Szemerédi E. Storing a sparce table with O(1) worst case access time. J. of the ACM  31(1984):538-544. \\
\\
Ajtai M, Komlós J, Szemerédi E. Sorting in c log n parallel steps. Combinatorica  3(1983):1-19.\\
\\
Chvatal V, Szemerédi E. Many hard examples for resolution. J. of the ACM  35(1988):759-768.\\
\\
Szemerédi E, Trotter WT. Extremal problems in discrete geometry. Combinatorica  3(1983):381-392.\\
\\
Komlós J, Sárközy GN, Szemerédi E. Blow-up Lemma. Combinatorica  17(1997):109-123.\\
\\
Ajtai M, Komlós J, Szemerédi E. A note on Ramsey numbers. J. Comb. Theory Series A. 29(1980)354-360 \\
\\
Komlós J, Szemerédi E. Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete Mathematics. 43(1983):55-63. \\
\\
Komlós J, Pintz J, Szemerédi E. A lower bound for Heilbronn problem. J. London Math. Soc. - Second Series 25(1982):13-24.\\
\\
Szemerédi E. On sets of integers containing no 4 elements in arithmetic progression. Acta Math. Acad. Sci Hung. 20(1969):89.\\
\\
Szemerédi E. Integer sets containing no arithmetic progressions. Acta Math. Hung. 56(1990)155-158.