| Randomized rumor spreading R Karp, C Schindelhauer, S Shenker, B Vocking Proceedings 41st Annual Symposium on Foundations of Computer Science, 565-574, 2000 | 954 | 2000 |
| Tight bounds for worst-case equilibria A Czumaj, B Vöcking ACM Transactions On Algorithms (TALG) 3 (1), 1-17, 2007 | 476 | 2007 |
| How asymmetry helps load balancing B Vöcking Journal of the ACM (JACM) 50 (4), 568-589, 2003 | 362 | 2003 |
| On the impact of combinatorial structure on congestion games H Ackermann, H Röglin, B Vöcking Journal of the ACM (JACM) 55 (6), 1-22, 2008 | 340 | 2008 |
| Balanced allocations: The heavily loaded case P Berenbrink, A Czumaj, A Steger, B Vöcking Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 312 | 2000 |
| Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP M Englert, H Röglin, B Vöcking Algorithmica 68 (1), 190-264, 2014 | 282 | 2014 |
| An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions T Kesselheim, K Radke, A Tönnis, B Vöcking European symposium on algorithms, 589-600, 2013 | 213 | 2013 |
| Approximation techniques for utilitarian mechanism design P Briest, P Krysta, B Vöcking Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 211 | 2005 |
| Primal beats dual on online packing LPs in the random-order model T Kesselheim, A Tönnis, K Radke, B Vöcking Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 207 | 2014 |
| Random knapsack in expected polynomial time R Beier, B Vöcking Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 166 | 2003 |
| Fast convergence to Wardrop equilibria by adaptive sampling methods S Fischer, H Räcke, B Vöcking Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 159 | 2006 |
| Selfish traffic allocation for server farms A Czumaj, P Krysta, B Vöcking Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 150 | 2002 |
| Exploiting locality for data management in systems of limited bandwidth BM Maggs, FM auf der Heide, B Vocking, M Westermann Proceedings 38th Annual Symposium on Foundations of Computer Science, 284-293, 1997 | 139 | 1997 |
| Inapproximability of pure Nash equilibria A Skopalik, B Vöcking Proceedings of the fortieth annual ACM symposium on Theory of computing, 355-364, 2008 | 138 | 2008 |
| Distributed contention resolution in wireless networks T Kesselheim, B Vöcking International Symposium on Distributed Computing, 163-178, 2010 | 131 | 2010 |
| On the evolution of selfish routing S Fischer, B Vöcking European Symposium on Algorithms, 323-334, 2004 | 131 | 2004 |
| Uncoordinated two-sided matching markets H Ackermann, PW Goldberg, VS Mirrokni, H Röglin, B Vöcking Proceedings of the 9th ACM Conference on Electronic Commerce, 256-263, 2008 | 130 | 2008 |
| Selfish load balancing B Vöcking Algorithmic game theory 20, 517-542, 2007 | 129 | 2007 |
| Pure Nash equilibria in player-specific and weighted congestion games H Ackermann, H Röglin, B Vöcking Theoretical Computer Science 410 (17), 1552-1563, 2009 | 117 | 2009 |
| Randomized pursuit-evasion in graphs M Adler, H Räcke, N Sivadasan, C Sohler, B Vöcking Combinatorics, Probability and Computing 12 (3), 225-244, 2003 | 112 | 2003 |
Heiko RöglinProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de
