Jason S. Williford

2007

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

Whom Jason S. Williford trusts overall

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

1. Béla Bollobás

Papers from Jason S. Williford's perspective

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

1. AND T
2. Random Graphs: Notation
3. A combinatorial problem in geometry
4. Pseudo-random Graphs
5. Probability Inequalities for Sums of Bounded Random Variables
6. Emergence of Scaling in Random Networks
7. Scale-free characteristics of random networks: the topology of the world-wide web
8. Stochastic models for the Web graph (Proceedings 41st Annual Symposium on Foundations of Computer Science)
9. A Polynomial Invariant of Graphs On Orientable Surfaces
10. Evolution of networks

Their papers

• Imprimitive cometric association schemes: Constructions and analysis (2007) — 46 citations
• On the independence number of the Erdos-Rényi and projective norm graphs and a related hypergraph (2007) — 57 citations