Endre Szemerédi

Publication Activity (10 Years)

Years Active: 1975-2017
Publications (10 Years): 5

Top Venues

SIAM J. Discret. Math.

CoRR

Found. Comput. Math.

CiE

Publications

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)
Endre Szemerédi
Structural Approach to Subset Sum Problems. Found. Comput. Math. 16 (6) (2016)
Endre Szemerédi
Various Regularity Lemmas in Graphs and Hypergraphs. CiE (2013)
Gábor N. Sárközy, Fei Song, Endre Szemerédi, Shubhendu Trivedi
A Practical Regularity Partitioning Algorithm and its Applications in Clustering CoRR (2012)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. Electron. J. Comb. 18 (1) (2011)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. J. Graph Theory 63 (4) (2010)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs. Graphs Comb. 26 (1) (2010)
Ian Levitt, Gábor N. Sárközy, Endre Szemerédi
How to avoid using the Regularity Lemma: Pósa's conjecture revisited. Discret. Math. 310 (3) (2010)
Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi
A fast algorithm for equitable coloring. Comb. 30 (2) (2010)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
Stability of the path-path Ramsey number. Discret. Math. 309 (13) (2009)
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Comb. Theory, Ser. A 116 (3) (2009)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-color Ramsey numbers for paths. Comb. 28 (4) (2008)
Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski
-uniform hypergraphs. Comb. 28 (2) (2008)
Ryan R. Martin, Endre Szemerédi
Quadripartite version of the Hajnal-Szemerédi theorem. Discret. Math. 308 (19) (2008)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs. Electron. J. Comb. 15 (1) (2008)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Tripartite Ramsey numbers for paths. J. Graph Theory 55 (2) (2007)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-Color Ramsey Numbers For Paths. Comb. 27 (1) (2007)
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Perfect matchings in uniform hypergraphs with large minimum degree. Eur. J. Comb. 27 (8) (2006)
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) (2006)
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) (2006)
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
A Dirac-Type Theorem for 3-Uniform Hypergraphs. Comb. Probab. Comput. 15 (1-2) (2006)
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)
Ayman Khalfalah, Endre Szemerédi
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$. Comb. Probab. Comput. 15 (1-2) (2006)
Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl
The Generalization of Dirac's Theorem for Hypergraphs. MFCS (2005)
Béla Csaba, Ali Shokoufandeh, Endre Szemerédi
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. Comb. 23 (1) (2003)
Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi
On the number of Hamiltonian cycles in Dirac graphs. Discret. Math. 265 (1-3) (2003)
Béla Bollobás, Endre Szemerédi
Girth of sparse graphs. J. Graph Theory 39 (3) (2002)
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. Discret. Math. 256 (1-2) (2002)
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)
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)
Vojtech Rödl, Endre Szemerédi
On Size Ramsey Numbers of Graphs with Bounded Degree. Comb. 20 (2) (2000)
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Universality and Tolerance. FOCS (2000)
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, 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)
Tomasz Luczak, Vojtech Rödl, Endre Szemerédi
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. Comb. Probab. Comput. 7 (4) (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, 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)
László Pyber, Vojtech Rödl, Endre Szemerédi
Dense Graphs without 3-Regular Subgraphs. J. Comb. Theory, Ser. B 63 (1) (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)
Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
Lower bounds for sorting networks. STOC (1995)
Antal Balog, Endre Szemerédi
A Statistical Theorem of Set Addition. Comb. 14 (3) (1994)
János Komlós, Endre Szemerédi
Topological Cliques in Graphs. Comb. Probab. Comput. 3 (1994)
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
-Independence Numbers. Comb. Probab. Comput. 3 (1994)
Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán
Two Tapes Versus One for Off-Line Turing Machines. Comput. Complex. 3 (1993)
Alexander A. Razborov, Endre Szemerédi, Avi Wigderson
Constructing Small Sets that are Uniform in Arithmetic Progressions. Comb. Probab. Comput. 2 (1993)
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. Comb. 13 (1) (1993)
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)
Noam Nisan, Endre Szemerédi, Avi Wigderson
Undirected Connectivity in O(log ^1.5 n) Space FOCS (1992)
Miklós Ajtai, János Komlós, Endre Szemerédi
Halvers and Expanders FOCS (1992)
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. Discret. Comput. Geom. 7 (1992)
János Pach, William L. Steiger, Endre Szemerédi
An Upper Bound on the Number of Planar K-Sets. Discret. Comput. Geom. 7 (1992)
Péter Hajnal, Endre Szemerédi
Brooks Coloring in Parallel. SIAM J. Discret. Math. 3 (1) (1990)
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) (1990)
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) (1989)
Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
An Optimal-Time Algorithm for Slope Selection. SIAM J. Comput. 18 (4) (1989)
Zvi Galil, Ravi Kannan, Endre Szemerédi
On 3-pushdown graphs with large separators. Comb. 9 (1) (1989)
Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
Almost Sorting in one Round. Adv. Comput. Res. 5 (1989)
János Pach, William L. Steiger, Endre Szemerédi
An Upper Bound on the Number of Planar k-Sets FOCS (1989)
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) (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)
Joel Friedman, Jeff Kahn, Endre Szemerédi
On the Second Eigenvalue in Random Regular Graphs STOC (1989)
Janos Pintz, William L. Steiger, Endre Szemerédi
Two Infinite Sets of Primes with Fast Primality Tests STOC (1988)
Vasek Chvátal, Endre Szemerédi
Many Hard Examples for Resolution. J. ACM 35 (4) (1988)
Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
Optimal Slope Selection. ICALP (1988)
Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). SIAM J. Discret. Math. 1 (3) (1988)
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) (1987)
Miklós Ajtai, János Komlós, Endre Szemerédi
Deterministic Simulation in LOGSPACE STOC (1987)
Wolfgang Maass, Georg Schnitger, Endre Szemerédi
Two Tapes Are Better than One for Off-Line Turing Machines 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)
Zvi Galil, Ravi Kannan, Endre Szemerédi
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines STOC (1986)
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. Comb. 5 (1) (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)
László Babai, Endre Szemerédi
On the Complexity of Matrix Group Problems I FOCS (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)
Henry A. Kierstead, Endre Szemerédi, William T. Trotter
On coloring graphs with locally small chromatic number. Comb. 4 (2) (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)
Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi
More results on Ramsey - Turán Type problems. Comb. 3 (1) (1983)
Miklós Ajtai, János Komlós, Endre Szemerédi
An O(n log n) Sorting Network STOC (1983)
Vasek Chvátal, Endre Szemerédi
Short cycles in directed graphs. J. Comb. Theory, Ser. B 35 (3) (1983)
Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter
On Determinism versus Non-Determinism and Related Problems (Preliminary Version) FOCS (1983)
C. Chvatál, Vojtech Rödl, Endre Szemerédi, William T. Trotter
The Ramsey number of a graph with bounded maximum degree. J. Comb. Theory, Ser. B 34 (3) (1983)
Endre Szemerédi, William T. Trotter
A Combinatorial Distinction Between the Euclidean and Projective Planes. Eur. J. Comb. 4 (4) (1983)
Endre Szemerédi, William T. Trotter
Extremal problems in discrete geometry. Comb. 3 (3) (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)
Václav Chvátal, Endre Szemerédi
On an Extremal Problem Concerning Intervals. Eur. J. Comb. 3 (3) (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)

Endre Szemerédi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Endre Szemerédi