János Komlós

Publication Activity (10 Years)

Years Active: 1978-2020
Publications (10 Years): 5

Top Topics

Nearest Neighbor Searching

Goodness Of Fit

Image Decomposition

Top Venues

SIAM J. Discret. Math.

Electron. J. Comb.

Publications

János Komlós, Emily Sergel, Gábor E. Tusnády
The Asymptotic Normality of (s, s+1)-Cores with Distinct Parts. Electron. J. Comb. 27 (1) (2020)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. SIAM J. Discret. Math. 31 (2) (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. SIAM J. Discret. Math. 31 (2) (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. SIAM J. Discret. Math. 31 (2) (2017)
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) (2012)
János Komlós, Endre Szemerédi
Limit distribution for the existence of Hamiltonian cycles in a random graph. Discret. Math. 306 (10-11) (2006)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
Proof of the Alon-Yuster conjecture. Discret. Math. 235 (1-3) (2001)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
Spanning Trees In Dense Graphs. Comb. Probab. Comput. 10 (5) (2001)
Jeff Kahn, János Komlós
Singularity Probabilities For Random Matrices Over Finite Fields. Comb. Probab. Comput. 10 (2) (2001)
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)
János Komlós
Tiling Turán Theorems. Comb. 20 (2) (2000)
Rita Csákány, János Komlós
The smallest Ramsey numbers. Discret. Math. 199 (1-3) (1999)
János Komlós, Yuan Ma, Endre Szemerédi
Matching Nuts and Bolts in O(n log n) Time. SIAM J. Discret. Math. 11 (3) (1998)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
On the Pósa-Seymour conjecture. J. Graph Theory 29 (3) (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) (1998)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
Blow-Up Lemma. Comb. 17 (1) (1997)
János Komlós
Covering Odd Cycles. Comb. 17 (3) (1997)
János Komlós, Endre Szemerédi
Topological cliques in graphs 2. Comb. Probab. Comput. 5 (1996)
János Komlós, Yuan Ma, Endre Szemerédi
Matching Nuts and Bolts in O(n log n) Time (Extended Abstract). SODA (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) (1996)
János Komlós, William O. J. Moser
Almost all trees have tribe number 2 or 3. Discret. Math. 143 (1-3) (1995)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
proof of a Packing Conjecture of Bollobás. Comb. Probab. Comput. 4 (1995)
János Komlós, Endre Szemerédi
Topological Cliques in Graphs. Comb. Probab. Comput. 3 (1994)
János Komlós, Ramamohan Paturi
Effect of Connectivity in an Associative Memory Model. J. Comput. Syst. Sci. 47 (2) (1993)
János Komlós, János Pach, Gerhard J. Woeginger
Almost Tight Bounds for epsilon-Nets. Discret. Comput. Geom. 7 (1992)
Miklós Ajtai, János Komlós, Endre Szemerédi
Halvers and Expanders FOCS (1992)
Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
Almost Sorting in one Round. Adv. Comput. Res. 5 (1989)
Miklós Ajtai, D. Karabeg, János Komlós, Endre Szemerédi
Sorting in Average Time o(log) n. SIAM J. Discret. Math. 2 (3) (1989)
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) (1989)
János Komlós, Ramamohan Paturi
Convergence results in an associative memory model. Neural Networks 1 (3) (1988)
János Komlós, Ramamohan Paturi
Effect of Connectivity in Associative Memory Models (Preliminary Version) FOCS (1988)
Miklós Ajtai, János Komlós, Endre Szemerédi
Deterministic Simulation in LOGSPACE STOC (1987)
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)
Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
Deterministic Selection in O(log log N) Parallel Time STOC (1986)
János Komlós
Linear verification for spanning trees. Comb. 5 (1) (1985)
János Komlós, Albert G. Greenberg
Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels'. IEEE Trans. Inf. Theory 31 (6) (1985)
János Komlós, M. T. Shing
Probabilistic partitioning algorithms for the rectilinear steiner problem. Networks 15 (4) (1985)
János Komlós, Albert G. Greenberg
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31 (2) (1985)
András Gyárfás, János Komlós, Endre Szemerédi
On the distribution of cycle lengths in graphs. J. Graph Theory 8 (4) (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) (1984)
Miklós Ajtai, János Komlós, Gábor E. Tusnády
On optimal matchings. Comb. 4 (4) (1984)
Miklós Ajtai, Michael L. Fredman, János Komlós
Hash Functions for Priority Queues Inf. Control. 63 (3) (1984)
János Komlós
Linear Verification for Spanning Trees FOCS (1984)
János Komlós, Endre Szemerédi
Limit distribution for the existence of hamiltonian cycles in a random graph. Discret. Math. 43 (1) (1983)
Miklós Ajtai, János Komlós, Endre Szemerédi
Sorting in c log n parallel sets. Comb. 3 (1) (1983)
Miklós Ajtai, János Komlós, Endre Szemerédi
An O(n log n) Sorting Network STOC (1983)
Miklós Ajtai, Michael L. Fredman, János Komlós
Hash Functions for Priority Queues FOCS (1983)
Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi
Extremal Uncrowded Hypergraphs. J. Comb. Theory, Ser. A 32 (3) (1982)
Miklós Ajtai, János Komlós, Endre Szemerédi
Largest random component of a k-cube. Comb. 2 (1) (1982)
Michael L. Fredman, János Komlós, Endre Szemerédi
Storing a Sparse Table with O(1) Worst Case Access Time FOCS (1982)
Miklós Ajtai, János Komlós, Endre Szemerédi
The longest path in a random graph. Comb. 1 (1) (1981)
Miklós Ajtai, János Komlós, Endre Szemerédi
A Dense Infinite Sidon Sequence. Eur. J. Comb. 2 (1) (1981)
Zoltán Füredi, János Komlós
The eigenvalues of random symmetric matrices. Comb. 1 (3) (1981)
Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi
On Turáns theorem for sparse graphs. Comb. 1 (4) (1981)
Miklós Ajtai, János Komlós, Endre Szemerédi
A Note on Ramsey Numbers. J. Comb. Theory, Ser. A 29 (3) (1980)
Miklós Ajtai, János Komlós, Endre Szemerédi
There is no Fast Single Hashing Algorithm. Inf. Process. Lett. 7 (6) (1978)