Endre Szemerédi

Computational Theory and Mathematics · 2002–2011

A researcher in the Science corpus: 7 papers; trusts 7 researchers and is trusted by 10 researchers here, as inferred from the citation graph.

Subfields

Whom Endre Szemerédi trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Mei-Chu Chang
  2. William T. Gowers
  3. Vojtech Rödl
  4. Van H. Vu

Who trusts Endre Szemerédi overall

  1. Tom Sanders
  2. Tomasz Schoen
  3. D. Kühn
  4. Yi Zhao
  5. Van H. Vu
  6. Stefan Glock
  7. Vojtech Rödl
  8. Deryk Osthus
  9. Hoi H. Nguyen
  10. Ben Joseph Green

Papers from Endre Szemerédi's perspective

Ordered by how strongly the researchers Endre Szemerédi trusts endorse each paper. Same corpus, a different order for every researcher.

  1. A polynomial bound in Freiman's theorem
  2. Foundations of a Structural Theory of Set Addition
  3. A new proof of Szemerédi's theorem
  4. Hypergraph regularity and the multidimensional Szemerédi theorem
  5. Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
  6. Finite and infinite arithmetic progressions in sumsets
  7. Long arithmetic progressions in sumsets: Thresholds and bounds
  8. Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
  9. A Dirac-Type Theorem for 3-Uniform Hypergraphs (Combinatorics, probability & computing)
  10. Freiman's theorem in an arbitrary abelian group

Their papers