Peter Allen
Computational Theory and Mathematics · 2011
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 7 citations into it
Whom Peter Allen trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Peter Allen's perspective
Ordered by how strongly the researchers Peter Allen trusts endorse each paper. Same corpus, a different order for every researcher.
- Using The Borsuk-Ulam Theorem
- Regularity Lemmas for Graphs
- Combinatorial theorems in sparse random sets
- Szemerédi’s Lemma for the Analyst
- On the Density of Families of Sets
- Modern Graph Theory
- The Probabilistic Method
- Extensions of Lipschitz mappings into Hilbert space
- Kneser's Conjecture
- Empirical processes and random projections
Their papers
- The chromatic thresholds of graphs (2011) — 48 citations