János Komlós

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

János Komlós, Endre Szemerédi: Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete Mathematics 306(10-11): 1032-1038 (2006)

Jeff Kahn, János Komlós: Singularity Probabilities For Random Matrices Over Finite Fields. Combinatorics, Probability & Computing 10(2): 137-157 (2001)

János Komlós, Gábor N. Sárközy, Endre Szemerédi: Spanning Trees In Dense Graphs. Combinatorics, Probability & Computing 10(5): 397-416 (2001)

János Komlós, Gábor N. Sárközy, Endre Szemerédi: Proof of the Alon-Yuster conjecture. Discrete Mathematics 235(1-3): 255-269 (2001)

János Komlós: Tiling Turán Theorems. Combinatorica 20(2): 203-218 (2000)

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

Rita Csákány, János Komlós: The smallest Ramsey numbers. Discrete Mathematics 199(1-3): 193-199 (1999)

János Komlós, Gábor N. Sárközy, Endre Szemerédi: On the Pósa-Seymour conjecture. Journal of Graph Theory 29(3): 167-176 (1998)

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

János Komlós, Yuan Ma, Endre Szemerédi: Matching Nuts and Bolts in O(n log n) Time. SIAM J. Discrete Math. 11(3): 347-372 (1998)

János Komlós, Gábor N. Sárközy, Endre Szemerédi: Blow-Up Lemma. Combinatorica 17(1): 109-123 (1997)

János Komlós: Covering Odd Cycles. Combinatorica 17(3): 393-400 (1997)

János Komlós, Endre Szemerédi: Topological cliques in graphs 2. Combinatorics, Probability & Computing 5: 79-90 (1996)

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

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

János Komlós, Gábor N. Sárközy, Endre Szemerédi: proof of a Packing Conjecture of Bollobás. Combinatorics, Probability & Computing 4: 241-255 (1995)

János Komlós, William O. J. Moser: Almost all trees have tribe number 2 or 3. Discrete Mathematics 143(1-3): 281-285 (1995)

János Komlós, Endre Szemerédi: Topological Cliques in Graphs. Combinatorics, Probability & Computing 3: 247-256 (1994)

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

János Komlós, János Pach, Gerhard J. Woeginger: Almost Tight Bounds for epsilon-Nets. Discrete & Computational Geometry 7: 163-173 (1992)

Miklós Ajtai, János Komlós, Endre Szemerédi: Halvers and Expanders. FOCS 1992: 686-692

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

Miklós Ajtai, D. Karabeg, János Komlós, Endre Szemerédi: Sorting in Average Time o(log) n. SIAM J. Discrete Math. 2(3): 285-292 (1989)

János Komlós, Ramamohan Paturi: Convergence results in an associative memory model. Neural Networks 1(3): 239-250 (1988)

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

Miklós Ajtai, János Komlós, Endre Szemerédi: Deterministic Simulation in LOGSPACE. STOC 1987: 132-140

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: Two lower bounds for branching programs. STOC 1986: 30-38

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

János Komlós: Linear verification for spanning trees. Combinatorica 5(1): 57-65 (1985)

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

János Komlós, Albert G. Greenberg: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Transactions on Information Theory 31(2): 302-306 (1985)

János Komlós, Albert G. Greenberg: Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels'. IEEE Transactions on Information Theory 31(6): 841 (1985)

Miklós Ajtai, János Komlós, Gábor E. Tusnády: On optimal matchings. Combinatorica 4(4): 259-264 (1984)

Miklós Ajtai, Michael L. Fredman, János Komlós: Hash Functions for Priority Queues. Information and Control 63(3): 217-225 (1984)

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

János Komlós: Linear Verification for Spanning Trees. FOCS 1984: 201-206

Miklós Ajtai, János Komlós, Endre Szemerédi: Sorting in c log n parallel sets. Combinatorica 3(1): 1-19 (1983)

János Komlós, Endre Szemerédi: Limit distribution for the existence of hamiltonian cycles in a random graph. Discrete Mathematics 43(1): 55-63 (1983)

Miklós Ajtai, Michael L. Fredman, János Komlós: Hash Functions for Priority Queues. FOCS 1983: 299-303

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

Miklós Ajtai, János Komlós, Endre Szemerédi: Largest random component of a k-cube. Combinatorica 2(1): 1-7 (1982)

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

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

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

Zoltán Füredi, János Komlós: The eigenvalues of random symmetric matrices. Combinatorica 1(3): 233-241 (1981)

Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi: On Turáns theorem for sparse graphs. Combinatorica 1(4): 313-317 (1981)

Miklós Ajtai, János Komlós, Endre Szemerédi: A Note on Ramsey Numbers. J. Comb. Theory, Ser. A 29(3): 354-360 (1980)

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