Endre Szemerédi

Found. Comput. Math., 2016

Erdős's Unit Distance Problem.

[BibT_eX]

[DOI]

Proceedings of the Open Problems in Mathematics., 2016

2013

Various Regularity Lemmas in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

A Practical Regularity Partitioning Algorithm and its Applications in Clustering

[BibT_eX]

[DOI]

CoRR, 2012

2011

Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2010

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

[BibT_eX]

[DOI]

Ian Levitt

Discret. Math., 2010

A fast algorithm for equitable coloring.

[BibT_eX]

[DOI]

Henry A. Kierstead

Alexandr V. Kostochka

Marcelo Mydlarz

Comb., 2010

2009

Perfect matchings in large uniform hypergraphs with large minimum collective degree.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2009

Stability of the path-path Ramsey number.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Quadripartite version of the Hajnal-Szemerédi theorem.

[BibT_eX]

[DOI]

Ryan R. Martin

Discret. Math., 2008

The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

An approximate Dirac-type theorem for <i>k</i> -uniform hypergraphs.

[BibT_eX]

[DOI]

Comb., 2008

2007

Tripartite Ramsey numbers for paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Three-Color Ramsey Numbers For Paths.

[BibT_eX]

[DOI]

Comb., 2007

2006

Short paths in quasi-random triple systems with sparse underlying graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

An improved bound for the monochromatic cycle partition number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Perfect matchings in uniform hypergraphs with large minimum degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

A Dirac-Type Theorem for 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$.

[BibT_eX]

[DOI]

Ayman Khalfalah

Comb. Probab. Comput., 2006

2005

The Generalization of Dirac's Theorem for Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2003

On the number of Hamiltonian cycles in Dirac graphs.

[BibT_eX]

[DOI]

Stanley M. Selkow

Discret. Math., 2003

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

[BibT_eX]

[DOI]

Béla Csaba

Ali Shokoufandeh

Comb., 2003

2002

Girth of sparse graphs.

[BibT_eX]

[DOI]

Béla Bollobás

J. Graph Theory, 2002

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

[BibT_eX]

[DOI]

Ayman Khalfalah

Sachin Lodha

Discret. Math., 2002

2001

Proof of the Alon-Yuster conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2001

Spanning Trees In Dense Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

2000

On Size Ramsey Numbers of Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Comb., 2000

Universality and Tolerance.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

The Regularity Lemma and Its Applications in Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Science, 2000

1998

Matching Nuts and Bolts in O(n log n) Time.

[BibT_eX]

[DOI]

Yuan Ma

SIAM J. Discret. Math., 1998

An algorithmic version of the blow-up lemma.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

On the Pósa-Seymour conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.

[BibT_eX]

[DOI]

Tomasz Luczak

Comb. Probab. Comput., 1998

1997

Blow-Up Lemma.

[BibT_eX]

[DOI]

Comb., 1997

1996

On the square of a Hamiltonian cycle in dense graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Topological cliques in graphs 2.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

Matching Nuts and Bolts in O(n log n) Time (Extended Abstract).

[BibT_eX]

[DOI]

Yuan Ma

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Dense Graphs without 3-Regular Subgraphs.

[BibT_eX]

[DOI]

László Pyber

J. Comb. Theory B, 1995

proof of a Packing Conjecture of Bollobás.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

Lower bounds for sorting networks.

[BibT_eX]

[DOI]

Nabil Kahalé

Frank Thomson Leighton

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Topological Cliques in Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

Turán-Ramsey Theorems and K<sup>p</sup>-Independence Numbers.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

A Statistical Theorem of Set Addition.

[BibT_eX]

[DOI]

Antal Balog

Comb., 1994

1993

Constructing Small Sets that are Uniform in Arithmetic Progressions.

[BibT_eX]

[DOI]

Alexander A. Razborov

Avi Wigderson

Comb. Probab. Comput., 1993

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

[BibT_eX]

[DOI]

Comb., 1993

Two Tapes Versus One for Off-Line Turing Machines.

[BibT_eX]

[DOI]

Comput. Complex., 1993

1992

The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.

[BibT_eX]

[DOI]

Fan R. K. Chung

Discret. Comput. Geom., 1992

Undirected Connectivity in O(log ^1.5 n) Space

[BibT_eX]

[DOI]

Noam Nisan

Avi Wigderson

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

Halvers and Expanders

[BibT_eX]

[DOI]

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

Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths

[BibT_eX]

[DOI]

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

1990

Lower Bounds to the Complexity of Symmetric Boolean Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Brooks Coloring in Parallel.

[BibT_eX]

[DOI]

Péter Hajnal

SIAM J. Discret. Math., 1990

1989

Sorting in Average Time o(log) n.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

An Optimal-Time Algorithm for Slope Selection.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Optimal Parallel Selection has Complexity O(Log Log n).

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1989

There are no p-Complete Families of Symmetric Boolean Functions.

[BibT_eX]

[DOI]

Mihály Geréb-Graus

Ramamohan Paturi

Inf. Process. Lett., 1989

On 3-pushdown graphs with large separators.

[BibT_eX]

[DOI]

Zvi Galil

Ravi Kannan

Comb., 1989

Almost Sorting in one Round.

[BibT_eX]

Adv. Comput. Res., 1989

On the Second Eigenvalue in Random Regular Graphs

[BibT_eX]

[DOI]

Joel Friedman

Jeff Kahn

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

An Upper Bound on the Number of Planar k-Sets

[BibT_eX]

[DOI]

János Pach

William L. Steiger

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

Many Hard Examples for Resolution.

[BibT_eX]

[DOI]

Vasek Chvátal

J. ACM, 1988

Two Infinite Sets of Primes with Fast Primality Tests

[BibT_eX]

[DOI]

Janos Pintz

William L. Steiger

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Optimal Slope Selection.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

A Lower Bound for Read-Once-Only Branching Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1987

Two Tapes Are Better than One for Off-Line Turing Machines

[BibT_eX]

[DOI]

Wolfgang Maass

Georg Schnitger

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Deterministic Simulation in LOGSPACE

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

Zvi Galil

Ravi Kannan

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Deterministic Selection in O(log log N) Parallel Time

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Two lower bounds for branching programs

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Comb., 1985

1984

On the distribution of cycle lengths in graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1984

Storing a Sparse Table with 0(1) Worst Case Access Time.

[BibT_eX]

[DOI]

Michael L. Fredman

J. ACM, 1984

On coloring graphs with locally small chromatic number.

[BibT_eX]

[DOI]

Henry A. Kierstead

Comb., 1984

On the Complexity of Matrix Group Problems I

[BibT_eX]

[DOI]

László Babai

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Short cycles in directed graphs.

[BibT_eX]

[DOI]

Vasek Chvátal

J. Comb. Theory B, 1983

The Ramsey number of a graph with bounded maximum degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

A Combinatorial Distinction Between the Euclidean and Projective Planes.

[BibT_eX]

[DOI]

Eur. J. Comb., 1983

Limit distribution for the existence of hamiltonian cycles in a random graph.

[BibT_eX]

[DOI]

Discret. Math., 1983

Extremal problems in discrete geometry.

[BibT_eX]

[DOI]

Comb., 1983

More results on Ramsey - Turán Type problems.

[BibT_eX]

[DOI]

Comb., 1983

Sorting in c log n parallel sets.

[BibT_eX]

[DOI]

Comb., 1983

An O(n log n) Sorting Network

[BibT_eX]

[DOI]

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

On Determinism versus Non-Determinism and Related Problems (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

Extremal Uncrowded Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1982

On an Extremal Problem Concerning Intervals.

[BibT_eX]

[DOI]

Václav Chvátal

Eur. J. Comb., 1982

Largest random component of a k-cube.

[BibT_eX]

[DOI]

Comb., 1982

Storing a Sparse Table with O(1) Worst Case Access Time

[BibT_eX]

[DOI]

Michael L. Fredman

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981

A Dense Infinite Sidon Sequence.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

The longest path in a random graph.

[BibT_eX]

[DOI]

Comb., 1981

On Turáns theorem for sparse graphs.

[BibT_eX]

[DOI]

Comb., 1981

1980

A Note on Ramsey Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1980

Induced subtrees in graphs of large chromatic number.

[BibT_eX]

[DOI]

Zsolt Tuza

Discret. Math., 1980

1978

On subgraph number independence in trees.

[BibT_eX]

[DOI]

Ronald L. Graham

J. Comb. Theory B, 1978

Combinatorial Properties of Systems of Sets.

[BibT_eX]

[DOI]

Paul Erdös

J. Comb. Theory A, 1978

The Analysis of Double Hashing.

[BibT_eX]

[DOI]

Leonidas J. Guibas

J. Comput. Syst. Sci., 1978

There is no Fast Single Hashing Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1978

1976

The Analysis of Double Hashing (Extended Abstract)

[BibT_eX]

[DOI]

Leonidas J. Guibas

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975

On complete subgraphs of r-chromatic graphs.

[BibT_eX]

[DOI]

Béla Bollobás

Paul Erdös