There is no Fast Single Hashing Algorithm. - Miklós Ajtai; János Komlós; Endre Szemerédi (Inf. Process. Lett., 1978)

A Note on Ramsey Numbers. - Miklós Ajtai; János Komlós; Endre Szemerédi (J. Comb. Theory A, 1980)

On Turáns theorem for sparse graphs. - Miklós Ajtai; Paul Erdös; János Komlós; Endre Szemerédi (Comb., 1981)

The longest path in a random graph. - Miklós Ajtai; János Komlós; Endre Szemerédi (Comb., 1981)

The eigenvalues of random symmetric matrices. - Zoltán Füredi; János Komlós (Comb., 1981)

A Dense Infinite Sidon Sequence. - Miklós Ajtai; János Komlós; Endre Szemerédi (Eur. J. Comb., 1981)

Storing a Sparse Table with O(1) Worst Case Access Time - Michael L. Fredman; János Komlós; Endre Szemerédi (FOCS, 1982)

Largest random component of a k-cube. - Miklós Ajtai; János Komlós; Endre Szemerédi (Comb., 1982)

Extremal Uncrowded Hypergraphs. - Miklós Ajtai; János Komlós; Janos Pintz; Joel Spencer; Endre Szemerédi (J. Comb. Theory A, 1982)

An O(n log n) Sorting Network - Miklós Ajtai; János Komlós; Endre Szemerédi (STOC, 1983)

Sorting in c log n parallel sets. - Miklós Ajtai; János Komlós; Endre Szemerédi (Comb., 1983)

On optimal matchings. - Miklós Ajtai; János Komlós; Gábor E. Tusnády (Comb., 1984)

Storing a Sparse Table with 0(1) Worst Case Access Time. - Michael L. Fredman; János Komlós; Endre Szemerédi (J. ACM, 1984)

On the distribution of cycle lengths in graphs. - András Gyárfás; János Komlós; Endre Szemerédi (J. Graph Theory, 1984)

Hash Functions for Priority Queues - Miklós Ajtai; Michael L. Fredman; János Komlós (Inf. Control., 1984)

Linear verification for spanning trees. - János Komlós (Comb., 1985)

Probabilistic partitioning algorithms for the rectilinear steiner problem. - János Komlós; M. T. Shing (Networks, 1985)

An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. - János Komlós; Albert G. Greenberg (IEEE Trans. Inf. Theory, 1985)

Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels'. - János Komlós; Albert G. Greenberg (IEEE Trans. Inf. Theory, 1985)

Two lower bounds for branching programs - Miklós Ajtai; László Babai; Péter Hajnal; János Komlós; Pavel Pudlák; Vojtech Rödl; Endre Szemerédi; György Turán (STOC, 1986)

Deterministic Selection in O(log log N) Parallel Time - Miklós Ajtai; János Komlós; William L. Steiger; Endre Szemerédi (STOC, 1986)

Deterministic Simulation in LOGSPACE - Miklós Ajtai; János Komlós; Endre Szemerédi (STOC, 1987)

Effect of Connectivity in Associative Memory Models (Preliminary Version) - János Komlós; Ramamohan Paturi (FOCS, 1988)

Convergence results in an associative memory model. - János Komlós; Ramamohan Paturi (Neural Networks, 1988)

Almost Sorting in one Round. - Miklós Ajtai; János Komlós; William L. Steiger; Endre Szemerédi (Adv. Comput. Res., 1989)

Optimal Parallel Selection has Complexity O(Log Log n). - Miklós Ajtai; János Komlós; William L. Steiger; Endre Szemerédi (J. Comput. Syst. Sci., 1989)

Sorting in Average Time o(log) n. - Miklós Ajtai; D. Karabeg; János Komlós; Endre Szemerédi (SIAM J. Discret. Math., 1989)

Halvers and Expanders - Miklós Ajtai; János Komlós; Endre Szemerédi (FOCS, 1992)

Almost Tight Bounds for epsilon-Nets. - János Komlós; János Pach; Gerhard J. Woeginger (Discret. Comput. Geom., 1992)

Effect of Connectivity in an Associative Memory Model. - János Komlós; Ramamohan Paturi (J. Comput. Syst. Sci., 1993)

Topological Cliques in Graphs. - János Komlós; Endre Szemerédi (Comb. Probab. Comput., 1994)

proof of a Packing Conjecture of Bollobás. - János Komlós; Gábor N. Sárközy; Endre Szemerédi (Comb. Probab. Comput., 1995)

Almost all trees have tribe number 2 or 3. - János Komlós; William O. J. Moser (Discret. Math., 1995)

Matching Nuts and Bolts in O(n log n) Time (Extended Abstract). - János Komlós; Yuan Ma; Endre Szemerédi (SODA, 1996)

Topological cliques in graphs 2. - János Komlós; Endre Szemerédi (Comb. Probab. Comput., 1996)

On the square of a Hamiltonian cycle in dense graphs. - János Komlós; Gábor N. Sárközy; Endre Szemerédi (Random Struct. Algorithms, 1996)

Covering Odd Cycles. - János Komlós (Comb., 1997)

Blow-Up Lemma. - János Komlós; Gábor N. Sárközy; Endre Szemerédi (Comb., 1997)

On the Pósa-Seymour conjecture. - János Komlós; Gábor N. Sárközy; Endre Szemerédi (J. Graph Theory, 1998)

An algorithmic version of the blow-up lemma. - János Komlós; Gábor N. Sárközy; Endre Szemerédi (Random Struct. Algorithms, 1998)

Matching Nuts and Bolts in O(n log n) Time. - János Komlós; Yuan Ma; Endre Szemerédi (SIAM J. Discret. Math., 1998)

The smallest Ramsey numbers. - Rita Csákány; János Komlós (Discret. Math., 1999)

The Regularity Lemma and Its Applications in Graph Theory. - János Komlós; Ali Shokoufandeh; Miklós Simonovits; Endre Szemerédi (Theoretical Aspects of Computer Science, 2000)

Tiling Turán Theorems. - János Komlós (Comb., 2000)

Singularity Probabilities For Random Matrices Over Finite Fields. - Jeff Kahn 001; János Komlós (Comb. Probab. Comput., 2001)

Spanning Trees In Dense Graphs. - János Komlós; Gábor N. Sárközy; Endre Szemerédi (Comb. Probab. Comput., 2001)

Proof of the Alon-Yuster conjecture. - János Komlós; Gábor N. Sárközy; Endre Szemerédi (Discret. Math., 2001)

Limit distribution for the existence of Hamiltonian cycles in a random graph. - János Komlós; Endre Szemerédi (Discret. Math., 2006)

Testing Goodness of Fit of Random Graph Models. - Villõ Csiszár; Péter Hussami; János Komlós; Tamás F. Móri; Lídia Rejtõ; Gábor E. Tusnády (Algorithms, 2012)

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. - Jan Hladký; János Komlós; Diana Piguet; Miklós Simonovits; Maya Stein; Endre Szemerédi (SIAM J. Discret. Math., 2017)

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. - Jan Hladký; János Komlós; Diana Piguet; Miklós Simonovits; Maya Stein; Endre Szemerédi (SIAM J. Discret. Math., 2017)

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. - Jan Hladký; János Komlós; Diana Piguet; Miklós Simonovits; Maya Stein; Endre Szemerédi (SIAM J. Discret. Math., 2017)

The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. - Jan Hladký; János Komlós; Diana Piguet; Miklós Simonovits; Maya Stein; Endre Szemerédi (SIAM J. Discret. Math., 2017)

The Asymptotic Normality of (s, s+1)-Cores with Distinct Parts. - János Komlós; Emily Sergel; Gábor E. Tusnády (Electron. J. Comb., 2020)