Endre Szemerédi

110 papers A* 20A 1B 1C 1Journal 85Unranked 1
YearRankTypeTitle / Venue / Authors
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
2016 — ch.
Erdős's Unit Distance Problem.
Open Problems in Mathematics
Endre Szemerédi
2016 J jnl
Structural Approach to Subset Sum Problems.
Found. Comput. Math.
Endre Szemerédi
2013 C conf
Various Regularity Lemmas in Graphs and Hypergraphs.
CiE
Endre Szemerédi
2012 J jnl
A Practical Regularity Partitioning Algorithm and its Applications in Clustering
CoRR
Gábor N. Sárközy, Fei Song, Endre Szemerédi, Shubhendu Trivedi
2011 J jnl
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.
Electron. J. Comb.
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2010 J jnl
A fast algorithm for equitable coloring.
Comb.
Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi
2010 J jnl
How to avoid using the Regularity Lemma: Pósa's conjecture revisited.
Discret. Math.
Ian Levitt, Gábor N. Sárközy, Endre Szemerédi
2010 J jnl
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.
Graphs Comb.
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
2010 J jnl
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.
J. Graph Theory
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
2009 J jnl
Perfect matchings in large uniform hypergraphs with large minimum collective degree.
J. Comb. Theory A
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2009 J jnl
Stability of the path-path Ramsey number.
Discret. Math.
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
2008 J jnl
An approximate Dirac-type theorem for
Comb.
Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski
2008 J jnl
Quadripartite version of the Hajnal-Szemerédi theorem.
Discret. Math.
Ryan R. Martin, Endre Szemerédi
2008 J jnl
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.
Electron. J. Comb.
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
2008 J jnl
Three-color Ramsey numbers for paths.
Comb.
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2007 J jnl
Three-Color Ramsey Numbers For Paths.
Comb.
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2007 J jnl
Tripartite Ramsey numbers for paths.
J. Graph Theory
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2006 J jnl
A Dirac-Type Theorem for 3-Uniform Hypergraphs.
Comb. Probab. Comput.
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2006 J jnl
An improved bound for the monochromatic cycle partition number.
J. Comb. Theory B
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2006 J jnl
Limit distribution for the existence of Hamiltonian cycles in a random graph.
Discret. Math.
János Komlós, Endre Szemerédi
2006 J jnl
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$.
Comb. Probab. Comput.
Ayman Khalfalah, Endre Szemerédi
2006 J jnl
Perfect matchings in uniform hypergraphs with large minimum degree.
Eur. J. Comb.
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2006 J jnl
Short paths in quasi-random triple systems with sparse underlying graphs.
J. Comb. Theory B
Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2005 B conf
The Generalization of Dirac's Theorem for Hypergraphs.
MFCS
Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl
2003 J jnl
On the number of Hamiltonian cycles in Dirac graphs.
Discret. Math.
Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi
2003 J jnl
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three.
Comb.
Béla Csaba, Ali Shokoufandeh, Endre Szemerédi
2002 J jnl
Girth of sparse graphs.
J. Graph Theory
Béla Bollobás, Endre Szemerédi
2002 J jnl
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square.
Discret. Math.
Ayman Khalfalah, Sachin Lodha, Endre Szemerédi
2001 — conf
Near-optimum Universal Graphs for Graphs with Bounded Degrees.
RANDOM-APPROX
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, 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
Spanning Trees In Dense Graphs.
Comb. Probab. Comput.
János Komlós, Gábor N. Sárközy, Endre Szemerédi
2000 J jnl
On Size Ramsey Numbers of Graphs with Bounded Degree.
Comb.
Vojtech Rödl, 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 A* conf
Universality and Tolerance.
FOCS
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
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
1998 J jnl
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.
Comb. Probab. Comput.
Tomasz Luczak, Vojtech Rödl, Endre Szemerédi
1997 J jnl
Blow-Up Lemma.
Comb.
János Komlós, Gábor N. Sárközy, Endre Szemerédi
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
Dense Graphs without 3-Regular Subgraphs.
J. Comb. Theory B
László Pyber, Vojtech Rödl, Endre Szemerédi
1995 A* conf
Lower bounds for sorting networks.
STOC
Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
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
A Statistical Theorem of Set Addition.
Comb.
Antal Balog, Endre Szemerédi
1994 J jnl
Topological Cliques in Graphs.
Comb. Probab. Comput.
János Komlós, Endre Szemerédi
1994 J jnl
Turán-Ramsey Theorems and K
Comb. Probab. Comput.
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
1993 J jnl
Constructing Small Sets that are Uniform in Arithmetic Progressions.
Comb. Probab. Comput.
Alexander A. Razborov, Endre Szemerédi, Avi Wigderson
1993 J jnl
Turán-Ramsey theorems and simple asymptotically extremal structures.
Comb.
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
1993 J jnl
Two Tapes Versus One for Off-Line Turing Machines.
Comput. Complex.
Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán
1992 J jnl
An Upper Bound on the Number of Planar K-Sets.
Discret. Comput. Geom.
János Pach, William L. Steiger, Endre Szemerédi
1992 A* conf
Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths
FOCS
Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi
1992 A* conf
Halvers and Expanders
FOCS
Miklós Ajtai, János Komlós, Endre Szemerédi
1992 J jnl
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
Discret. Comput. Geom.
Fan R. K. Chung, Endre Szemerédi, William T. Trotter
1992 A* conf
Undirected Connectivity in O(log ^1.5 n) Space
FOCS
Noam Nisan, Endre Szemerédi, Avi Wigderson
1990 J jnl
Brooks Coloring in Parallel.
SIAM J. Discret. Math.
Péter Hajnal, Endre Szemerédi
1990 J jnl
Lower Bounds to the Complexity of Symmetric Boolean Functions.
Theor. Comput. Sci.
László Babai, Pavel Pudlák, Vojtech Rödl, 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
An Optimal-Time Algorithm for Slope Selection.
SIAM J. Comput.
Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
1989 A* conf
An Upper Bound on the Number of Planar k-Sets
FOCS
János Pach, William L. Steiger, Endre Szemerédi
1989 J jnl
On 3-pushdown graphs with large separators.
Comb.
Zvi Galil, Ravi Kannan, Endre Szemerédi
1989 J jnl
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines.
J. Comput. Syst. Sci.
Zvi Galil, Ravi Kannan, Endre Szemerédi
1989 A* conf
On the Second Eigenvalue in Random Regular Graphs
STOC
Joel Friedman, Jeff Kahn, 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
1989 J jnl
There are no p-Complete Families of Symmetric Boolean Functions.
Inf. Process. Lett.
Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi
1988 J jnl
Many Hard Examples for Resolution.
J. ACM
Vasek Chvátal, Endre Szemerédi
1988 A* conf
Optimal Slope Selection.
ICALP
Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
1988 J jnl
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).
SIAM J. Discret. Math.
Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
1988 A* conf
Two Infinite Sets of Primes with Fast Primality Tests
STOC
Janos Pintz, William L. Steiger, Endre Szemerédi
1987 J jnl
A Lower Bound for Read-Once-Only Branching Programs.
J. Comput. Syst. Sci.
László Babai, Péter Hajnal, Endre Szemerédi, György Turán
1987 A* conf
Deterministic Simulation in LOGSPACE
STOC
Miklós Ajtai, János Komlós, Endre Szemerédi
1987 A* conf
Two Tapes Are Better than One for Off-Line Turing Machines
STOC
Wolfgang Maass, Georg Schnitger, 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
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines
STOC
Zvi Galil, Ravi Kannan, 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
On the sum of the reciprocals of cycle lengths in sparse graphs.
Comb.
András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt
1984 J jnl
On coloring graphs with locally small chromatic number.
Comb.
Henry A. Kierstead, Endre Szemerédi, William T. Trotter
1984 A* conf
On the Complexity of Matrix Group Problems I
FOCS
László Babai, Endre Szemerédi
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 J jnl
A Combinatorial Distinction Between the Euclidean and Projective Planes.
Eur. J. Comb.
Endre Szemerédi, William T. Trotter
1983 A* conf
An O(n log n) Sorting Network
STOC
Miklós Ajtai, János Komlós, Endre Szemerédi
1983 J jnl
Extremal problems in discrete geometry.
Comb.
Endre Szemerédi, William T. Trotter
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
More results on Ramsey - Turán Type problems.
Comb.
Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi
1983 A* conf
On Determinism versus Non-Determinism and Related Problems (Preliminary Version)
FOCS
Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter
1983 J jnl
Short cycles in directed graphs.
J. Comb. Theory B
Vasek Chvátal, Endre Szemerédi
1983 J jnl
Sorting in c log n parallel sets.
Comb.
Miklós Ajtai, János Komlós, Endre Szemerédi
1983 J jnl
The Ramsey number of a graph with bounded maximum degree.
J. Comb. Theory B
C. Chvatál, Vojtech Rödl, Endre Szemerédi, William T. Trotter
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 J jnl
On an Extremal Problem Concerning Intervals.
Eur. J. Comb.
Václav Chvátal, 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 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
1980 J jnl
Induced subtrees in graphs of large chromatic number.
Discret. Math.
András Gyárfás, Endre Szemerédi, Zsolt Tuza
1978 J jnl
Combinatorial Properties of Systems of Sets.
J. Comb. Theory A
Paul Erdös, Endre Szemerédi
1978 J jnl
On subgraph number independence in trees.
J. Comb. Theory B
Ronald L. Graham, Endre Szemerédi
1978 J jnl
The Analysis of Double Hashing.
J. Comput. Syst. Sci.
Leonidas J. Guibas, 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
1976 A* conf
The Analysis of Double Hashing (Extended Abstract)
STOC
Leonidas J. Guibas, Endre Szemerédi
1975 J jnl
On complete subgraphs of r-chromatic graphs.
Discret. Math.
Béla Bollobás, Paul Erdös, Endre Szemerédi