John Lenz

Computational Theory and Mathematics · 2012

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

Subfields

• Computational Theory and Mathematics — 7 citations into it
• Discrete Mathematics and Combinatorics — 5 citations into it

Whom John Lenz trusts overall

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

1. William T. Gowers
2. Alan M. Frieze
3. Michael Krivelevich
4. Joshua N. Cooper
5. Benny Sudakov
6. Aaron Dutle
7. Shlomo Hoory

Papers from John Lenz's perspective

Ordered by how strongly the researchers John Lenz trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Probabilistic Method
2. Hypergraph regularity and the multidimensional Szemerédi theorem
3. Pseudo-random Graphs
4. Expander Graphs and their Applications
5. Random graphs
6. Spectra of Uniform Hypergraphs
7. Reducibility Among Combinatorial Problems
8. A new proof of Szemerédi's theorem
9. The triangle-free process
10. Foundations of a Structural Theory of Set Addition

Their papers

• EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS (2012) — 50 citations