Ben Morris
Computer Vision and Pattern Recognition · 2003–2009
A researcher in the Science corpus: 3 papers; trusts 9 researchers and is trusted by 14 researchers here, as inferred from the citation graph.
Subfields
- Computer Vision and Pattern Recognition — 6 citations into it
- Artificial Intelligence — 5 citations into it
Whom Ben Morris trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Itai Benjamini
- Michael Luby
- Moses D. Liskov
- Russell Lyons
- Pierre Mathieu
- Wolfgang Woess
- Yuval Peres
- R. Rivest
- Oded Schramm
- T. Coulhon
Who trusts Ben Morris overall
- Russell Lyons
- Noam Berger
- Raef Bassily
- Sharad Goel
- Subhro Ghosh
- Marek Tomasz Biskup
- Benjamin J. Morris
- Elette Boyle
- Ravi Montenegro
- Yuval Peres
Papers from Ben Morris's perspective
Ordered by how strongly the researchers Ben Morris trusts endorse each paper. Same corpus, a different order for every researcher.
- How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)
- Random Walks on Infinite Graphs and Groups: The type problem
- A geometric approach to on-diagonal heat kernel lower bounds on groups
- Isoperimetry and heat kernel decay on percolation clusters
- Uniform spanning forests
- Tweakable Block Ciphers (Journal of Cryptology)
- An Introduction to Probability Theory and Its Applications
- Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances
- A measurable-group-theoretic solution to von Neumann’s problem
- 6.856 — Randomized Algorithms
Their papers
- Evolving sets, mixing and heat kernel bounds (2003) — 153 citations
- How to Encipher Messages on a Small Domain (2009) — 111 citations
- The components of the Wired Spanning Forest are recurrent (2003) — 111 citations