János Komlós

List of publications from the DBLP Bibliography Server - FAQ

Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2006

46 EE 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)

2001

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

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

43 EE 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)

2000

42 EE 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

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

1999

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

1998

39 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)

38 EE 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)

1997

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

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

1996

35 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

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

33 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)

1995

32 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)

31 EE 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)

1994

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

1993

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

1992

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

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

1989

26 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)

25 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)

1988

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

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

1987

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

1986

21 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

20 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

1985

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

18 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- (1985)

17 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)

1984

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

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

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

13 EE 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)

1983

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

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

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

9 EE 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)

1982

8 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

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

6 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)

1981

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

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

3 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)

1980

2 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)

1978

1 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)

2006
46	EE	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)
2001
45		Jeff Kahn, János Komlós: Singularity Probabilities For Random Matrices Over Finite Fields. Combinatorics, Probability & Computing 10(2): (2001)
44		János Komlós, Gábor N. Sárközy, Endre Szemerédi: Spanning Trees In Dense Graphs. Combinatorics, Probability & Computing 10(5): (2001)
43	EE	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)
2000
42	EE	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
41	EE	János Komlós: Tiling Turán Theorems. Combinatorica 20(2): 203-218 (2000)
1999
40	EE	Rita Csákány, János Komlós: The smallest Ramsey numbers. Discrete Mathematics 199(1-3): 193-199 (1999)
1998
39		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)
38	EE	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)
1997
37		János Komlós, Gábor N. Sárközy, Endre Szemerédi: Blow-Up Lemma. Combinatorica 17(1): 109-123 (1997)
36		János Komlós: Covering Odd Cycles. Combinatorica 17(3): 393-400 (1997)
1996
35		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
34		János Komlós, Endre Szemerédi: Topological cliques in graphs 2. Combinatorics, Probability & Computing 5: 79-90 (1996)
33		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)
1995
32		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)
31	EE	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)
1994
30		János Komlós, Endre Szemerédi: Topological Cliques in Graphs. Combinatorics, Probability & Computing 3: 247-256 (1994)
1993
29		János Komlós, Ramamohan Paturi: Effect of Connectivity in an Associative Memory Model. J. Comput. Syst. Sci. 47(2): 350-373 (1993)
1992
28		Miklós Ajtai, János Komlós, Endre Szemerédi: Halvers and Expanders FOCS 1992: 686-692
27		János Komlós, János Pach, Gerhard J. Woeginger: Almost Tight Bounds for epsilon-Nets. Discrete & Computational Geometry 7: 163-173 (1992)
1989
26		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)
25		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)
1988
24		János Komlós, Ramamohan Paturi: Effect of Connectivity in Associative Memory Models (Preliminary Version) FOCS 1988: 138-147
23	EE	János Komlós, Ramamohan Paturi: Convergence results in an associative memory model. Neural Networks 1(3): 239-250 (1988)
1987
22		Miklós Ajtai, János Komlós, Endre Szemerédi: Deterministic Simulation in LOGSPACE STOC 1987: 132-140
1986
21		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
20		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
1985
19		János Komlós: Linear verification for spanning trees. Combinatorica 5(1): 57-65 (1985)
18		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- (1985)
17		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)
1984
16		János Komlós: Linear Verification for Spanning Trees FOCS 1984: 201-206
15		Miklós Ajtai, János Komlós, Gábor E. Tusnády: On optimal matchings. Combinatorica 4(4): 259-264 (1984)
14		Miklós Ajtai, Michael L. Fredman, János Komlós: Hash Functions for Priority Queues Information and Control 63(3): 217-225 (1984)
13	EE	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)
1983
12		Miklós Ajtai, Michael L. Fredman, János Komlós: Hash Functions for Priority Queues FOCS 1983: 299-303
11		Miklós Ajtai, János Komlós, Endre Szemerédi: An O(n log n) Sorting Network STOC 1983: 1-9
10		Miklós Ajtai, János Komlós, Endre Szemerédi: Sorting in c log n parallel sets. Combinatorica 3(1): 1-19 (1983)
9	EE	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)
1982
8		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
7		Miklós Ajtai, János Komlós, Endre Szemerédi: Largest random component of a k-cube. Combinatorica 2(1): 1-7 (1982)
6		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)
1981
5		Miklós Ajtai, János Komlós, Endre Szemerédi: The longest path in a random graph. Combinatorica 1(1): 1-12 (1981)
4		Zoltán Füredi, János Komlós: The eigenvalues of random symmetric matrices. Combinatorica 1(3): 233-241 (1981)
3		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)
1980
2		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)
1978
1		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

1 Miklós Ajtai [1] [2] [3] [5] [6] [7] [10] [11] [12] [14] [15] [20] [21] [22] [25] [26] [28]

2 László Babai [20]

3 Rita Csákány [40]

4 Paul Erdös [3]

5 Michael L. Fredman [8] [12] [13] [14]

6 Zoltán Füredi [4]

7 Albert G. Greenberg [17] [18]

8 Péter Hajnal [20]

9 Jeff Kahn [45]

10 D. Karabeg [25]

11 Yuan Ma [35] [38]

12 William O. J. Moser [31]

13 János Pach [27]

14 Ramamohan Paturi [23] [24] [29]

15 Janos Pintz [6]

16 Pavel Pudlák [20]

17 Vojtech Rödl [20]

18 Gábor N. Sárközy [32] [33] [37] [39] [43] [44]

19 Ali Shokoufandeh [42]

20 Miklós Simonovits [42]

21 Joel H. Spencer (Joel Spencer) [6]

22 William L. Steiger [21] [26]

23 Endre Szemerédi [1] [2] [3] [5] [6] [7] [8] [9] [10] [11] [13] [20] [21] [22] [25] [26] [28] [30] [32] [33] [34] [35] [37] [38] [39] [42] [43] [44] [46]

24 György Turán [20]

25 Gábor E. Tusnády [15]

26 Gerhard J. Woeginger [27]

Colors in the list of coauthors

1	Miklós Ajtai	[1] [2] [3] [5] [6] [7] [10] [11] [12] [14] [15] [20] [21] [22] [25] [26] [28]
2	László Babai	[20]
3	Rita Csákány	[40]
4	Paul Erdös	[3]
5	Michael L. Fredman	[8] [12] [13] [14]
6	Zoltán Füredi	[4]
7	Albert G. Greenberg	[17] [18]
8	Péter Hajnal	[20]
9	Jeff Kahn	[45]
10	D. Karabeg	[25]
11	Yuan Ma	[35] [38]
12	William O. J. Moser	[31]
13	János Pach	[27]
14	Ramamohan Paturi	[23] [24] [29]
15	Janos Pintz	[6]
16	Pavel Pudlák	[20]
17	Vojtech Rödl	[20]
18	Gábor N. Sárközy	[32] [33] [37] [39] [43] [44]
19	Ali Shokoufandeh	[42]
20	Miklós Simonovits	[42]
21	Joel H. Spencer (Joel Spencer)	[6]
22	William L. Steiger	[21] [26]
23	Endre Szemerédi	[1] [2] [3] [5] [6] [7] [8] [9] [10] [11] [13] [20] [21] [22] [25] [26] [28] [30] [32] [33] [34] [35] [37] [38] [39] [42] [43] [44] [46]
24	György Turán	[20]
25	Gábor E. Tusnády	[15]
26	Gerhard J. Woeginger	[27]