Benjamin Doerr
Algorithmica · 2010–2012
A researcher in the Science corpus: 3 papers; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Benjamin Doerr trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Benjamin Doerr overall
Papers from Benjamin Doerr's perspective
Ordered by how strongly the researchers Benjamin Doerr trusts endorse each paper. Same corpus, a different order for every researcher.
- Graph structure in the Web (Comput. Networks)
- Emergence of scaling in random networks
- Robustness and Vulnerability of Scale-Free Random Graphs (Internet Mathematics)
- Randomized rumor spreading (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- Gossip-based computation of aggregate information
- The degree sequence of a scale‐free random graph process (Random Struct. Algorithms)
- The Diameter of a Scale-Free Random Graph (Comb.)
- Randomized gossip algorithms
- Drift analysis and average time complexity of evolutionary algorithms (Artificial Intelligence)
- On the analysis of the (1+1) evolutionary algorithm (Theoretical Computer Science)
Their papers
- Why rumors spread so quickly in social networks (2012) — 340 citations
- Theory of Randomized Search Heuristics: Foundations and Recent Developments (2011) — 327 citations
- Multiplicative Drift Analysis (2010) — 300 citations