Endre Szemerédi

According to our database1, Endre Szemerédi authored at least 108 papers between 1975 and 2017.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.
SIAM J. Discrete Math., 2017

2016
Structural Approach to Subset Sum Problems.
Foundations of Computational Mathematics, 2016

2013
Various Regularity Lemmas in Graphs and Hypergraphs.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2011
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.
Electr. J. Comb., 2011

2010
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.
Journal of Graph Theory, 2010

Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.
Graphs and Combinatorics, 2010

How to avoid using the Regularity Lemma: Pósa's conjecture revisited.
Discrete Mathematics, 2010

A fast algorithm for equitable coloring.
Combinatorica, 2010

2009
Perfect matchings in large uniform hypergraphs with large minimum collective degree.
J. Comb. Theory, Ser. A, 2009

Stability of the path-path Ramsey number.
Discrete Mathematics, 2009

2008
Quadripartite version of the Hajnal-Szemerédi theorem.
Discrete Mathematics, 2008

The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.
Electr. J. Comb., 2008

An approximate Dirac-type theorem for k -uniform hypergraphs.
Combinatorica, 2008

Three-color Ramsey numbers for paths.
Combinatorica, 2008

2007
Tripartite Ramsey numbers for paths.
Journal of Graph Theory, 2007

Three-Color Ramsey Numbers For Paths.
Combinatorica, 2007

2006
Short paths in quasi-random triple systems with sparse underlying graphs.
J. Comb. Theory, Ser. B, 2006

An improved bound for the monochromatic cycle partition number.
J. Comb. Theory, Ser. B, 2006

Perfect matchings in uniform hypergraphs with large minimum degree.
Eur. J. Comb., 2006

Limit distribution for the existence of Hamiltonian cycles in a random graph.
Discrete Mathematics, 2006

A Dirac-Type Theorem for 3-Uniform Hypergraphs.
Combinatorics, Probability & Computing, 2006

On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$.
Combinatorics, Probability & Computing, 2006

2005
The Generalization of Dirac's Theorem for Hypergraphs.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2003
On the number of Hamiltonian cycles in Dirac graphs.
Discrete Mathematics, 2003

Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three.
Combinatorica, 2003

2002
Girth of sparse graphs.
Journal of Graph Theory, 2002

Tight bound for the density of sequence of integers the sum of no two of which is a perfect square.
Discrete Mathematics, 2002

2001
Proof of the Alon-Yuster conjecture.
Discrete Mathematics, 2001

Spanning Trees In Dense Graphs.
Combinatorics, Probability & Computing, 2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.
Proceedings of the Approximation, 2001

2000
On Size Ramsey Numbers of Graphs with Bounded Degree.
Combinatorica, 2000

Universality and Tolerance.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

The Regularity Lemma and Its Applications in Graph Theory.
Proceedings of the Theoretical Aspects of Computer Science, 2000

1998
Matching Nuts and Bolts in O(n log n) Time.
SIAM J. Discrete Math., 1998

An algorithmic version of the blow-up lemma.
Random Struct. Algorithms, 1998

On the Pósa-Seymour conjecture.
Journal of Graph Theory, 1998

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.
Combinatorics, Probability & Computing, 1998

1997
Blow-Up Lemma.
Combinatorica, 1997

1996
On the square of a Hamiltonian cycle in dense graphs.
Random Struct. Algorithms, 1996

Topological cliques in graphs 2.
Combinatorics, Probability & Computing, 1996

Matching Nuts and Bolts in O(n log n) Time (Extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
Dense Graphs without 3-Regular Subgraphs.
J. Comb. Theory, Ser. B, 1995

proof of a Packing Conjecture of Bollobás.
Combinatorics, Probability & Computing, 1995

Lower bounds for sorting networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Topological Cliques in Graphs.
Combinatorics, Probability & Computing, 1994

Turán-Ramsey Theorems and Kp-Independence Numbers.
Combinatorics, Probability & Computing, 1994

A Statistical Theorem of Set Addition.
Combinatorica, 1994

1993
Constructing Small Sets that are Uniform in Arithmetic Progressions.
Combinatorics, Probability & Computing, 1993

Turán-Ramsey theorems and simple asymptotically extremal structures.
Combinatorica, 1993

Two Tapes Versus One for Off-Line Turing Machines.
Computational Complexity, 1993

1992
An Upper Bound on the Number of Planar K-Sets.
Discrete & Computational Geometry, 1992

The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
Discrete & Computational Geometry, 1992

Undirected Connectivity in O(log ^1.5 n) Space
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Halvers and Expanders
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990
Lower Bounds to the Complexity of Symmetric Boolean Functions.
Theor. Comput. Sci., 1990

Brooks Coloring in Parallel.
SIAM J. Discrete Math., 1990

1989
Sorting in Average Time o(log) n.
SIAM J. Discrete Math., 1989

An Optimal-Time Algorithm for Slope Selection.
SIAM J. Comput., 1989

On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines.
J. Comput. Syst. Sci., 1989

Optimal Parallel Selection has Complexity O(Log Log n).
J. Comput. Syst. Sci., 1989

There are no p-Complete Families of Symmetric Boolean Functions.
Inf. Process. Lett., 1989

On 3-pushdown graphs with large separators.
Combinatorica, 1989

Almost Sorting in one Round.
Advances in Computing Research, 1989

On the Second Eigenvalue in Random Regular Graphs
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

An Upper Bound on the Number of Planar k-Sets
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).
SIAM J. Discrete Math., 1988

Many Hard Examples for Resolution.
J. ACM, 1988

Two Infinite Sets of Primes with Fast Primality Tests
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Optimal Slope Selection.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
A Lower Bound for Read-Once-Only Branching Programs.
J. Comput. Syst. Sci., 1987

Two Tapes Are Better than One for Off-Line Turing Machines
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Deterministic Simulation in LOGSPACE
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Deterministic Selection in O(log log N) Parallel Time
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Two lower bounds for branching programs
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
On the sum of the reciprocals of cycle lengths in sparse graphs.
Combinatorica, 1985

1984
On the distribution of cycle lengths in graphs.
Journal of Graph Theory, 1984

Storing a Sparse Table with 0(1) Worst Case Access Time.
J. ACM, 1984

On coloring graphs with locally small chromatic number.
Combinatorica, 1984

On the Complexity of Matrix Group Problems I
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Short cycles in directed graphs.
J. Comb. Theory, Ser. B, 1983

The Ramsey number of a graph with bounded maximum degree.
J. Comb. Theory, Ser. B, 1983

A Combinatorial Distinction Between the Euclidean and Projective Planes.
Eur. J. Comb., 1983

Limit distribution for the existence of hamiltonian cycles in a random graph.
Discrete Mathematics, 1983

Extremal problems in discrete geometry.
Combinatorica, 1983

More results on Ramsey - Turán Type problems.
Combinatorica, 1983

Sorting in c log n parallel sets.
Combinatorica, 1983

An O(n log n) Sorting Network
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

On Determinism versus Non-Determinism and Related Problems (Preliminary Version)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
Extremal Uncrowded Hypergraphs.
J. Comb. Theory, Ser. A, 1982

On an Extremal Problem Concerning Intervals.
Eur. J. Comb., 1982

Largest random component of a k-cube.
Combinatorica, 1982

Storing a Sparse Table with O(1) Worst Case Access Time
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
A Dense Infinite Sidon Sequence.
Eur. J. Comb., 1981

The longest path in a random graph.
Combinatorica, 1981

On Turáns theorem for sparse graphs.
Combinatorica, 1981

1980
A Note on Ramsey Numbers.
J. Comb. Theory, Ser. A, 1980

Induced subtrees in graphs of large chromatic number.
Discrete Mathematics, 1980

1978
On subgraph number independence in trees.
J. Comb. Theory, Ser. B, 1978

Combinatorial Properties of Systems of Sets.
J. Comb. Theory, Ser. A, 1978

The Analysis of Double Hashing.
J. Comput. Syst. Sci., 1978

There is no Fast Single Hashing Algorithm.
Inf. Process. Lett., 1978

1976
The Analysis of Double Hashing (Extended Abstract)
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975
On complete subgraphs of r-chromatic graphs.
Discrete Mathematics, 1975


  Loading...