default search action
János Komlós
Person information
- affiliation: Rutgers University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j46]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): 1 (2020)
2010 – 2019
- 2017
- [j45]Jan Hladký
, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. SIAM J. Discret. Math. 31(2): 945-982 (2017) - [j44]Jan Hladký
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. SIAM J. Discret. Math. 31(2): 983-1016 (2017) - [j43]Jan Hladký
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. SIAM J. Discret. Math. 31(2): 1017-1071 (2017) - [j42]Jan Hladký
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. SIAM J. Discret. Math. 31(2): 1072-1148 (2017) - 2012
- [j41]Villõ Csiszár, Péter Hussami, János Komlós, Tamás F. Móri
Testing Goodness of Fit of Random Graph Models. Algorithms 5(4): 629-635 (2012)
2000 – 2009
- 2006
- [j40]János Komlós, Endre Szemerédi:
Limit distribution for the existence of Hamiltonian cycles in a random graph. Discret. Math. 306(10-11): 1032-1038 (2006) - 2001
- [j39]Jeff Kahn, János Komlós:
Singularity Probabilities For Random Matrices Over Finite Fields. Comb. Probab. Comput. 10(2): 137-157 (2001) - [j38]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Spanning Trees In Dense Graphs. Comb. Probab. Comput. 10(5): 397-416 (2001) - [j37]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Proof of the Alon-Yuster conjecture. Discret. Math. 235(1-3): 255-269 (2001) - 2000
- [j36]János Komlós:
Tiling Turán Theorems. Comb. 20(2): 203-218 (2000) - [c11]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
1990 – 1999
- 1999
- [j35]Rita Csákány, János Komlós:
The smallest Ramsey numbers. Discret. Math. 199(1-3): 193-199 (1999) - 1998
- [j34]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
On the Pósa-Seymour conjecture. J. Graph Theory 29(3): 167-176 (1998) - [j33]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) - [j32]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): 347-372 (1998) - 1997
- [j31]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Blow-Up Lemma. Comb. 17(1): 109-123 (1997) - [j30]János Komlós:
Covering Odd Cycles. Comb. 17(3): 393-400 (1997) - 1996
- [j29]János Komlós, Endre Szemerédi:
Topological cliques in graphs 2. Comb. Probab. Comput. 5: 79-90 (1996) - [j28]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) - [c10]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 - 1995
- [j27]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: 241-255 (1995) - [j26]János Komlós, William O. J. Moser:
Almost all trees have tribe number 2 or 3. Discret. Math. 143(1-3): 281-285 (1995) - 1994
- [j25]János Komlós, Endre Szemerédi:
Topological Cliques in Graphs. Comb. Probab. Comput. 3: 247-256 (1994) - 1993
- [j24]János Komlós, Ramamohan Paturi:
Effect of Connectivity in an Associative Memory Model. J. Comput. Syst. Sci. 47(2): 350-373 (1993) - 1992
- [j23]János Komlós, János Pach, Gerhard J. Woeginger:
Almost Tight Bounds for epsilon-Nets. Discret. Comput. Geom. 7: 163-173 (1992) - [c9]Miklós Ajtai, János Komlós, Endre Szemerédi:
Halvers and Expanders. FOCS 1992: 686-692
1980 – 1989
- 1989
- [j22]Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
Almost Sorting in one Round. Adv. Comput. Res. 5: 117-125 (1989) - [j21]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) - [j20]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): 285-292 (1989) - 1988
- [j19]János Komlós, Ramamohan Paturi:
Convergence results in an associative memory model. Neural Networks 1(3): 239-250 (1988) - [c8]János Komlós, Ramamohan Paturi:
Effect of Connectivity in Associative Memory Models (Preliminary Version). FOCS 1988: 138-147 - 1987
- [c7]Miklós Ajtai, János Komlós, Endre Szemerédi:
Deterministic Simulation in LOGSPACE. STOC 1987: 132-140 - 1986
- [c6]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 - [c5]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 - 1985
- [j18]János Komlós:
Linear verification for spanning trees. Comb. 5(1): 57-65 (1985) - [j17]János Komlós, M. T. Shing:
Probabilistic partitioning algorithms for the rectilinear steiner problem. Networks 15(4): 413-423 (1985) - [j16]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): 302-306 (1985) - [j15]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): 841 (1985) - 1984
- [j14]Miklós Ajtai, János Komlós, Gábor E. Tusnády:
On optimal matchings. Comb. 4(4): 259-264 (1984) - [j13]Miklós Ajtai, Michael L. Fredman, János Komlós:
Hash Functions for Priority Queues. Inf. Control. 63(3): 217-225 (1984) - [j12]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) - [j11]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): 441-462 (1984) - [c4]János Komlós:
Linear Verification for Spanning Trees. FOCS 1984: 201-206 - 1983
- [j10]Miklós Ajtai, János Komlós, Endre Szemerédi:
Sorting in c log n parallel sets. Comb. 3(1): 1-19 (1983) - [j9]János Komlós, Endre Szemerédi:
Limit distribution for the existence of hamiltonian cycles in a random graph. Discret. Math. 43(1): 55-63 (1983) - [c3]Miklós Ajtai, Michael L. Fredman, János Komlós:
Hash Functions for Priority Queues. FOCS 1983: 299-303 - [c2]Miklós Ajtai, János Komlós, Endre Szemerédi:
An O(n log n) Sorting Network. STOC 1983: 1-9 - 1982
- [j8]Miklós Ajtai, János Komlós, Endre Szemerédi:
Largest random component of a k-cube. Comb. 2(1): 1-7 (1982) - [j7]Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi:
Extremal Uncrowded Hypergraphs. J. Comb. Theory A 32(3): 321-335 (1982) - [c1]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 - 1981
- [j6]Miklós Ajtai, János Komlós, Endre Szemerédi:
The longest path in a random graph. Comb. 1(1): 1-12 (1981) - [j5]Zoltán Füredi, János Komlós:
The eigenvalues of random symmetric matrices. Comb. 1(3): 233-241 (1981) - [j4]Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi:
On Turáns theorem for sparse graphs. Comb. 1(4): 313-317 (1981) - [j3]Miklós Ajtai, János Komlós, Endre Szemerédi:
A Dense Infinite Sidon Sequence. Eur. J. Comb. 2(1): 1-11 (1981) - 1980
- [j2]Miklós Ajtai, János Komlós, Endre Szemerédi:
A Note on Ramsey Numbers. J. Comb. Theory A 29(3): 354-360 (1980)
1970 – 1979
- 1978
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: