Reid Andersen
2006
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 29 researchers here, as inferred from the citation graph.
Whom Reid Andersen trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Reid Andersen overall
- Bryan Perozzi
- Jure Leskovec
- Fan Chung
- Johannes Klicpera
- Daniel A. Spielman
- Jaewon Yang
- Juzheng Li
- Chenyi Zhuang
- Mauro Sozio
- Kevin J. Lang
Papers from Reid Andersen's perspective
Ordered by how strongly the researchers Reid Andersen trusts endorse each paper. Same corpus, a different order for every researcher.
- The PageRank Citation Ranking : Bringing Order to the Web
- The Anatomy of a Large-Scale Hypertextual Web Search Engine
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On clusterings-good, bad and spectral (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions
- Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
- Algebraic connectivity of graphs
- Learning with Local and Global Consistency
- A combinatorial, primal-dual approach to semidefinite programs (Symposium on the Theory of Computing)
- Network Flows
Their papers
- Local Graph Partitioning using PageRank Vectors (2006) — 1,111 citations