MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 25 documents:

  1. Online Capacity Maximization in Wireless Networks
    Alexander Fanghänel, Sascha Geulen, Martin Hoefer, and Berthold Vöcking
    Journal of Scheduling 16 (1): 81-91, 2013
  2. Truthfulness and Stochastic Dominance with Monetary Transfers.
    Martin Hoefer, Thomas Kesselheim, and Berthold Vöcking
    In: 14th Conf. Electronic Commerce (EC-13), Philadelphia, USA, 2013, 567-582
  3. The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
    René Beier, Heiko Röglin, and Berthold Vöcking
    In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, Ithaca, USA, 2007, 53-67. Note: To Appear

  4. An Experimental Study of Random Knapsack Problems
    René Beier and Berthold Vöcking
    Algorithmica 45 (1): 121-136, 2006

  5. Computing Equilibria for a Service Provider Game with (Im)perfect Information
    René Beier, Artur Czumaj, Piotr Krysta, and Berthold Vöcking
    ACM Transactions on Algorithms 2 (4): 679-706, 2006

  6. Typical Properties of Winners and Losers in Discrete Optimization
    René Beier and Berthold Vöcking
    SIAM Journal on Computing 35 (4): 855-881, 2006

  7. Computing Equilibria for Congestion Games with (Im)perfect Information
    Rene Beier, Piotr Krysta, Artur Czumaj, and Berthold Vöcking
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, January, 11-13, 2004, 739-748
  8. Probabilistic Analysis of Knapsack Core Algorithms
    Rene Beier and Berthold Vöcking
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, January, 11-13, 2004, 461-470
  9. Random knapsack in expected polynomial time
    René Beier and Berthold Vöcking
    Journal of Computer and System Sciences 69 (3): 306-329, 2004
  10. Typical Properties of Winners and Losers in Discrete Optimization
    Rene Beier and Berthold Vöcking
    In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), Chicago, USA, 2004, 343-352
  11. An experimental study of k-splittable scheduling for DNS-based traffic allocation
    Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann, Nils Kammenhuber, Piotr Krysta, and Berthold Vöcking
    In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, Klagenfurt, Austria, June 30 - July 4, 2003, 2003, 230-235
  12. Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
    Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann
    Theory of Computing Systems 35 (2): 217-245, 2003
  13. Random Knapsack in Expected Polynomial Time
    Rene Beier and Berthold Vöcking
    In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), San Diego, USA, June, 9-11, 2003, 232-241
  14. Randomized Pursuit-Evasion in Graphs
    Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking
    Combinatorics, Probability and Computing 12 (3): 225-244, 2003
    [PS: Download: paper.ps]
  15. Scheduling and Traffic Allocation for Tasks with Bounded Splittability
    Piotr Krysta, Peter Sanders, and Berthold Vöcking
    In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Agust, 25 - August, 29, 2003, 500-510
  16. Tail bounds and expectations for random arc allocation and applications
    Peter Sanders and Berthold Vöcking
    Combinatorics, Probability and Computing 12 (3): 225-244, 2003
  17. Random Arc Allocation and Applications to Disks, Drums and DRAMs
    Peter Sanders and Berthold Vöcking
    In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, 2002, 121-130
  18. Randomized Pursuit-Evasion in Graphs
    Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking
    In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Málaga, Spain, 2002, 901-912
  19. Selfish Traffic Allocation for Server Farms
    Artur Czumaj, Piotr Krysta, and Berthold Vöcking
    In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), Montreal, Canada, 2002, 287-296
  20. Tight bounds for worst-case equilibria
    Artur Czumaj and Berthold Vöcking
    In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), San Francisco, USA, 2002, 413-420
  21. A Data Tracking Scheme for General Networks
    Rajmohan Rajaraman, Andrea W. Richa, Berthold Vöcking, and Gayathri Vuppuluri
    In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), Crete Island, Greece, July, 3-6, 2001, 2001, 247-254
  22. Almost Optimal Permutation Routing on Hypercubes
    Berthold Vöcking
    In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), Hersonissos, Crete, Greece, July, 6-8, 2001, 2001, 530-539
  23. Symmetric vs. Asymmetric Multiple-Choice Algorithms
    Berthold Vöcking
    In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), Aarhus, August, 27, 2001, 2001, 1-10
  24. Improved Routing and Sorting on Multibutterflies
    Bruce M. Maggs and Berthold Vöcking
    Algorithmica 28 (4): 438-464, 2000
  25. Randomized Rumor Spreading
    Richard Karp, Christian Schindelhauer, Scott Shenker, and Berthold Vöcking
    In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), Redondo Beach, USA, November, 12-4, 2000, 565-574