- Home
- Best Scientists - Mathematics
- Endre Szemerédi

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
63
Citations
15,815
157
World Ranking
1266
National Ranking
2

Mathematics
D-index
67
Citations
18,293
173
World Ranking
158
National Ranking
4

2012 - Abel Prize For his fundamental contributions to discrete mathematics and theoretical computer science, and in recognition of the profound and lasting impact of these contributions on additive number theory and ergodic theory.

2012 - Member of Academia Europaea

2010 - Member of the National Academy of Sciences

2008 - Rolf Schock Prize for Mathematics

2008 - Steele Prize for Seminal Contribution to Research

1975 - George Pólya Prize

- Combinatorics
- Discrete mathematics
- Graph theory

Combinatorics, Discrete mathematics, Binary logarithm, Conjecture and Graph are his primary areas of study. His work often combines Combinatorics and Euclidean plane isometry studies. His is doing research in Hypergraph, Arithmetic progression, Lemma, Complete bipartite graph and Ramsey's theorem, both of which are found in Discrete mathematics.

His Binary logarithm research is multidisciplinary, relying on both Sorting network, Polynomial, Time complexity and Sorting. Endre Szemerédi studied Sorting and Cell-probe model that intersect with Algorithm. He has included themes like Chromatic scale and New digraph reconstruction conjecture in his Conjecture study.

- REGULAR PARTITIONS OF GRAPHS (816 citations)
- Storing a Sparse Table with 0(1) Worst Case Access Time (724 citations)
- An 0(n log n) sorting network (575 citations)

Endre Szemerédi mainly investigates Combinatorics, Discrete mathematics, Conjecture, Graph and Binary logarithm. Combinatorics and Upper and lower bounds are commonly linked in his work. Discrete mathematics is closely attributed to Bounded function in his study.

His work deals with themes such as Extremal graph theory and Existential quantification, which intersect with Conjecture. His work deals with themes such as Embedding and Chromatic scale, which intersect with Graph. Endre Szemerédi works mostly in the field of Binary logarithm, limiting it down to topics relating to Time complexity and, in certain cases, Sorting network.

- Combinatorics (86.93%)
- Discrete mathematics (68.84%)
- Conjecture (20.10%)

- Combinatorics (86.93%)
- Discrete mathematics (68.84%)
- Graph (20.60%)

Endre Szemerédi mostly deals with Combinatorics, Discrete mathematics, Graph, Conjecture and Hypergraph. His work in Combinatorics addresses subjects such as Embedding, which are connected to disciplines such as Céa's lemma. In his work, he performs multidisciplinary research in Discrete mathematics and Monochromatic color.

In his study, Arithmetic and Time complexity is inextricably linked to Property testing, which falls within the broad field of Graph. His Conjecture study incorporates themes from Generalization, Abelian group and Existential quantification. In his work, Integer and Perfect power is strongly intertwined with Disjoint sets, which is a subfield of Hypergraph.

- Perfect matchings in large uniform hypergraphs with large minimum collective degree (134 citations)
- An approximate Dirac-type theorem for k-uniform hypergraphs (122 citations)
- Three-color Ramsey numbers for paths (74 citations)

- Combinatorics
- Discrete mathematics
- Graph theory

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Hypergraph, Degree and Hamiltonian path. While working in this field, Endre Szemerédi studies both Combinatorics and Monochromatic color. His Discrete mathematics research is multidisciplinary, relying on both Subset sum problem and Prime.

His Degree research is multidisciplinary, incorporating elements of Random regular graph, Path graph, Pseudoforest, Complement graph and Universal graph. His Hamiltonian path research incorporates elements of Asymptotically optimal algorithm and Upper and lower bounds. His research integrates issues of Embedding and Céa's lemma in his study of Conjecture.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

On sets of integers containing k elements in arithmetic progression

E. Szemerédi.

Acta Arithmetica **(1975)**

1348 Citations

REGULAR PARTITIONS OF GRAPHS

E. Szemeredi.

**(1975)**

1264 Citations

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

Michael L. Fredman;János Komlós;Endre Szemerédi.

Journal of the ACM **(1984)**

1131 Citations

An 0(n log n) sorting network

M. Ajtai;J. Komlós;E. Szemerédi.

symposium on the theory of computing **(1983)**

1073 Citations

Sorting in c log n parallel steps

M. Ajtai;J. Komlós;E. Szemerédi.

Combinatorica **(1983)**

664 Citations

Many hard examples for resolution

Vašek Chvátal;Endre Szemerédi.

Journal of the ACM **(1988)**

575 Citations

Extremal problems in discrete geometry

Endre Szemerédi;William T. Trotter.

Combinatorica **(1983)**

574 Citations

Crossing-Free Subgraphs

M. Ajtai;V. Chvátal;M.M. Newborn;E. Szemerédi.

North-holland Mathematics Studies **(1982)**

443 Citations

A note on Ramsey numbers

Miklós Ajtai;János Komlós;Endre Szemerédi.

Journal of Combinatorial Theory, Series A **(1980)**

377 Citations

Limit distribution for the existence of Hamiltonian cycles in a random graph

János Komlós;Endre Szemerédi.

Discrete Mathematics **(1983)**

312 Citations

IBM (United States)

Hungarian Academy of Sciences

Adam Mickiewicz University in Poznań

Hungarian Academy of Sciences

Emory University

Hungarian Academy of Sciences

Georgia Institute of Technology

Concordia University

Yale University

Tel Aviv University

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.