Mark Walters
Advances in Applied Probability · 2000–2005
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 3 researchers here, as inferred from the citation graph.
Whom Mark Walters trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Mark Walters overall
Papers from Mark Walters's perspective
Ordered by how strongly the researchers Mark Walters trusts endorse each paper. Same corpus, a different order for every researcher.
- The Number of Neighbors Needed for Connectivity of Wireless Networks (Wirel. Networks)
- Random geometric graphs. (Physical review. E, Statistical, nonlinear, and soft matter physics)
- Efficient measurement of the percolation threshold for fully penetrable discs
- The capacity of wireless networks (IEEE Transactions on Information Theory)
- Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol
- Random graphs with arbitrary degree distributions and their applications. (Physical review. E, Statistical, nonlinear, and soft matter physics)
- AND T
- Reducibility Among Combinatorial Problems
- Emergence of scaling in random networks
- Emergence of Scaling in Random Networks
Their papers
- Connectivity of random k-nearest-neighbour graphs (2005) — 122 citations
- Combinatorial Proofs of the Polynomial van der Waerden Theorem and the Polynomial Hales–Jewett Theorem (2000) — 52 citations