Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Berthold Vöcking
2010 – today
- 2013
[j34]Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking: Online capacity maximization in wireless networks. J. Scheduling 16(1): 81-91 (2013)- [j33]Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking: Economical Caching. TOCT 5(2): 4 (2013)
- [c67]Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking: An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. ESA 2013: 589-600
- [c66]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking: Truthfulness and stochastic dominance with monetary transfers. ACM Conference on Electronic Commerce 2013: 567-582
- [e4]Guy E. Blelloch, Berthold Vöcking (Eds.): 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013. ACM 2013, ISBN 978-1-4503-1572-2
- [i7]Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking: Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. CoRR abs/1307.3192 (2013)
- 2012
- [j32]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing approximate Nash equilibria in network congestion games. Networks 59(4): 380-386 (2012)
- [c65]Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking: Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS 2012: 30-41
- [c64]Berthold Vöcking: Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract). ICALP (2) 2012: 27-29
- [c63]Piotr Krysta, Berthold Vöcking: Online Mechanism Design (Randomized Rounding on the Fly). ICALP (2) 2012: 636-647
- [c62]Marcel Ochel, Klaus Radke, Berthold Vöcking: Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization. ICALP (2) 2012: 648-659
- [c61]Berthold Vöcking: A universally-truthful approximation scheme for multi-unit auctions. SODA 2012: 846-855
- 2011
- [j31]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40(1): 92-106 (2011)
- [j30]Patrick Briest, Piotr Krysta, Berthold Vöcking: Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40(6): 1587-1622 (2011)
- [j29]Alexander Fanghänel, Thomas Kesselheim, Berthold Vöcking: Improved algorithms for latency minimization in wireless networks. Theor. Comput. Sci. 412(24): 2657-2667 (2011)
- [c60]Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking: Considerate Equilibrium. IJCAI 2011: 234-239
- [c59]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking: Approximation algorithms for secondary spectrum auctions. SPAA 2011: 177-186
- [p2]
- [e3]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Algorithms Unplugged. Springer 2011, ISBN 978-3-642-15327-3
- 2010
- [j28]Martin Hoefer, Berthold Vöcking: Berechnung von Nash-Gleichgewichten. Informatik Spektrum 33(5): 462-467 (2010)
- [j27]Artur Czumaj, Piotr Krysta, Berthold Vöcking: Selfish Traffic Allocation for Server Farms. SIAM J. Comput. 39(5): 1957-1987 (2010)
- [j26]Simon Fischer, Harald Räcke, Berthold Vöcking: Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. SIAM J. Comput. 39(8): 3700-3735 (2010)
- [c58]Sascha Geulen, Berthold Vöcking, Melanie Winkler: Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. COLT 2010: 132-143
- [c57]Thomas Kesselheim, Berthold Vöcking: Brief announcement: distributed contention resolution in wireless networks. PODC 2010: 124-125
- [c56]Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking: Online capacity maximization in wireless networks. SPAA 2010: 92-99
- [c55]Thomas Kesselheim, Berthold Vöcking: Distributed Contention Resolution in Wireless Networks. DISC 2010: 163-178
- [i6]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking: Approximation Algorithms for Secondary Spectrum Auctions. CoRR abs/1007.5032 (2010)
- [i5]Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking: Considerate Equilibrium. CoRR abs/1012.1547 (2010)
- [i4]Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking: Online Capacity Maximization in Wireless Networks. Electronic Colloquium on Computational Complexity (ECCC) 17: 16 (2010)
- [i3]Melanie Winkler, Berthold Vöcking, Sascha Geulen: Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. Electronic Colloquium on Computational Complexity (ECCC) 17: 52 (2010)
2000 – 2009
- 2009
- [j25]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. SIGecom Exchanges 8(1) (2009)
- [j24]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)
- [j23]Simon Fischer, Berthold Vöcking: Adaptive routing with stale information. Theor. Comput. Sci. 410(36): 3357-3371 (2009)
- [c54]Anja Feldmann, Simon Fischer, Nils Kammenhuber, Berthold Vöcking: Management of Variable Data Streams in Networks. Algorithmics of Large and Complex Networks 2009: 266-291
- [c53]
- [c52]Alexander Fanghänel, Thomas Keßelheim, Berthold Vöcking: Improved Algorithms for Latency Minimization in Wireless Networks. ICALP (2) 2009: 447-458
- [c51]Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking: Oblivious interference scheduling. PODC 2009: 220-229
- [c50]Matthias Englert, Berthold Vöcking, Melanie Winkler: Economical Caching with Stochastic Prices. SAGA 2009: 179-190
- [c49]Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking: Economical Caching. STACS 2009: 385-396
- 2008
- [j22]Simon Fischer, Lars Olbrich, Berthold Vöcking: Approximating Wardrop equilibria with finitely many agents. Distributed Computing 21(2): 129-139 (2008)
- [j21]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: A Unified Approach to Congestion Games and Two-Sided Markets. Internet Mathematics 5(4): 439-457 (2008)
- [j20]Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking: Who Should Pay for Forwarding Packets? Internet Mathematics 5(4): 459-475 (2008)
- [j19]Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the impact of combinatorial structure on congestion games. J. ACM 55(6) (2008)
- [c48]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
- [c47]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220
- [c46]
- [p1]
- [e2]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Taschenbuch der Algorithmen. eXamen.press, Springer 2008, ISBN 978-3-540-76393-2
- [r2]Artur Czumaj, Berthold Vöcking: Price of Anarchy for Machines Models. Encyclopedia of Algorithms 2008
- [r1]Piotr Krysta, Berthold Vöcking: Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms 2008
- 2007
- [j18]Heiko Röglin, Berthold Vöcking: Smoothed analysis of integer programming. Math. Program. 110(1): 21-56 (2007)
- [j17]Artur Czumaj, Berthold Vöcking: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms 3(1) (2007)
- [j16]Simon Fischer, Berthold Vöcking: On the structure and complexity of worst-case equilibria. Theor. Comput. Sci. 378(2): 165-174 (2007)
- [j15]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)
- [c45]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
- [c44]René Beier, Heiko Röglin, Berthold Vöcking: The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO 2007: 53-67
- [c43]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
- [c42]Simon Fischer, Lars Olbrich, Berthold Vöcking: Approximating Wardrop Equilibria with Finitely Many Agents. DISC 2007: 238-252
- [c41]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
- [c40]Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking: Who Should Pay for Forwarding Packets? WINE 2007: 208-219
- [e1]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking (Eds.): Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- 2006
- [j14]René Beier, Berthold Vöcking: An Experimental Study of Random Knapsack Problems. Algorithmica 45(1): 121-136 (2006)
- [j13]Peter Sanders, Aravind Srinivasan, Berthold Vöcking: Foreword. Theory Comput. Syst. 39(6): 785 (2006)
- [j12]René Beier, Berthold Vöcking: Typical Properties of Winners and Losers in Discrete Optimization. SIAM J. Comput. 35(4): 855-881 (2006)
- [j11]Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35(6): 1350-1385 (2006)
- [j10]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)
- [c39]
- [c38]Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the Impact of Combinatorial Structure on Congestion Games. FOCS 2006: 613-622
- [c37]Simon Fischer, Harald Räcke, Berthold Vöcking: Fast convergence to Wardrop equilibria by adaptive sampling methods. STOC 2006: 653-662
- [c36]Heiner Ackermann, Heiko Röglin, Berthold Vöcking: Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE 2006: 50-61
- [i2]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)
- [i1]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)
- 2005
- [c35]
- [c34]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking: Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684
- [c33]
- [c32]Patrick Briest, Piotr Krysta, Berthold Vöcking: Approximation techniques for utilitarian mechanism design. STOC 2005: 39-48
- [c31]Simon Fischer, Berthold Vöcking: On the Structure and Complexity of Worst-Case Equilibria. WINE 2005: 151-160
- 2004
- [j9]René Beier, Berthold Vöcking: Random knapsack in expected polynomial time. J. Comput. Syst. Sci. 69(3): 306-329 (2004)
- [c30]
- [c29]
- [c28]René Beier, Berthold Vöcking: Probabilistic analysis of knapsack core algorithms. SODA 2004: 468-477
- [c27]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking: Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755
- [c26]René Beier, Berthold Vöcking: Typical properties of winners and losers in discrete optimization. STOC 2004: 343-352
- 2003
- [j8]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion In Graphs. Combinatorics, Probability & Computing 12(3): 225-244 (2003)
- [j7]Peter Sanders, Berthold Vöcking: Tail Bounds And Expectations For Random Arc Allocation And Applications. Combinatorics, Probability & Computing 12(3): 301-318 (2003)
- [j6]
- [c25]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
- [c24]Piotr Krysta, Peter Sanders, Berthold Vöcking: Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS 2003: 500-510
- [c23]
- 2002
- [j5]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)
- [c22]Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking: Routing and Communication in Interconnection Networks. Euro-Par 2002: 735
- [c21]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912
- [c20]
- [c19]Artur Czumaj, Piotr Krysta, Berthold Vöcking: Selfish traffic allocation for server farms. STOC 2002: 287-296
- [c18]
- 2001
- [c17]Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri: A data tracking scheme for general networks. SPAA 2001: 247-254
- [c16]
- 2000
- [j4]Bruce M. Maggs, Berthold Vöcking: Improved Routing and Sorting on Multibutterflies. Algorithmica 28(4): 438-437 (2000)
- [j3]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)
- [c15]Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking: Randomized Rumor Spreading. FOCS 2000: 565-574
- [c14]Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann: Caching in networks (extended abstract). SODA 2000: 430-439
- [c13]Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced allocations: the heavily loaded case. STOC 2000: 745-754
1990 – 1999
- 1999
- [j2]Friedhelm Meyer auf der Heide, Berthold Vöcking: Shortest-Path Routing in Arbitrary Networks. J. Algorithms 31(1): 105-131 (1999)
- [c12]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
- [c11]
- [c10]
- [c9]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
- [c8]Christian Scheideler, Berthold Vöcking: From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. STOC 1999: 215-224
- 1998
- [j1]Christian Scheideler, Berthold Vöcking: Universal Continuous Routing Strategies. Theory Comput. Syst. 31(4): 425-449 (1998)
- [c7]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
- 1997
- [c6]Friedhelm Meyer auf der Heide, Berthold Vöcking: Static and Dynamic Data Management in Networks. Euro-Par 1997: 46-56
- [c5]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
- [c4]Bruce M. Maggs, Berthold Vöcking: Improved Routing and Sorting on Multibutterflies. STOC 1997: 517-530
- 1996
- [c3]
- [c2]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
- [c1]Friedhelm Meyer auf der Heide, Berthold Vöcking: A Packet Routing Protocol for Arbitrary Networks. STACS 1995: 291-302
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:19 CEST by the dblp team