| 2009 |
|---|
| 77 | EE | Matthias Englert,
Heiko Röglin,
Jacob Spönemann,
Berthold Vöcking:
Economical Caching.
STACS 2009: 385-396 |
| 76 | EE | Heiner Ackermann,
Heiko Röglin,
Berthold Vöcking:
Pure Nash equilibria in player-specific and weighted congestion games.
Theor. Comput. Sci. 410(17): 1552-1563 (2009) |
| 2008 |
|---|
| 75 | | Berthold Vöcking,
Helmut Alt,
Martin Dietzfelbinger,
Rüdiger Reischuk,
Christian Scheideler,
Heribert Vollmer,
Dorothea Wagner:
Taschenbuch der Algorithmen
Springer 2008 |
| 74 | EE | Heiner Ackermann,
Paul W. Goldberg,
Vahab S. Mirrokni,
Heiko Röglin,
Berthold Vöcking:
Uncoordinated two-sided matching markets.
ACM Conference on Electronic Commerce 2008: 256-263 |
| 73 | EE | Andreas Emil Feldmann,
Heiko Röglin,
Berthold Vöcking:
Computing Approximate Nash Equilibria in Network Congestion Games.
SIROCCO 2008: 209-220 |
| 72 | EE | Alexander Skopalik,
Berthold Vöcking:
Inapproximability of pure nash equilibria.
STOC 2008: 355-364 |
| 71 | EE | Artur Czumaj,
Berthold Vöcking:
Price of Anarchy for Machines Models.
Encyclopedia of Algorithms 2008 |
| 70 | EE | Piotr Krysta,
Berthold Vöcking:
Utilitarian Mechanism Design for Single-Minded Agents.
Encyclopedia of Algorithms 2008 |
| 69 | EE | René Beier,
Berthold Vöcking:
Das Rucksackproblem.
Taschenbuch der Algorithmen 2008: 405-411 |
| 68 | EE | Simon Fischer,
Lars Olbrich,
Berthold Vöcking:
Approximating Wardrop equilibria with finitely many agents.
Distributed Computing 21(2): 129-139 (2008) |
| 67 | EE | Heiner Ackermann,
Heiko Röglin,
Berthold Vöcking:
On the impact of combinatorial structure on congestion games.
J. ACM 55(6): (2008) |
| 2007 |
|---|
| 66 | | Martin Dietzfelbinger,
Shang-Hua Teng,
Eli Upfal,
Berthold Vöcking:
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 65 | EE | Simon Fischer,
Lars Olbrich,
Berthold Vöcking:
Approximating Wardrop Equilibria with Finitely Many Agents.
DISC 2007: 238-252 |
| 64 | EE | René Beier,
Heiko Röglin,
Berthold Vöcking:
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.
IPCO 2007: 53-67 |
| 63 | EE | Martin Dietzfelbinger,
Shang-Hua Teng,
Eli Upfal,
Berthold Vöcking:
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms.
Probabilistic Methods in the Design and Analysis of Algorithms 2007 |
| 62 | EE | Matthias Englert,
Heiko Röglin,
Berthold Vöcking:
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.
SODA 2007: 1295-1304 |
| 61 | EE | Heiner Ackermann,
Patrick Briest,
Alexander Fanghänel,
Berthold Vöcking:
Who Should Pay for Forwarding Packets?
WINE 2007: 208-219 |
| 60 | EE | Heiner Ackermann,
Paul W. Goldberg,
Vahab S. Mirrokni,
Heiko Röglin,
Berthold Vöcking:
A Unified Approach to Congestion Games and Two-Sided Markets.
WINE 2007: 30-41 |
| 59 | EE | Artur Czumaj,
Berthold Vöcking:
Tight bounds for worst-case equilibria.
ACM Transactions on Algorithms 3(1): (2007) |
| 58 | EE | Heiko Röglin,
Berthold Vöcking:
Smoothed analysis of integer programming.
Math. Program. 110(1): 21-56 (2007) |
| 57 | EE | Simon Fischer,
Berthold Vöcking:
On the structure and complexity of worst-case equilibria.
Theor. Comput. Sci. 378(2): 165-174 (2007) |
| 56 | EE | Heiner Ackermann,
Alantha Newman,
Heiko Röglin,
Berthold Vöcking:
Decision-making based on approximate and smoothed Pareto curves.
Theor. Comput. Sci. 378(3): 253-270 (2007) |
| 2006 |
|---|
| 55 | | Berthold Vöcking:
Congestion Games: Optimization in Competition.
ACiD 2006: 9-20 |
| 54 | EE | Heiner Ackermann,
Heiko Röglin,
Berthold Vöcking:
On the Impact of Combinatorial Structure on Congestion Games.
FOCS 2006: 613-622 |
| 53 | EE | Simon Fischer,
Harald Räcke,
Berthold Vöcking:
Fast convergence to Wardrop equilibria by adaptive sampling methods.
STOC 2006: 653-662 |
| 52 | EE | Heiner Ackermann,
Heiko Röglin,
Berthold Vöcking:
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games.
WINE 2006: 50-61 |
| 51 | EE | René Beier,
Artur Czumaj,
Piotr Krysta,
Berthold Vöcking:
Computing equilibria for a service provider game with (Im)perfect information.
ACM Transactions on Algorithms 2(4): 679-706 (2006) |
| 50 | EE | René Beier,
Berthold Vöcking:
An Experimental Study of Random Knapsack Problems.
Algorithmica 45(1): 121-136 (2006) |
| 49 | EE | Heiner Ackermann,
Heiko Röglin,
Berthold Vöcking:
On the Impact of Combinatorial Structure on Congestion Games.
Electronic Colloquium on Computational Complexity (ECCC) 13(067): (2006) |
| 48 | EE | Matthias Englert,
Heiko Röglin,
Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Electronic Colloquium on Computational Complexity (ECCC) 13(092): (2006) |
| 47 | EE | René Beier,
Berthold Vöcking:
Typical Properties of Winners and Losers in Discrete Optimization.
SIAM J. Comput. 35(4): 855-881 (2006) |
| 46 | EE | Petra Berenbrink,
Artur Czumaj,
Angelika Steger,
Berthold Vöcking:
Balanced Allocations: The Heavily Loaded Case.
SIAM J. Comput. 35(6): 1350-1385 (2006) |
| 45 | EE | Peter Sanders,
Aravind Srinivasan,
Berthold Vöcking:
Foreword.
Theory Comput. Syst. 39(6): 785 (2006) |
| 2005 |
|---|
| 44 | EE | Heiko Röglin,
Berthold Vöcking:
Smoothed Analysis of Integer Programming.
IPCO 2005: 276-290 |
| 43 | EE | Heiner Ackermann,
Alantha Newman,
Heiko Röglin,
Berthold Vöcking:
Decision Making Based on Approximate and Smoothed Pareto Curves.
ISAAC 2005: 675-684 |
| 42 | EE | Simon Fischer,
Berthold Vöcking:
Adaptive routing with stale information.
PODC 2005: 276-283 |
| 41 | EE | Patrick Briest,
Piotr Krysta,
Berthold Vöcking:
Approximation techniques for utilitarian mechanism design.
STOC 2005: 39-48 |
| 40 | EE | Simon Fischer,
Berthold Vöcking:
On the Structure and Complexity of Worst-Case Equilibria.
WINE 2005: 151-160 |
| 2004 |
|---|
| 39 | EE | Simon Fischer,
Berthold Vöcking:
On the Evolution of Selfish Routing.
ESA 2004: 323-334 |
| 38 | EE | René Beier,
Berthold Vöcking:
An Experimental Study of Random Knapsack Problems.
ESA 2004: 616-627 |
| 37 | EE | René Beier,
Berthold Vöcking:
Probabilistic analysis of knapsack core algorithms.
SODA 2004: 468-477 |
| 36 | EE | René Beier,
Artur Czumaj,
Piotr Krysta,
Berthold Vöcking:
Computing equilibria for congestion games with (im)perfect information.
SODA 2004: 746-755 |
| 35 | EE | René Beier,
Berthold Vöcking:
Typical properties of winners and losers in discrete optimization.
STOC 2004: 343-352 |
| 34 | EE | René Beier,
Berthold Vöcking:
Random knapsack in expected polynomial time.
J. Comput. Syst. Sci. 69(3): 306-329 (2004) |
| 2003 |
|---|
| 33 | EE | Amit Agarwal,
Tarun Agarwal,
Sumit Chopra,
Anja Feldmann,
Nils Kammenhuber,
Piotr Krysta,
Berthold Vöcking:
An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation.
Euro-Par 2003: 230-235 |
| 32 | EE | Piotr Krysta,
Peter Sanders,
Berthold Vöcking:
Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
MFCS 2003: 500-510 |
| 31 | EE | René Beier,
Berthold Vöcking:
Random knapsack in expected polynomial time.
STOC 2003: 232-241 |
| 30 | | Micah Adler,
Harald Räcke,
Naveen Sivadasan,
Christian Sohler,
Berthold Vöcking:
Randomized Pursuit-Evasion In Graphs.
Combinatorics, Probability & Computing 12(3): (2003) |
| 29 | | Peter Sanders,
Berthold Vöcking:
Tail Bounds And Expectations For Random Arc Allocation And Applications.
Combinatorics, Probability & Computing 12(3): (2003) |
| 28 | EE | Berthold Vöcking:
How asymmetry helps load balancing.
J. ACM 50(4): 568-589 (2003) |
| 2002 |
|---|
| 27 | EE | Michele Flammini,
Bruce M. Maggs,
Jop F. Sibeyn,
Berthold Vöcking:
Routing and Communication in Interconnection Networks.
Euro-Par 2002: 735 |
| 26 | EE | Micah Adler,
Harald Räcke,
Naveen Sivadasan,
Christian Sohler,
Berthold Vöcking:
Randomized Pursuit-Evasion in Graphs.
ICALP 2002: 901-912 |
| 25 | EE | Artur Czumaj,
Berthold Vöcking:
Tight bounds for worst-case equilibria.
SODA 2002: 413-420 |
| 24 | EE | Artur Czumaj,
Piotr Krysta,
Berthold Vöcking:
Selfish traffic allocation for server farms.
STOC 2002: 287-296 |
| 23 | EE | Peter Sanders,
Berthold Vöcking:
Random Arc Allocation and Applications.
SWAT 2002: 121-130 |
| 22 | EE | Christof Krick,
Friedhelm Meyer auf der Heide,
Harald Räcke,
Berthold Vöcking,
Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.
Theory Comput. Syst. 35(2): 217-245 (2002) |
| 2001 |
|---|
| 21 | EE | Rajmohan Rajaraman,
Andréa W. Richa,
Berthold Vöcking,
Gayathri Vuppuluri:
A data tracking scheme for general networks.
SPAA 2001: 247-254 |
| 20 | EE | Berthold Vöcking:
Almost optimal permutation routing on hypercubes.
STOC 2001: 530-539 |
| 2000 |
|---|
| 19 | | Richard M. Karp,
Christian Schindelhauer,
Scott Shenker,
Berthold Vöcking:
Randomized Rumor Spreading.
FOCS 2000: 565-574 |
| 18 | EE | Friedhelm Meyer auf der Heide,
Berthold Vöcking,
Matthias Westermann:
Caching in networks (extended abstract).
SODA 2000: 430-439 |
| 17 | EE | Petra Berenbrink,
Artur Czumaj,
Angelika Steger,
Berthold Vöcking:
Balanced allocations: the heavily loaded case.
STOC 2000: 745-754 |
| 16 | EE | Bruce M. Maggs,
Berthold Vöcking:
Improved Routing and Sorting on Multibutterflies.
Algorithmica 28(4): 438-437 (2000) |
| 15 | EE | Christian Scheideler,
Berthold Vöcking:
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.
SIAM J. Comput. 30(4): 1126-1155 (2000) |
| 1999 |
|---|
| 14 | EE | Friedhelm Meyer auf der Heide,
Berthold Vöcking,
Matthias Westermann:
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.
ESA 1999: 89-100 |
| 13 | EE | Berthold Vöcking:
How Asymmetry Helps Load Balancing.
FOCS 1999: 131-141 |
| 12 | EE | Santosh Vempala,
Berthold Vöcking:
Approximating Multicast Congestion.
ISAAC 1999: 367-372 |
| 11 | EE | Christof Krick,
Friedhelm Meyer auf der Heide,
Harald Räcke,
Berthold Vöcking,
Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.
SPAA 1999: 165-174 |
| 10 | EE | Christian Scheideler,
Berthold Vöcking:
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.
STOC 1999: 215-224 |
| 9 | | Friedhelm Meyer auf der Heide,
Berthold Vöcking:
Shortest-Path Routing in Arbitrary Networks.
J. Algorithms 31(1): 105-131 (1999) |
| 1998 |
|---|
| 8 | EE | Richard Cole,
Bruce M. Maggs,
Friedhelm Meyer auf der Heide,
Michael Mitzenmacher,
Andréa W. Richa,
Klaus Schröder,
Ramesh K. Sitaraman,
Berthold Vöcking:
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.
STOC 1998: 378-388 |
| 7 | EE | Christian Scheideler,
Berthold Vöcking:
Universal Continuous Routing Strategies.
Theory Comput. Syst. 31(4): 425-449 (1998) |
| 1997 |
|---|
| 6 | | Friedhelm Meyer auf der Heide,
Berthold Vöcking:
Static and Dynamic Data Management in Networks.
Euro-Par 1997: 46-56 |
| 5 | EE | Bruce M. Maggs,
Friedhelm Meyer auf der Heide,
Berthold Vöcking,
Matthias Westermann:
Exploiting Locality for Data Management in Systems of Limited Bandwidth.
FOCS 1997: 284-293 |
| 4 | EE | Bruce M. Maggs,
Berthold Vöcking:
Improved Routing and Sorting on Multibutterflies.
STOC 1997: 517-530 |
| 1996 |
|---|
| 3 | | Christian Scheideler,
Berthold Vöcking:
Universal Continuous Routing Strategies.
SPAA 1996: 141-151 |
| 2 | EE | Robert Cypher,
Friedhelm Meyer auf der Heide,
Christian Scheideler,
Berthold Vöcking:
Universal Algorithms for Store-and-Forward and Wormhole Routing.
STOC 1996: 356-365 |
| 1995 |
|---|
| 1 | | Friedhelm Meyer auf der Heide,
Berthold Vöcking:
A Packet Routing Protocol for Arbitrary Networks.
STACS 1995: 291-302 |
