János Komlós

57 papers A* 10A 1Journal 46

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