| * | 2008 |
|---|
| 85 | EE | Vojtech Rödl,
Endre Szemerédi,
Andrzej Rucinski:
An approximate Dirac-type theorem for k -uniform hypergraphs.
Combinatorica 28(2): 229-260 (2008) |
| 84 | EE | András Gyárfás,
Miklós Ruszinkó,
Gábor N. Sárközy,
Endre Szemerédi:
Three-color Ramsey numbers for paths.
Combinatorica 28(4): 499-502 (2008) |
| 83 | EE | Ryan Martin,
Endre Szemerédi:
Quadripartite version of the Hajnal-Szemerédi theorem.
Discrete Mathematics 308(19): 4337-4360 (2008) |
| 2007 |
|---|
| 82 | EE | András Gyárfás,
Miklós Ruszinkó,
Gábor N. Sárközy,
Endre Szemerédi:
Three-Color Ramsey Numbers For Paths.
Combinatorica 27(1): 35-69 (2007) |
| 81 | EE | András Gyárfás,
Miklós Ruszinkó,
Gábor N. Sárközy,
Endre Szemerédi:
Tripartite Ramsey numbers for paths.
Journal of Graph Theory 55(2): 164-174 (2007) |
| 2006 |
|---|
| 80 | EE | Ayman Khalfalah,
Endre Szemerédi:
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$.
Combinatorics, Probability & Computing 15(1-2): 213-227 (2006) |
| 79 | EE | Vojtech Rödl,
Andrzej Rucinski,
Endre Szemerédi:
A Dirac-Type Theorem for 3-Uniform Hypergraphs.
Combinatorics, Probability & Computing 15(1-2): 229-251 (2006) |
| 78 | 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) |
| 77 | EE | Vojtech Rödl,
Andrzej Rucinski,
Endre Szemerédi:
Perfect matchings in uniform hypergraphs with large minimum degree.
Eur. J. Comb. 27(8): 1333-1349 (2006) |
| 76 | EE | Joanna Polcyn,
Vojtech Rödl,
Andrzej Rucinski,
Endre Szemerédi:
Short paths in quasi-random triple systems with sparse underlying graphs.
J. Comb. Theory, Ser. B 96(4): 584-607 (2006) |
| 75 | EE | András Gyárfás,
Miklós Ruszinkó,
Gábor N. Sárközy,
Endre Szemerédi:
An improved bound for the monochromatic cycle partition number.
J. Comb. Theory, Ser. B 96(6): 855-873 (2006) |
| 2005 |
|---|
| 74 | EE | Endre Szemerédi,
Andrzej Rucinski,
Vojtech Rödl:
The Generalization of Dirac's Theorem for Hypergraphs.
MFCS 2005: 52-56 |
| 2003 |
|---|
| 73 | EE | Béla Csaba,
Ali Shokoufandeh,
Endre Szemerédi:
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three.
Combinatorica 23(1): 35-72 (2003) |
| 72 | EE | Gábor N. Sárközy,
Stanley M. Selkow,
Endre Szemerédi:
On the number of Hamiltonian cycles in Dirac graphs.
Discrete Mathematics 265(1-3): 237-250 (2003) |
| 2002 |
|---|
| 71 | EE | Ayman Khalfalah,
Sachin Lodha,
Endre Szemerédi:
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square.
Discrete Mathematics 256(1-2): 243-255 (2002) |
| 2001 |
|---|
| 70 | EE | Noga Alon,
Michael R. Capalbo,
Yoshiharu Kohayakawa,
Vojtech Rödl,
Andrzej Rucinski,
Endre Szemerédi:
Near-optimum Universal Graphs for Graphs with Bounded Degrees.
RANDOM-APPROX 2001: 170-180 |
| 69 | | János Komlós,
Gábor N. Sárközy,
Endre Szemerédi:
Spanning Trees In Dense Graphs.
Combinatorics, Probability & Computing 10(5): (2001) |
| 68 | 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 |
|---|
| 67 | | Noga Alon,
Michael R. Capalbo,
Yoshiharu Kohayakawa,
Vojtech Rödl,
Andrzej Rucinski,
Endre Szemerédi:
Universality and Tolerance.
FOCS 2000: 14-21 |
| 66 | 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 |
| 65 | EE | Vojtech Rödl,
Endre Szemerédi:
On Size Ramsey Numbers of Graphs with Bounded Degree.
Combinatorica 20(2): 257-262 (2000) |
| 1998 |
|---|
| 64 | | Tomasz Luczak,
Vojtech Rödl,
Endre Szemerédi:
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.
Combinatorics, Probability & Computing 7(4): 423-436 (1998) |
| 63 | | 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) |
| 62 | 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 |
|---|
| 61 | | János Komlós,
Gábor N. Sárközy,
Endre Szemerédi:
Blow-Up Lemma.
Combinatorica 17(1): 109-123 (1997) |
| 1996 |
|---|
| 60 | | 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 |
| 59 | | János Komlós,
Endre Szemerédi:
Topological cliques in graphs 2.
Combinatorics, Probability & Computing 5: 79-90 (1996) |
| 58 | | 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 |
|---|
| 57 | EE | Nabil Kahale,
Frank Thomson Leighton,
Yuan Ma,
C. Greg Plaxton,
Torsten Suel,
Endre Szemerédi:
Lower bounds for sorting networks.
STOC 1995: 437-446 |
| 56 | | 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) |
| 55 | EE | László Pyber,
Vojtech Rödl,
Endre Szemerédi:
Dense Graphs without 3-Regular Subgraphs.
J. Comb. Theory, Ser. B 63(1): 41-54 (1995) |
| 1994 |
|---|
| 54 | | Antal Balog,
Endre Szemerédi:
A Statistical Theorem of Set Addition.
Combinatorica 14(3): 263-268 (1994) |
| 53 | | János Komlós,
Endre Szemerédi:
Topological Cliques in Graphs.
Combinatorics, Probability & Computing 3: 247-256 (1994) |
| 52 | | Paul Erdös,
András Hajnal,
Miklós Simonovits,
Vera T. Sós,
Endre Szemerédi:
Turán-Ramsey Theorems and Kp-Independence Numbers.
Combinatorics, Probability & Computing 3: 297-325 (1994) |
| 1993 |
|---|
| 51 | | Paul Erdös,
András Hajnal,
Miklós Simonovits,
Vera T. Sós,
Endre Szemerédi:
Turán-Ramsey theorems and simple asymptotically extremal structures.
Combinatorica 13(1): 31-56 (1993) |
| 50 | | Alexander A. Razborov,
Endre Szemerédi,
Avi Wigderson:
Constructing Small Sets that are Uniform in Arithmetic Progressions.
Combinatorics, Probability & Computing 2: 513-518 (1993) |
| 49 | | Wolfgang Maass,
Georg Schnitger,
Endre Szemerédi,
György Turán:
Two Tapes Versus One for Off-Line Turing Machines.
Computational Complexity 3: 392-401 (1993) |
| 1992 |
|---|
| 48 | | Noam Nisan,
Endre Szemerédi,
Avi Wigderson:
Undirected Connectivity in O(log ^1.5 n) Space
FOCS 1992: 24-29 |
| 47 | | Miklós Ajtai,
János Komlós,
Endre Szemerédi:
Halvers and Expanders
FOCS 1992: 686-692 |
| 46 | | Miklós Ajtai,
Noga Alon,
Jehoshua Bruck,
Robert Cypher,
Ching-Tien Ho,
Moni Naor,
Endre Szemerédi:
Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths
FOCS 1992: 693-702 |
| 45 | | Fan R. K. Chung,
Endre Szemerédi,
William T. Trotter:
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
Discrete & Computational Geometry 7: 1-11 (1992) |
| 44 | | János Pach,
William L. Steiger,
Endre Szemerédi:
An Upper Bound on the Number of Planar K-Sets.
Discrete & Computational Geometry 7: 109-123 (1992) |
| 1990 |
|---|
| 43 | | Péter Hajnal,
Endre Szemerédi:
Brooks Coloring in Parallel.
SIAM J. Discrete Math. 3(1): 74-80 (1990) |
| 42 | | László Babai,
Pavel Pudlák,
Vojtech Rödl,
Endre Szemerédi:
Lower Bounds to the Complexity of Symmetric Boolean Functions.
Theor. Comput. Sci. 74(3): 313-323 (1990) |
| 1989 |
|---|
| 41 | | János Pach,
William L. Steiger,
Endre Szemerédi:
An Upper Bound on the Number of Planar k-Sets
FOCS 1989: 72-79 |
| 40 | | Joel Friedman,
Jeff Kahn,
Endre Szemerédi:
On the Second Eigenvalue in Random Regular Graphs
STOC 1989: 587-598 |
| 39 | | Zvi Galil,
Ravi Kannan,
Endre Szemerédi:
On 3-pushdown graphs with large separators.
Combinatorica 9(1): 9-19 (1989) |
| 38 | | Mihály Geréb-Graus,
Ramamohan Paturi,
Endre Szemerédi:
There are no p-Complete Families of Symmetric Boolean Functions.
Inf. Process. Lett. 30(1): 47-49 (1989) |
| 37 | | 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) |
| 36 | | Zvi Galil,
Ravi Kannan,
Endre Szemerédi:
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines.
J. Comput. Syst. Sci. 38(1): 134-149 (1989) |
| 35 | | Richard Cole,
Jeffrey S. Salowe,
William L. Steiger,
Endre Szemerédi:
An Optimal-Time Algorithm for Slope Selection.
SIAM J. Comput. 18(4): 792-810 (1989) |
| 34 | | 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 |
|---|
| 33 | EE | Richard Cole,
Jeffrey S. Salowe,
William L. Steiger,
Endre Szemerédi:
Optimal Slope Selection.
ICALP 1988: 133-146 |
| 32 | | Janos Pintz,
William L. Steiger,
Endre Szemerédi:
Two Infinite Sets of Primes with Fast Primality Tests
STOC 1988: 504-509 |
| 31 | EE | Vasek Chvátal,
Endre Szemerédi:
Many Hard Examples for Resolution.
J. ACM 35(4): 759-768 (1988) |
| 30 | | Prabhakar Ragde,
William L. Steiger,
Endre Szemerédi,
Avi Wigderson:
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).
SIAM J. Discrete Math. 1(3): 399-410 (1988) |
| 1987 |
|---|
| 29 | | Miklós Ajtai,
János Komlós,
Endre Szemerédi:
Deterministic Simulation in LOGSPACE
STOC 1987: 132-140 |
| 28 | | Wolfgang Maass,
Georg Schnitger,
Endre Szemerédi:
Two Tapes Are Better than One for Off-Line Turing Machines
STOC 1987: 94-100 |
| 27 | | László Babai,
Péter Hajnal,
Endre Szemerédi,
György Turán:
A Lower Bound for Read-Once-Only Branching Programs.
J. Comput. Syst. Sci. 35(2): 153-162 (1987) |
| 1986 |
|---|
| 26 | | 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 |
| 25 | | 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 |
| 24 | | Zvi Galil,
Ravi Kannan,
Endre Szemerédi:
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines
STOC 1986: 39-49 |
| 1985 |
|---|
| 23 | | András Gyárfás,
Hans Jürgen Prömel,
Endre Szemerédi,
Bernd Voigt:
On the sum of the reciprocals of cycle lengths in sparse graphs.
Combinatorica 5(1): 41-52 (1985) |
| 1984 |
|---|
| 22 | | László Babai,
Endre Szemerédi:
On the Complexity of Matrix Group Problems I
FOCS 1984: 229-240 |
| 21 | | Henry A. Kierstead,
Endre Szemerédi,
William T. Trotter:
On coloring graphs with locally small chromatic number.
Combinatorica 4(2): 183-185 (1984) |
| 20 | 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 |
|---|
| 19 | | Wolfgang J. Paul,
Nicholas Pippenger,
Endre Szemerédi,
William T. Trotter:
On Determinism versus Non-Determinism and Related Problems (Preliminary Version)
FOCS 1983: 429-438 |
| 18 | | Miklós Ajtai,
János Komlós,
Endre Szemerédi:
An O(n log n) Sorting Network
STOC 1983: 1-9 |
| 17 | | Miklós Ajtai,
János Komlós,
Endre Szemerédi:
Sorting in c log n parallel sets.
Combinatorica 3(1): 1-19 (1983) |
| 16 | | Paul Erdös,
András Hajnal,
Vera T. Sós,
Endre Szemerédi:
More results on Ramsey - Turán Type problems.
Combinatorica 3(1): 69-81 (1983) |
| 15 | | Endre Szemerédi,
William T. Trotter:
Extremal problems in discrete geometry.
Combinatorica 3(3): 381-392 (1983) |
| 14 | 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) |
| 13 | EE | C. Chvatál,
Vojtech Rödl,
Endre Szemerédi,
W. T. Trotter Jr.:
The Ramsey number of a graph with bounded maximum degree.
J. Comb. Theory, Ser. B 34(3): 239-243 (1983) |
| 12 | EE | Vasek Chvátal,
Endre Szemerédi:
Short cycles in directed graphs.
J. Comb. Theory, Ser. B 35(3): 323-327 (1983) |
| 1982 |
|---|
| 11 | | 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 |
| 10 | | Miklós Ajtai,
János Komlós,
Endre Szemerédi:
Largest random component of a k-cube.
Combinatorica 2(1): 1-7 (1982) |
| 9 | | 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 |
|---|
| 8 | | Miklós Ajtai,
János Komlós,
Endre Szemerédi:
The longest path in a random graph.
Combinatorica 1(1): 1-12 (1981) |
| 7 | | 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 |
|---|
| 6 | | 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 |
|---|
| 5 | | 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) |
| 4 | | Paul Erdös,
Endre Szemerédi:
Combinatorial Properties of Systems of Sets.
J. Comb. Theory, Ser. A 24(3): 308-313 (1978) |
| 3 | EE | Ronald L. Graham,
Endre Szemerédi:
On subgraph number independence in trees.
J. Comb. Theory, Ser. B 24(2): 213-222 (1978) |
| 2 | | Leonidas J. Guibas,
Endre Szemerédi:
The Analysis of Double Hashing.
J. Comput. Syst. Sci. 16(2): 226-274 (1978) |
| 1976 |
|---|
| 1 | | Leonidas J. Guibas,
Endre Szemerédi:
The Analysis of Double Hashing (Extended Abstract)
STOC 1976: 187-191 |
