PUBLICATIONS of ENDRE SZEMERÉDI

• Komlós J, Sárközy A, Szemerédi E: On sums of powers of complex numbers, MATEMATIKAI LAPOK, 15, 337-347 (1964)
• Sárközy A, Szemerédi, E: Über ein Problem von Erdös und Moser, ACTA ARITHMETICA, 11, 205-208 (1965)
• Sárközy A, Szemerédi E: On the sequence of squares, MATEMATIKAI LAPOK, 16, 76-85 (1965)
• Erdos P, Sárközy A, Szemerédi E: On the solvability of the equations $[a\sb{i},\,a\sb{j}]=a\sb{r}$ and $(a\sb{i}\sp{\prime} ,\,a\sb{j}\sp{\prime} )=a\sb{r}\sp{\prime}$ in sequences of positive density, JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 15, 60-64, (1966)
• Erdos P, Sárközy A, Szemerédi E: On divisibility properties of sequences of integers, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 1, 431-435 (1966)
• Erdos P, Sárközy A, Szemerédi E: On the divisibility properties of sequences of integers, I, ACTA ARITHMETICA, 11, 411-418 (1966)
• Erdos P, Sárközy A, Szemerédi E: On a theorem of Behrend, JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 7, 9-16 (1967)
• Katona G, Szemerédi E: On a problem of graph theory, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2, 23-28 (1967)
• Erdos P, Sárközy A, Szemerédi E: On an extremal problem concerning primitive sequences, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY, 42, 484-488 (1967)
• Erdos P, Sárközy A, Szemerédi E: The solvability of certain equations in the dense sequences of integers, DOKL. AKAD. NAUK SSSR, 176, 541-544 (1967)
• Erdos P, Sárközy A, Szemerédi E: On the divisibility properties of sequences of integers, II, ACTA ARITHMETICA, 14, 1-12 (1967/1968)
• Erdos P, Sárközy A, Szemerédi E: On the solvability of certain equations in sequences of positive upper logarithmic density, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY, 43, 71-78 (1968)
• Erdos P, Szemerédi E: On a problem of P. Erdos and S. Stein, ACTA ARITHMETICA, 15, 85-90 (1968)
• Szemerédi E: On sets of integers containing no four elements in arithmetic progression, ACTA MATHEMATICA HUNGARICA, 20, 89-104 (1969)
• Erdos P, Sárközy A, Szemerédi E: On some extremal properties of sequences of integers, ANNALES UNIVERSITATIS SCIENTIARUM BUDAPESTIENSIS DE ROLANDO EOTVOS NOMINATAE SECTIO COMPUTATORICA, 12, 131-135 (1969)
• Erdos P, Sárközy A, Szemerédi E: Über Folgen ganzer Zahlen, 1969 Number Theory and Analysis (Papers in Honor of Edmund Landau), Plenum, New York, pp. 77-86
• Szemerédi E: On a conjecture of Erdos and Heilbronn, ACTA ARITHMETICA, 17, 227-229 (1970)
• Szemerédi E: On sets of integers containing no four elements in arithmetic progression, 1970 Number Theory (Colloq., János Bolyai Math. Soc., Debrecen, 1968), North-Holland, Amsterdam, pp. 197-204
• Erdos P, Sárközy A, Szemerédi E: On divisibility properties of sequences of integers, 1970 Number Theory (Colloq., János Bolyai Math. Soc., Debrecen, 1968), North-Holland, Amsterdam, pp. 35-49
• Hajnal A, Szemerédi E: Proof of a conjecture of P. Erdos, Combinatorial theory and its applications, II (Proc. Colloq., Balatonfüred, 1969), pp. 601-623 (1970)
• Szemerédi E: On a problem of P. Erdos, Combinatorial theory and its applications, III (Proc. Colloq., Balatonfüred, 1969), North-Holland, Amsterdam, pp. 1051-1053 (1970)
• Sárközy A, Szemerédi E: On intersections of subsets of finite sets, MATEMATIKAI LAPOK, 21, 269-278 (1970), (1971)
• Szemerédi E: On a problem of W. Schmidt, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 6, 287-288 (1971)
• Hajnal A, Milner EC, Szemerédi E: A cure for the telephone disease, CANADIAN MATHEMATICAL BULLETIN, 15, 447-450 (1972)
• Komlós J, Sulyok M, Szemerédi E: A lemma of combinatorial number theory, MATEMATIKAI LAPOK, 23, 103-108 (1972), (1973)
• Szemerédi E: On graphs containing no complete subgraph with $4$ vertices, MATEMATIKAI LAPOK, 23, 113-116 (1972), (1973)
• Szemerédi E, Petruska G: On a combinatorial problem, I, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 7, 363-374 (1972)
• Szemerédi E: On the difference of consecutive terms of sequences defined by divisibility properties, II, ACTA ARITHMETICA, 23, 359-361 (1973)
• Szemerédi E: On a problem of Davenport and Schinzel, ACTA ARITHMETICA, 25, 213-224 (1973/74)
• Erdos P, Szemerédi E: On the number of solutions of $m=\sum \sb{i=1}\sp{k}$ $\chi \sp{k}\sb{i}$, Analytic number theory (Proc. Sympos. Pure Math., Vol. XXIV, St. Louis Univ., St. Louis, Mo., 1972), Amer. Math. Soc., Providence, R.I., pp. 83-90 (1973)
• Szemerédi E: On a problem of P. Erdos, MATHEMATIKA, 20, 226-228 (1973)
• Ajtai M, Szemerédi E: Sets of lattice points that form no squares, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 9, 9-11 (1974), (1975)
• Szemerédi E: The number of squares in an arithmetic progression, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 9(3-4), 417 (1974), (1975).
• Komlós J, Sulyok M, Szemerédi E: Linear problems in combinatorial number theory, ACTA MATHEMATICA HUNGARICA, 26, 113-121 (1975)
• Choi SLG, Erdos P, Szemerédi E: Some additive and multiplicative problems in number theory, Collection of articles in memory of Juri\u\i Vladimirovi\v c Linnik, ACTA ARITHMETICA, 27, 37-50 (1975)
• Szemerédi E: On sets of integers containing no $k$ elements in arithmetic progression, Collection of articles in memory of Juri\u\i Vladimirovi\v c Linnik, ACTA ARITHMETICA, 27, 199-245 (1975)
• Choi SLG, Komlós J, Szemerédi E: On sum-free subsequences, TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 212, 307-313 (1975)
• Bollobás B, Erdos P, Szemerédi E: On complete subgraphs of $r$-chromatic graphs, DISCRETE MATHEMATICS, 13(2), 97-107 (1975)
• Józsa S, Szemerédi E: The number of unit distance on the plane, Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdos on his 60th birthday), Vol. II, pp. 939-950, Colloq. Math. Soc. János Bolyai, Vol. 10, North-Holland, Amsterdam, 1975
• Komlós J, Szemerédi E: Hamilton cycles in random graphs, Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdos on his 60th birthday), Vol. II, pp. 1003-1010, Colloq. Math. Soc. János Bolyai, Vol. 10, North-Holland, Amsterdam, 1975
• Szemerédi E: On sets of integers containing no $k$ elements in arithmetic progression, Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974), Vol. 2, pp. 503-505, Canad. Math. Congress, Montreal, Que., 1975
• Szemerédi E: On a problem of P. Erdos, JOURNAL OF NUMBER THEORY, 8(3), 264-270 (1976)
• Erdos E, Szemerédi E: On a problem of Graham, PUBLICATIONES MATHEMATICAE-DEBRECEN, 23(1-2), 123-127 (1976)
• Guibas LJ, Szemerédi E: The analysis of double hashing (extended abstract), Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pa., 1976), pp. 187-191, Assoc. Comput. Mach., New York, 1976
• Erdos P, Graham RL, Szemerédi E: On sparse graphs with dense long paths, Computers and mathematics with applications, pp. 365-369, Pergamon, Oxford, 1976
• Guibas LJ, Szemerédi E: The analysis of double hashing, JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 16(2), 226-274 (1978)
• Erdos P, Szemerédi E: Combinatorial properties of systems of sets, JOURNAL OF COMBINATORIAL THEORY SERIES A, 24(3), 308-313 (1978)
• Graham RL, Szemerédi E: On subgraph number independence in trees, JOURNAL OF COMBINATORIAL THEORY SERIES B, 24(2), 213-222 (1978)
• Bollobás B, Erdos P, Simonovits M, Szemerédi E: Extremal graphs without large forbidden subgraphs, Advances in graph theory (Cambridge Combinatorial Conf., Trinity Coll., Cambridge, 1977), Ann. Discrete Math., 3, 29-41 (1978)
• Ajtai M, Komlós J, Szemerédi E: There is no fast single hashing algorithm, INFORMATION PROCESSING LETTERS, 7(6), 270-273 (1978)
• Ruzsa IZ, Szemerédi E: Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, pp. 939-945, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978
• Szemerédi E: Regular partitions of graphs, Problčmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 399-401, Colloq. Internat. CNRS, 260, CNRS, Paris, 1978
• Ajtai M, Komlós J, Szemerédi E: Topological complete subgraphs in random graphs, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 14(1-3), 293-297 (1979), (1982)
• Gyárfás A, Szemerédi E, Tuza Zs: Induced subtrees in graphs of large chromatic number, DISCRETE MATHEMATICS, 30(3), 235-244 (1980)
• Erdos P, Sárközy A, Szemerédi E: On some extremal properties of sequences of integers, II, PUBLICATIONES MATHEMATICAE-DEBRECEN, 27(1-2), 117-125 (1980) Erdos P, Szemerédi E: Remarks on a problem of the American Mathematical Monthly, MATEMATIKAI LAPOK, 28(1-3), 121-124 (1980)
• Ajtai M, Komlós J, Szemerédi E: A note on Ramsey numbers, JOURNAL OF COMBINATORIAL THEORY SERIES A, 29(3), 354-360 (1980)
• Komlós J, Sulyok M, Szemerédi E: Second largest component in a random graph, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 15(4), 391-395 (1980)
• Ajtai M, Komlós J, Szemerédi E: The longest path in a random graph, COMBINATORICA, 1(1), 1-12 (1981)
• Chvátal V, Szemerédi E: On the Erdos-Stone theorem, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 23(2), 207-214 (1981)
• Ajtai M, Komlós J, Szemerédi E: A dense infinite Sidon sequence, EUROPEAN JOURNAL OF COMBINATORICS, 2(1), 1-11 (1981)
• Komlós J, Pintz J, Szemerédi E: On Heilbronn's triangle problem, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 24(3), 385-396 (1981)
• Ajtai M, Erdos P, Komlós J, Szemerédi E: On Turán's theorem for sparse graphs, COMBINATORICA, 1(4), 313-317 (1981)
• Komlós J, Pintz J, Szemerédi E: A lower bound for Heilbronn's problem, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 25(1), 13-24 (1982)
• Ajtai M, Komlós J, Rödl V, Szemerédi E: On coverings of random graphs, COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE, 23(1), 193-198 (1982)
• Ajtai M, Komlós J, Pintz J, Spencer J, Szemerédi E: Extremal uncrowded hypergraphs, JOURNAL OF COMBINATORIAL THEORY SERIES A, 32(3), 321-335 (1982)
• Ajtai M, Komlós J, Szemerédi E: Largest random component of a $k$-cube, COMBINATORICA, 2(1), 1-7 (1982)
• Chvátal V, Szemerédi E: On an extremal problem concerning intervals, EUROPEAN JOURNAL OF COMBINATORICS, 3(3), 215-217 (1982)
• Szemerédi E, Tuza Zs: Upper bound for transversals of tripartite hypergraphs, PERIODICA MATHEMATICA HUNGARICA, 13(4), 321-323 (1982)
• Fredman ML, Komlós J, Szemerédi E: Storing a sparse table with $O(1)$ worst case access time, 23rd annual symposium on foundations of computer science (Chicago, Ill., 1982), 165-169, IEEE, New York, 1982
• Ajtai M, Chvátal V, Newborn MM, Szemerédi E: Crossing-free subgraphs, Theory and practice of combinatorics, 9-12, North-Holland Math. Stud., 60, North-Holland, Amsterdam, 1982
• Erdos P, Hajnal A, Szemerédi E: On almost bipartite large chromatic graphs, Theory and practice of combinatorics, 117-123, North-Holland Math. Stud., 60, North-Holland, Amsterdam, 1982
• Komlós J, Szemerédi E: Limit distribution for the existence of Hamiltonian cycles in a random graph, DISCRETE MATHEMATICS, 43(1), 55-63 (1983)
• Chvatál C, Rödl V, Szemerédi E, Trotter WT Jr: The Ramsey number of a graph with bounded maximum degree, JOURNAL OF COMBINATORIAL THEORY SERIES B, 34(3), 239-243 (1983)
• Ajtai M, Komlós J, Szemerédi E: Sorting in $c\,{\rm log}\,n$ parallel steps, COMBINATORICA, 3(1), 1-19 (1983)
• Erdos P, Hajnal A, T Sós V, Szemerédi E: More results on Ramsey-Turán type problems, COMBINATORICA, 3(1) 69-81 (1983)
• Szemerédi E, Trotter WT Jr: Extremal problems in discrete geometry, COMBINATORICA, 3(3-4), 381-392 (1983)
• Chvátal V, Szemerédi E: Short cycles in directed graphs, JOURNAL OF COMBINATORIAL THEORY SERIES B, 35(3), 323-327 (1983)
• Szemerédi E, Trotter WT Jr: Recent progress in extremal problems in discrete geometry, Graphs and other combinatorial topics (Prague, 1982), 316-319, Teubner-Texte Math., 59, Teubner, Leipzig, 1983
• Szemerédi E, Trotter WT Jr: A combinatorial distinction between the Euclidean and projective planes, EUROPEAN JOURNAL OF COMBINATORICS, 4(4), 385-394 (1983)
• Erdos P, Szemerédi E: On sums and products of integers, Studies in pure mathematics, 213-218, Birkhäuser, Basel, 1983
• Chvátal V, Szemerédi E: Notes on the Erdos-Stone theorem, Combinatorial mathematics (Marseille-Luminy, 1981), 183-190, North-Holland Math. Stud., 75, North-Holland, Amsterdam, 1983
• Gyárfás A, Komlós J, Szemerédi E: On the distribution of cycle lengths in graphs, JOURNAL OF GRAPH THEORY, 8(4), 441-462 (1984)
• Kierstead HA, Szemerédi E, Trotter WT Jr: On coloring graphs with locally small chromatic number, COMBINATORICA, 4(2-3), 183-185 (1984)
• Spencer J, Szemerédi E, Trotter WT Jr: Unit distances in the Euclidean plane, Graph theory and combinatorics (Cambridge, 1983), 293-303, Academic Press, London, 1984
• Komlós J, Pintz J, Szemerédi E: On a problem of Erdos and Straus, Topics in classical number theory, Vol. I, II (Budapest, 1981), 927-960, Colloq. Math. Soc. János Bolyai, 34, North-Holland, Amsterdam, 1984
• Fredman ML, Komlós J, Szemerédi E: Storing a sparse table with $O(1)$ worst case access time, JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 31(3), 538-544 (1984)
• Gyárfás A, Prömel HJ, Szemerédi E, Voigt B: On the sum of the reciprocals of cycle lengths in sparse graphs, COMBINATORICA, 5(1), 41-52 (1985)
• Ajtai M, Komlós J, Szemerédi E: First occurrence of Hamilton cycles in random graphs, Cycles in graphs (Burnaby, B.C., 1982), 173-178, North-Holland Math. Stud., 115, North-Holland, Amsterdam, 1985
• Lovász L, Szemerédi E (eds): Theory of algorithms, Papers from the colloquium held in Pécs, July 16-21, 1984, Colloquia Mathematica Societatis János Bolyai, 44, North-Holland Publishing Co., Amsterdam; János Bolyai Mathematical Society, Budapest, 1985
• Babai L, Hajnal P, Szemerédi E, Turán Gy: A lower bound for read-once-only branching programs, JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 35(2), 153-162 (1987)
• Pintz J, Steiger WL, Szemerédi E: On sets of natural numbers whose difference set contains no squares, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 37(2), 219-231 (1988)
• Ragde P, Steiger W, Szemerédi E, Wigderson A: The parallel complexity of element distinctness is $\Omega\sqrt{{\rm log}\,n}$, SIAM JOURNAL ON DISCRETE MATHEMATICS, 1(3), 399-410 (1988)
• Cole R, Salowe J, Steiger WL, Szemerédi E: Optimal slope selection, Automata, languages and programming (Tampere, 1988), 133-146, Lecture Notes in Comput. Sci., 317, Springer, Berlin, 1988
• Chvátal V, Szemerédi E: Many hard examples for resolution, JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 35(4), 759-768 (1988)
• Pintz J, Steiger WL, Szemerédi E: Infinite sets of primes with fast primality tests and quick generation of large primes, MATHEMATICS OF COMPUTATION, 53(187), 399-406 (1989)
• Geréb-Graus M, Paturi R, Szemerédi E: There are no $p$-complete families of symmetric Boolean functions, INFORMATION PROCESSING LETTERS, 30(1), 47-49 (1989)
• Ajtai M, Komlós J, Steiger WL, Szemerédi E: Optimal parallel selection has complexity $O(\log\log n)$, 18th Annual ACM Symposium on Theory of Computing (Berkeley, CA, 1986), JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 38(1), 125-133 (1989)
• Galil Z, Kannan R, Szemerédi E: On nontrivial separators for $k$-page graphs and simulations by nondeterministic one-tape Turing machines, 18th Annual ACM Symposium on Theory of Computing (Berkeley, CA, 1986), JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 38(1), 134-149 (1989)
• Ajtai M, Karabeg D, Komlós J, Szemerédi E: Sorting in average time $o(\log n)$, SIAM JOURNAL ON DISCRETE MATHEMATICS, 2(3), 285-292 (1989)
• Cole R, Salowe JS, Steiger WL, Szemerédi E: An optimal-time algorithm for slope selection, SIAM JOURNAL ON COMPUTING, 18(4), 792-810 (1989)
• Galil Z, Kannan R, Szemerédi E: On $3$-pushdown graphs with large separators, COMBINATORICA, 9(1), 9-19 (1989)
• Hajnal P, Szemerédi E: Brooks coloring in parallel, SIAM JOURNAL ON DISCRETE MATHEMATICS, 3(1), 74-80 (1990)
• Babai L, Pudlák P, Rödl V, Szemerédi E: Lower bounds to the complexity of symmetric Boolean functions, THEORETICAL COMPUTER SCIENCE, 74(3), 313-323 (1990)
• Ajtai M, Iwaniec H, Komlós J, Pintz J, Szemerédi E: Construction of a thin set with small Fourier coefficients, BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 22(6), 583-590 (1990)
• Szemerédi E: Integer sets containing no arithmetic progressions, ACTA MATHEMATICA HUNGARICA, 56(1-2), 155-158 (1990)
• Ajtai M, Komlós J, Szemerédi E: Generating expanders from two permutations, A tribute to Paul Erdos, 1-12, Cambridge Univ. Press, Cambridge, 1990
• Pach J, Steiger W, Szemerédi E: An upper bound on the number of planar k-sets, DISCRETE & COMPUTATIONAL GEOMETRY, 7(2), 109-123 (1992)
• Chung FRK, Szemerédi E, Trotter WT: The number of different distances determined by a set of points in the Euclidean plane, DISCRETE & COMPUTATIONAL GEOMETRY, 7(1), 1-11 (1992)
• Ajtai M, Komlós J, Szemerédi E: Halvers and expanders, In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992), IEEE Computer Society Press, Los Alamitos, CA, 1992, pp 686-692
• Nisan N, Szemerédi E, Wigderson A: Undirected connectivity in O(log1.5 n) space, In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992), IEEE Computer Society Press, Los Alamitos, CA, 1992, pp 24-29
• Erdös P, Hajnal A, Simonovits M, T.Sós V, Szemerédi E: Turán-Ramsey theorems and simple asymptotically extremal structures, COMBINATORICA, 13(1), 31-56 (1993)
• Maass W, Schnitger G, Szemerédi E, Turán Gy: Two tapes versus one for off-line Turing machines, COMPUTATIONAL COMPLEXITY, 3(4), 392-401 (1993)
• Razborov A, Szemerédi E, Wigderson A: Constructing small sets that are uniform in arithmetic progressions, COMBINATORICS PROBABILITY & COMPUTING, 2(4), 513-518 (1993)
• Balog A, Pelikán J, Pintz J, Szemerédi E: Difference sets without $\kappa$th powers, ACTA MATHEMATICA HUNGARICA, 65(2), 165-187 (1994)
• Balog A, Szemerédi E: A statistical theorem of set addition, COMBINATORICA, 14(3), 263-268 (1994)
• Komlós J, Szemerédi E: Topological cliques in graphs, COMBINATORICS PROBABILITY & COMPUTING, 3(2), 247-256 (1994)
• Sárközy A, Szemerédi E: On a problem in additive number theory, ACTA MATHEMATICA HUNGARICA, 64(3), 237-245 (1994)
• Erdös P, Hajnal A, Simonovits M, T.Sós V, Szemerédi E: Turán-Ramsey theorems and $K\sb p$-independence numbers, COMBINATORICS PROBABILITY & COMPUTING, 3(3), 297-325 (1994)
• Komlós J, Sárközy GN, Szemerédi E: Proof of a packing conjecture of Bollobás, COMBINATORICS PROBABILITY & COMPUTING, 4(3), 241-255 (1995)
• Kahn J, Komlós J, Szemerédi E: On the probability that a random $±1$-matrix is singular, JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 8(1), 223-240 (1995)
• Pyber L, Rödl V, Szemerédi E: Dense graphs without $3$-regular subgraphs, JOURNAL OF COMBINATORIAL THEORY SERIES B, 63(1), 41-54 (1995)
• Ajtai M, Komlós J, Szemerédi E: On a conjecture of Loebl, In: Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), (Eds Alavi Y, Schwenk A), Wiley-Interscience Publication, Wiley, New York, 1995, pp 1135-1146
• Komlós J, Sárközy G, Szemerédi E: On the square of a Hamiltonian cycle in dense graphs, RANDOM STRUCTURES & ALGORITHMS, 9(1-2), 193-211 (1996)
• Komlós J, Szemerédi E: Topological cliques in graphs, II, COMBINATORICS PROBABILITY & COMPUTING, 5(1), 79-90 (1996)
• Komlós J, Simonovits M: Szemerédi's regularity lemma and its applications in graph theory, In: Combinatorics: Paul Erdos Is Eighty, Vol. 2 (Keszthely, 1993), Bolyai Society Mathematical Studies 2, (Eds Miklós D, T.Sós V, Szonyi T), J. Bolyai Math, Soc., Budapest, 1996, pp 295-352
• Komlós J, Sárközy GN, Szemerédi E: Blow-up lemma, COMBINATORICA, 17(1), 109-123 (1997)
• Komlós J, Szemerédi E: Topological cliques in graphs, In: Combinatorics, Geometry and Probability, A Tribute to Paul Erdos, Proc. Colloq. Cambridge, 1993, (Eds Bollobás B, Thomason A), Cambridge Univ. Press, Cambridge, 1997, pp 439-448
• Erdős P, Hajnal A, Simonovits M, T.Sós V, Szemerédi E: Turán-Ramsey theorems and Kp-independence numbers, In: Combinatorics, Geometry and Probability, A Tribute to Paul Erdos, Proc. Colloq. Cambridge, 1993, (Eds Bollobás B, Thomason A), Cambridge University Press, Cambridge, 1997, pp 253-281
• Komlós J, Sárközy GN, Szemerédi E: On the Pósa-Seymour conjecture, JOURNAL OF GRAPH THEORY, 29(3), 167-176 (1998)
• Komlós J, Sárközy GN, Szemerédi E: An algorithmic version of the blow-up lemma, RANDOM STRUCTURES & ALGORITHMS, 12(3), 297-312 (1998)
• Komlós J, Ma Y, Szemerédi E: Matching nuts and bolts in O(n log n) time, SIAM JOURNAL ON DISCRETE MATHEMATICS, 11(3), 343-372 (1998)
• Komlós J, Sárközy GN, Szemerédi E: Proof of the Seymour conjecture for large graphs, ANNALS OF COMBINATORICS, 2(1), 43-60 (1998)
• Luczak T, Rödl V, Szemerédi E: Partitioning two-coloured complete graphs into two monochromatic cycles, COMBINATORICS PROBABILITY & COMPUTING, 7(4), 423-436 (1998)
• Ajtai M, Komlós J, Steiger W, Szemerédi E: Almost sorting in one round, ADVANCES IN COMPUTING RESEARCH, 5, 117-125 (1999)
• Pelikán J, Pintz J, Szemerédi E: On the running time of the Adleman-Pomerance-Rumely primality test, PUBLICATIONES MATHEMATICAE-DEBRECEN, 56(3-4), 523-534 (2000)
• Rödl V, Szemerédi E: On size Ramsey numbers of graphs with bounded degree, COMBINATORICA, 20(2), 257-262 (2000)
• Komlós J, Sárközy GN, Szemerédi E: Proof of the Alon-Yuster conjecture, DISCRETE MATHEMATICS, 235(1-3), 255-269 (2001)
• Komlós J, Sárközy GN, Szemerédi E: Spanning Trees in Dense Graphs, COMBINATORICS PROBABILITY & COMPUTING, 10(5), 397-416 (2001)
• Bollobás B, Szemerédi E: Girth of sparse graphs, JOURNAL OF GRAPH THEORY, 39(3), 194-200 (2002)
• Khalfalah A, Lodha S, Szemerédi E: Tight bound for the density of sequences of integers the sum of no two of which is a perfect square, DISCRETE MATHEMATICS, 256(1-2), 243-255 (2002)
• Komlós J, Shokoufandeh A, Simonovits M, Szemerédi E: The Regularity Lemma and its applications in graph theory, LECTURE NOTES IN COMPUTER SCIENCE, 2292, 84-112 (2002)
• Alon N, Capalbo M, Kohayakawa Y, Rödl V, Rucinski A, Szemerédi E: Universality and tolerance (extended abstract), 41st Annual Symposium on Foundations of Computer Science Proceedings of the symposium (FOCS'00) held in Redondo Beach, CA, November 12-14, 2000; IEEE Computer Society Press, Los Alamitos, CA; 2000; 14-21.
• Sárközy GN, Selkow SM, Szemerédi E: On the number of Hamiltonian cycles in Dirac graphs, DISCRETE MATHEMATICS, 265(1-3), 237-250 (2003)
• Csaba B, Shokoufandeh A, Szemerédi E: Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three, COMBINATORICA, 23(1), 35-72 (2003)