Berthold Vöcking

Citat de

	Toate	Din 2020
Referințe bibliografice	7019	1410
h-index	41	20
i10-index	72	32

400

200

100

300

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202523 34 29 32 50 49 92 111 182 220 261 280 322 396 326 371 384 339 356 376 354 297 324 271 295 219 288 274 288 46

Acces public

Afișați-le pe toate

29 de articole

4 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Heiko RöglinProfessor of Computer Science, University of BonnAdresă de e-mail confirmată pe cs.uni-bonn.de
Thomas KesselheimUniversity of BonnAdresă de e-mail confirmată pe uni-bonn.de
Artur CzumajProfessor of Computer Science, University of Warwick, UKAdresă de e-mail confirmată pe warwick.ac.uk
Friedhelm Meyer auf der HeideProfessor of Computer Science, University of PaderbornAdresă de e-mail confirmată pe upb.de
Matthias EnglertUniversity of WarwickAdresă de e-mail confirmată pe warwick.ac.uk
Christian ScheidelerUniversität PaderbornAdresă de e-mail confirmată pe upb.de
Michael MitzenmacherProfessor of Computer Science, Harvard UniversityAdresă de e-mail confirmată pe eecs.harvard.edu
Vahab MirrokniGoogle Fellow, VP, Google ResearchAdresă de e-mail confirmată pe google.com
Paul GoldbergProfessor of Computer Science, Oxford UniversityAdresă de e-mail confirmată pe cs.ox.ac.uk
Scott ShenkerProfessor of Computer Science, UC BerkeleyAdresă de e-mail confirmată pe icsi.berkeley.edu
Christian SchindelhauerComputer Networks and Telematics, University of Freiburg, GermanyAdresă de e-mail confirmată pe informatik.uni-freiburg.de
Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneAdresă de e-mail confirmată pe uni-koeln.de
Andrea W. RichaPresident's Professor, Arizona State UniversityAdresă de e-mail confirmată pe asu.edu
Rajmohan RajaramanProfessor of Computer Science, Northeastern UniversityAdresă de e-mail confirmată pe ccs.neu.edu
Peter SandersProfessor of Computer Science, Karlsruhe Institute of TechnologyAdresă de e-mail confirmată pe kit.edu
Richard ColeProfessor of Computer Science, Courant Institute, New York UniversityAdresă de e-mail confirmată pe cs.nyu.edu
Santosh S. VempalaGeorgia TechAdresă de e-mail confirmată pe gatech.edu
Andreas Emil FeldmannUniversity of SheffieldAdresă de e-mail confirmată pe sheffield.ac.uk
Anja FeldmannDirektor, Max Planck Institut für Informatik, Saarland Informatics Campus, Saarland UniversityAdresă de e-mail confirmată pe mpi-inf.mpg.de
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityAdresă de e-mail confirmată pe math2.rwth-aachen.de

Urmăriți

Berthold Vöcking

Professor of Computer Science, RWTH Aachen University

Adresă de e-mail confirmată pe cs.rwth-aachen.de - Pagina de pornire

Algorithms and Complexity


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
Randomized rumor spreading R Karp, C Schindelhauer, S Shenker, B Vocking Proceedings 41st Annual Symposium on Foundations of Computer Science, 565-574, 2000	931	2000
Tight bounds for worst-case equilibria A Czumaj, B Vöcking ACM Transactions On Algorithms (TALG) 3 (1), 1-17, 2007	468	2007
How asymmetry helps load balancing B Vöcking Journal of the ACM (JACM) 50 (4), 568-589, 2003	355	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	322	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	299	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	253	2014
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	205	2005
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	195	2013
Random knapsack in expected polynomial time R Beier, B Vöcking Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003	168	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	158	2006
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	151	2014
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	144	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	140	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	134	2008
Distributed contention resolution in wireless networks T Kesselheim, B Vöcking International Symposium on Distributed Computing, 163-178, 2010	130	2010
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	127	2008
On the evolution of selfish routing S Fischer, B Vöcking European Symposium on Algorithms, 323-334, 2004	127	2004
Selfish load balancing B Vöcking Algorithmic game theory 20, 517-542, 2007	121	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	111	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	108	2003

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori