Berthold Vöcking
Proceedings 41st Annual Symposium on Foundations of Computer Science · 1999–2002
A researcher in the Science corpus: 3 papers; trusts 3 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Berthold Vöcking trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Berthold Vöcking overall
- Sasu Tarkoma
- Alan M. Frieze
- Michael M. Mitzenmacher
- Tim Roughgarden
- Flavio Bonomi
- Christian Esteve Rothenberg
- Kunal Talwar
- E. Lagerspetz
- John W. Byers
- Sebastian Angel
Papers from Berthold Vöcking's perspective
Ordered by how strongly the researchers Berthold Vöcking trusts endorse each paper. Same corpus, a different order for every researcher.
- Algorithms, games, and the internet (Symposium on the Theory of Computing)
- How bad is selfish routing? (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- The price of anarchy is independent of the network topology (Symposium on the Theory of Computing)
- A personal communication
- Balanced Allocations
- The Power of Two Choices in Randomized Load Balancing
- Randomized allocation processes
- Probability and Computing: Randomized Algorithms and Probabilistic Analysis
- Human behavior and the principle of least effort
- A scalable location service for geographic ad hoc routing (ACM/IEEE International Conference on Mobile Computing and Networking)
Their papers
- Tight bounds for worst-case equilibria (2002) — 355 citations
- Randomized rumor spreading (2000) — 800 citations
- How asymmetry helps load balancing (1999)