The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Berthold Vöcking: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Berthold Vöcking
    Congestion Games: Optimization in Competition. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:9-20 [Conf]
  2. René Beier, Berthold Vöcking
    An Experimental Study of Random Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:616-627 [Conf]
  3. Simon Fischer, Berthold Vöcking
    On the Evolution of Selfish Routing. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:323-334 [Conf]
  4. Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
    Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:89-100 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:230-235 [Conf]
  6. Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking
    Routing and Communication in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:735- [Conf]
  7. Friedhelm Meyer auf der Heide, Berthold Vöcking
    Static and Dynamic Data Management in Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:46-56 [Conf]
  8. Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking
    Randomized Rumor Spreading. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:565-574 [Conf]
  9. Bruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
    Exploiting Locality for Data Management in Systems of Limited Bandwidth. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:284-293 [Conf]
  10. Berthold Vöcking
    How Asymmetry Helps Load Balancing. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:131-141 [Conf]
  11. Heiner Ackermann, Heiko Röglin, Berthold Vöcking
    On the Impact of Combinatorial Structure on Congestion Games. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:613-622 [Conf]
  12. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
    Randomized Pursuit-Evasion in Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:901-912 [Conf]
  13. Heiko Röglin, Berthold Vöcking
    Smoothed Analysis of Integer Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:276-290 [Conf]
  14. Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
    Decision Making Based on Approximate and Smoothed Pareto Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:675-684 [Conf]
  15. Santosh Vempala, Berthold Vöcking
    Approximating Multicast Congestion. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:367-372 [Conf]
  16. Piotr Krysta, Peter Sanders, Berthold Vöcking
    Scheduling and Traffic Allocation for Tasks with Bounded Splittability. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:500-510 [Conf]
  17. Simon Fischer, Berthold Vöcking
    Adaptive routing with stale information. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:276-283 [Conf]
  18. René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Computing equilibria for congestion games with (im)perfect information. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:746-755 [Conf]
  19. René Beier, Berthold Vöcking
    Probabilistic analysis of knapsack core algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:468-477 [Conf]
  20. Artur Czumaj, Berthold Vöcking
    Tight bounds for worst-case equilibria. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:413-420 [Conf]
  21. Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
    Caching in networks (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:430-439 [Conf]
  22. 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. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:165-174 [Conf]
  23. Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri
    A data tracking scheme for general networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:247-254 [Conf]
  24. Christian Scheideler, Berthold Vöcking
    Universal Continuous Routing Strategies. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:141-151 [Conf]
  25. Friedhelm Meyer auf der Heide, Berthold Vöcking
    A Packet Routing Protocol for Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:291-302 [Conf]
  26. René Beier, Berthold Vöcking
    Random knapsack in expected polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:232-241 [Conf]
  27. René Beier, Berthold Vöcking
    Typical properties of winners and losers in discrete optimization. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:343-352 [Conf]
  28. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
    Balanced allocations: the heavily loaded case. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:745-754 [Conf]
  29. Patrick Briest, Piotr Krysta, Berthold Vöcking
    Approximation techniques for utilitarian mechanism design. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:39-48 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:378-388 [Conf]
  31. Robert Cypher, Friedhelm Meyer auf der Heide, Christian Scheideler, Berthold Vöcking
    Universal Algorithms for Store-and-Forward and Wormhole Routing. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:356-365 [Conf]
  32. Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Selfish traffic allocation for server farms. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:287-296 [Conf]
  33. Simon Fischer, Harald Räcke, Berthold Vöcking
    Fast convergence to Wardrop equilibria by adaptive sampling methods. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:653-662 [Conf]
  34. Bruce M. Maggs, Berthold Vöcking
    Improved Routing and Sorting on Multibutterflies. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:517-530 [Conf]
  35. Christian Scheideler, Berthold Vöcking
    From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:215-224 [Conf]
  36. Berthold Vöcking
    Almost optimal permutation routing on hypercubes. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:530-539 [Conf]
  37. Peter Sanders, Berthold Vöcking
    Random Arc Allocation and Applications. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:121-130 [Conf]
  38. Heiner Ackermann, Heiko Röglin, Berthold Vöcking
    Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:50-61 [Conf]
  39. Simon Fischer, Berthold Vöcking
    On the Structure and Complexity of Worst-Case Equilibria. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:151-160 [Conf]
  40. René Beier, Berthold Vöcking
    An Experimental Study of Random Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:1, pp:121-136 [Journal]
  41. Bruce M. Maggs, Berthold Vöcking
    Improved Routing and Sorting on Multibutterflies. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:4, pp:438-437 [Journal]
  42. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
    Randomized Pursuit-Evasion In Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  43. Peter Sanders, Berthold Vöcking
    Tail Bounds And Expectations For Random Arc Allocation And Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  44. Berthold Vöcking
    How asymmetry helps load balancing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:4, pp:568-589 [Journal]
  45. Friedhelm Meyer auf der Heide, Berthold Vöcking
    Shortest-Path Routing in Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:1, pp:105-131 [Journal]
  46. René Beier, Berthold Vöcking
    Random knapsack in expected polynomial time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:306-329 [Journal]
  47. Heiko Röglin, Berthold Vöcking
    Smoothed analysis of integer programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:21-56 [Journal]
  48. 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. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:2, pp:217-245 [Journal]
  49. Christian Scheideler, Berthold Vöcking
    Universal Continuous Routing Strategies. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:4, pp:425-449 [Journal]
  50. René Beier, Berthold Vöcking
    Typical Properties of Winners and Losers in Discrete Optimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:855-881 [Journal]
  51. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
    Balanced Allocations: The Heavily Loaded Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1350-1385 [Journal]
  52. Christian Scheideler, Berthold Vöcking
    From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1126-1155 [Journal]
  53. Artur Czumaj, Berthold Vöcking
    Tight bounds for worst-case equilibria. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  54. René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Computing equilibria for a service provider game with (Im)perfect information. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:679-706 [Journal]
  55. René Beier, Heiko Röglin, Berthold Vöcking
    The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:53-67 [Conf]
  56. Matthias Englert, Heiko Röglin, Berthold Vöcking
    Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1295-1304 [Conf]
  57. Simon Fischer, Lars Olbrich, Berthold Vöcking
    Approximating Wardrop Equilibria with Finitely Many Agents. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:238-252 [Conf]
  58. Peter Sanders, Aravind Srinivasan, Berthold Vöcking
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:6, pp:785- [Journal]
  59. Simon Fischer, Berthold Vöcking
    On the structure and complexity of worst-case equilibria. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:2, pp:165-174 [Journal]
  60. Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
    Decision-making based on approximate and smoothed Pareto curves. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:3, pp:253-270 [Journal]

  61. 07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. [Citation Graph (, )][DBLP]


  62. Management of Variable Data Streams in Networks. [Citation Graph (, )][DBLP]


  63. Approximability of OFDMA Scheduling. [Citation Graph (, )][DBLP]


  64. Improved Algorithms for Latency Minimization in Wireless Networks. [Citation Graph (, )][DBLP]


  65. Oblivious interference scheduling. [Citation Graph (, )][DBLP]


  66. Brief announcement: distributed contention resolution in wireless networks. [Citation Graph (, )][DBLP]


  67. Economical Caching with Stochastic Prices. [Citation Graph (, )][DBLP]


  68. Uncoordinated two-sided matching markets. [Citation Graph (, )][DBLP]


  69. Computing Approximate Nash Equilibria in Network Congestion Games. [Citation Graph (, )][DBLP]


  70. Online capacity maximization in wireless networks. [Citation Graph (, )][DBLP]


  71. Economical Caching. [Citation Graph (, )][DBLP]


  72. Inapproximability of pure nash equilibria. [Citation Graph (, )][DBLP]


  73. Distributed Contention Resolution in Wireless Networks. [Citation Graph (, )][DBLP]


  74. Who Should Pay for Forwarding Packets? [Citation Graph (, )][DBLP]


  75. A Unified Approach to Congestion Games and Two-Sided Markets. [Citation Graph (, )][DBLP]


  76. Approximation Algorithms for Secondary Spectrum Auctions [Citation Graph (, )][DBLP]


  77. Approximating Wardrop equilibria with finitely many agents. [Citation Graph (, )][DBLP]


  78. Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. [Citation Graph (, )][DBLP]


  79. On the Impact of Combinatorial Structure on Congestion Games. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.460secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002