2023 - Research.com Computer Science in Hungary Leader Award
2023 - Research.com Mathematics in Hungary Leader Award
2022 - Research.com Computer Science in Hungary Leader Award
2012 - Member of Academia Europaea
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.
2010 - Member of the National Academy of Sciences
2008 - Steele Prize for Seminal Contribution to Research
2008 - Rolf Schock Prize for Mathematics
1975 - George Pólya Prize
His work on Optics as part of general IBM research is frequently linked to Library science, bridging the gap between disciplines. His research is interdisciplinary, bridging the disciplines of IBM and Optics. He integrates Discrete mathematics and Combinatorics in his research. Combinatorics is frequently linked to Chromatic scale in his study. Endre Szemerédi integrates many fields in his works, including Random matrix and Eigenvalues and eigenvectors. Endre Szemerédi combines Eigenvalues and eigenvectors and Random matrix in his studies. Many of his studies involve connections with topics such as Composite material and Matrix (chemical analysis). His Composite material study frequently involves adjacent topics like Matrix (chemical analysis). Endre Szemerédi conducts interdisciplinary study in the fields of Quantum mechanics and Pure mathematics through his works.
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)
REGULAR PARTITIONS OF GRAPHS
E. Szemeredi.
(1975)
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)
An 0(n log n) sorting network
M. Ajtai;J. Komlós;E. Szemerédi.
symposium on the theory of computing (1983)
Sorting in c log n parallel steps
M. Ajtai;J. Komlós;E. Szemerédi.
Combinatorica (1983)
Extremal problems in discrete geometry
Endre Szemerédi;William T. Trotter.
Combinatorica (1983)
Many hard examples for resolution
Vašek Chvátal;Endre Szemerédi.
Journal of the ACM (1988)
Crossing-Free Subgraphs
M. Ajtai;V. Chvátal;M.M. Newborn;E. Szemerédi.
North-holland Mathematics Studies (1982)
A note on Ramsey numbers
Miklós Ajtai;János Komlós;Endre Szemerédi.
Journal of Combinatorial Theory, Series A (1980)
Blow-up Lemma
János Komlós;Gábor N. Sárközy;Endre Szemerédi.
Combinatorica (1997)
If you think any of the details on this page are incorrect, let us know.
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:
Hungarian Academy of Sciences
Alfréd Rényi Institute of Mathematics
Adam Mickiewicz University in Poznań
Alfréd Rényi Institute of Mathematics
Emory University
Hungarian Academy of Sciences
Georgia Institute of Technology
Concordia University
Yale University
University of Memphis
University of Liechtenstein
InterDigital (United States)
Oak Ridge National Laboratory
Carnegie Mellon University
Centre national de la recherche scientifique, CNRS
University of Houston
Chimie ParisTech
Louisiana State University
University of Maryland, College Park
University of Sydney
Northwestern University
King's College London
Woods Hole Oceanographic Institution
New Mexico State University
Centre for Addiction and Mental Health
University of Michigan–Ann Arbor