Endre Szemerédi | Academic Influence

Why Is Endre Szemerédi Influential?

According to Wikipedia, Endre Szemerédi is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science at Rutgers University since 1986. He also holds a professor emeritus status at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.

Endre Szemerédi's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

Regular Partitions of Graphs (1090)
On sets of integers containing k elements in arithmetic progression (1070)
Storing a sparse table with O(1) worst case access time (814)
An 0(n log n) sorting network (595)
Extremal problems in discrete geometry (533)
Many hard examples for resolution (531)
O(n LOG n) SORTING NETWORK. (452)
Sorting inc logn parallel steps (396)
A Note on Ramsey Numbers (343)
Crossing-Free Subgraphs (340)
Blow-up Lemma (277)
Deterministic simulation in LOGSPACE (248)
On the Complexity of Matrix Group Problems I (226)
A Dirac-Type Theorem for 3-Uniform Hypergraphs (219)
Sorting in c log n parallel sets (207)
On the probability that a random ±1-matrix is singular (206)
Unit distances in the Euclidean plane (182)
On sums and products of integers (175)
The Ramsey number of a graph with bounded maximum degree (174)
Theory of algorithms (168)
The Regularity Lemma and Its Applications in Graph Theory (161)
On the second eigenvalue of random regular graphs (159)
Limit distribution for the existence of Hamiltonian cycles in a random graph (154)
A Dense Infinite Sidon Sequence (148)
An Optimal-Time Algorithm for Slope Selection (148)
Proof of the Alon-Yuster conjecture (134)
Storing a Sparse Table with O(1) Worst Case Access Time (134)
A statistical theorem of set addition (133)
Proof of the Seymour conjecture for large graphs (131)
On determinism versus non-determinism and related problems (130)
Perfect matchings in large uniform hypergraphs with large minimum collective degree (127)
An approximate Dirac-type theorem for k-uniform hypergraphs (120)
Largest random component of ak-cube (117)
The longest path in a random graph (113)
A Lower Bound for Heilbronn'S Problem (111)
A Cure for the Telephone Disease (98)
Limit distribution for the existence of Hamiltonian cycles in a random graph (95)
On sparse graphs with dense long paths. (88)
Topological cliques in graphs 2 (85)
Extremal Uncrowded Hypergraphs (84)
Topological Cliques in Graphs (81)
An improved bound for the monochromatic cycle partition number (80)
On sets of integers containing no four elements in arithmetic progression (76)
Induced subtrees in graphs of large chromatic number (75)
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (74)
Two lower bounds for branching programs (73)
An upper bound on the number of planar k-sets (72)
Undirected connectivity in O(log/sup 1.5/n) space (69)
Three-Color Ramsey Numbers For Paths (68)
Perfect matchings in uniform hypergraphs with large minimum degree (68)
An algorithmic version of the blow-up lemma (68)
More results on Ramsey—Turán type problems (67)
A fast algorithm for equitable coloring (66)
On a problem of Davenport and Schinzel (65)
On Turán’s theorem for sparse graphs (63)
Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs (63)
On sets of natural numbers whose difference set contains no squares (62)
The Analysis of Double Hashing (61)
Undirected Connectivity in O(log ^1.5 n) Space (60)
proof of a Packing Conjecture of Bollobás (60)
The number of different distances determined by a set of points in the Euclidean plane (59)
On the Pósa-Seymour conjecture (58)
On the square of a Hamiltonian cycle in dense graphs (57)
Extremal Graphs without Large Forbidden Subgraphs (56)
How to avoid using the Regularity Lemma: Pósa's conjecture revisited (56)
On Size Ramsey Numbers of Graphs with Bounded Degree (54)
Undirected Connectivity in O(l~gl*~ n) Space* (51)
Three-color Ramsey numbers for paths (51)
Combinatorial Properties of Systems of Sets (49)
Integer sets containing no arithmetic progressions (49)
On a problem of graph theory (48)
On Heilbronn's Triangle Problem (48)
On a question of Erdős and Moser (46)
Linear problems in combinatorial number theory (45)
On complete subgraphs of r-chromatic graphs (45)
Universality and tolerance (45)
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles (44)
An algorithmic version of the blow-up lemma (44)
Sparse partition universal graphs for graphs of bounded degree (44)
Difference sets without κ-th powers (41)
Lower Bounds to the Complexity of Symmetric Boolean Functions (41)
Finite and infinite arithmetic progressions in sumsets (40)
On the square of a Hamiltonian cycle in dense graphs (39)
Dense Graphs without 3-Regular Subgraphs (39)
On a conjecture of Erdös and Heilbronn (38)
Matching nuts and bolts in O(n log n) time (38)
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines (36)
Long arithmetic progressions in sumsets: Thresholds and bounds (36)
Spanning Trees in Dense Graphs (35)
An upper bound on the number of planarK-sets (35)
Construction of a thin set with small fourier coefficients (34)
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three* (34)
A Combinatorial Distinction Between the Euclidean and Projective Planes (34)
Fault tolerant graphs, perfect hash functions and disjoint paths (33)
Deterministic selection in O(loglog N) parallel time (33)
On the ErdÖS-Stone Theorem (33)
Constructing Small Sets that are Uniform in Arithmetic Progressions (33)
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs (31)
Tripartite Ramsey numbers for paths (30)
Quadripartite version of the Hajnal-Szemerédi theorem (29)
A note on perfect matchings in uniform hypergraphs with large minimum collective degree (27)
A Lower Bound for Read-Once-Only Branching Programs (27)
Optimal Parallel Selection has Complexity O(Log Log n) (27)
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result (27)
On the distribution of cycle lengths in graphs (26)
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs (25)
Near-optimum Universal Graphs for Graphs with Bounded Degrees (25)
Two tapes are better than one for off-line Turing machines (24)
Short cycles in directed graphs (24)
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs (24)
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition (24)
Girth of sparse graphs (23)
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$ (23)
Long Arithmetic Progressions in Sum‐Sets and the Number x‐Sum‐Free Sets (23)
On the number of Hamiltonian cycles in Dirac graphs (23)
Subset sums modulo a prime (23)
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)) (21)
Almost Sorting in one Round (21)
Turán-Ramsey theorems and simple asymptotically extremal structures (21)
On the Pósa-Seymour conjecture (20)
On coloring graphs with locally small chromatic number (19)
On Almost Bipartite Large Chromatic Graphs (18)
Brooks Coloring in Parallel (18)
Turán-Ramsey Theorems and Kp-Independence Numbers (18)
Halvers and Expanders (18)
One-sided Coverings of Colored Complete Bipartite Graphs (17)
THE APPROXIMATE LOEBL-KOMLOS-SOS CONJECTURE AND EMBEDDING TREES IN SPARSE GRAPHS (17)
Optimal Slope Selection (15)
On the difference of consecutive terms of sequences defined by divisibility properties, II (15)
On An Extremal Problem Concerning Primitive Sequences (14)
On 3-pushdown graphs with large separators (14)
Tight Bounds for Embedding Bounded Degree Trees (14)
A Practical Regularity Partitioning Algorithm and its Applications in Clustering (13)
Upper bound for transversals of tripartite hypergraphs (13)
On a theorem of Behrend (13)
Infinite sets of primes with fast primality tests and quick generation of large primes (13)
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs (12)
Stability of the path-path Ramsey number (12)
On the Hamiltonicity of Triple Systems with High Minimum Degree (11)
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (10)
On a problem in additive number theory (10)
There is no Fast Single Hashing Algorithm (10)
Short paths in quasi-random triple systems with sparse underlying graphs (10)
Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs (10)
On a problem of Graham (8)
Two infinite sets of primes with fast primality tests (8)
The analysis of double hashing(Extended Abstract) (8)
Lower bounds for sorting networks (8)
Halvers and expanders (switching) (8)
Notes on the erdös-stone theorem (7)
Spanning subgraphs of dense graphs and a combinatorial problem on strings (7)
On some extremal properties of sequences of integers , II (7)
Two tapes versus one for off-line Turing machines (6)
Is laziness paying off? ("Absorbing" method) (6)
Erdős's Unit Distance Problem (6)
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (6)
Tripartite Ramsey numbers for paths (6)
Some additive and multiplicative problem sin number theory (5)
Girth of sparse graphs (5)
On the solvability of the equations [ai, aj] = ar and (a′i, a′j) = a′r in sequences of positive density (5)
On the divisibility properties of sequences of integers (II) (5)
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square (4)
A Tribute to Paul Erdős: Generating expanders from two permutations (4)
An old new proof of Roth’s theorem (4)
On the sum of the reciprocals of cycle lengths in sparse graphs (3)
On subgraph number independence in trees (3)
On sum-free subsequences (3)
Embedding spanning subgraphs into large dense graphs (3)
On a problem of P. Erdos and S. Stein (3)
Arithmetic Progressions, Different Regularity Lemmas and Removal Lemmas (3)
On the running time of the Adleman-Pomerance-Rumely primality test (2)
Combinatorics, Geometry and Probability: Turán–Ramsey Theorems and Kp -Independence Numbers (2)
ON THE NUMBER OF SOLUTIONS OF (2)
On the divisibility properties of integers (I) (2)
On coverings of random graphs (2)
Subset sums in $\BZ_p$ (1)
Sorting in Average Time o(log) n (1)
Two Geometrical Applications of the Semi-random Method (1)
There are no p-Complete Families of Symmetric Boolean Functions (1)
Various Regularity Lemmas in Graphs and Hypergraphs (1)
Structural Approach to Subset Sum Problems (1)
On the Solvability of Certain Equations in Sequences of Positive Upper Logarithmic Density (1)
C O ] 4 O ct 2 01 9 On distinct consecutive differences (0)
The longest path in a random graph [WAIT to hear from author; wrong PDF sent] (0)
The Generalization of Dirac's Theorem for Hypergraphs (0)
Diszkrét matematika = Discrete mathematics (0)
Finding spanning subgraphs of dense graphs and some new results on the k-server problem (0)
An Algorithmic Version of the Blow-up Lemma (0)
Additive combinatorics and graph theory (0)
On a problem of P. Erdös (0)
Szemerédi ’ s regularity lemma 1 . Szemerédi ’ s regularity lemma (0)
SUBSET SUMS IN Zp (0)
Packing theorems in graph theory and packing integer programs (0)
ON THE NUMBER OF SOLUTIONS OF P, ERDijS AND E. SZEMEREDI (0)
On an Extremal Problem Concerning Intervals (0)
Számelmélet és kombinatorikus vonatkozásai = Number Theory and its Interactions with Combinatorics (0)
On a problem of P. Erdős (0)
WPI-CS-TR-12-05 September 2012 A Practical Regularity Partitioning (0)
The Average-Case Area of Heilbronn-Type Triangles∗ (0)
On-line algorithms and fast digital identity revocation (0)

This paper list is powered by the following services:

Other Resources About Endre Szemerédi

What Schools Are Affiliated With Endre Szemerédi?

Endre Szemerédi is affiliated with the following schools:

Endre Szemerédi's AcademicInfluence.com Rankings

Computer Science