Berthold Vöcking

According to our database1, Berthold Vöcking authored at least 92 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
A universally-truthful approximation scheme for multi-unit auctions.
Games Econ. Behav., 2019

2018
Primal Beats Dual on Online Packing LPs in the Random-Order Model.
SIAM J. Comput., 2018

2017
Truthful mechanism design via correlated tree rounding.
Math. Program., 2017

2016
Utilitarian Mechanism Design for Single-Minded Agents.
Encyclopedia of Algorithms, 2016

Price of Anarchy for Machines Models.
Encyclopedia of Algorithms, 2016

Truthfulness and Stochastic Dominance with Monetary Transfers.
ACM Trans. Economics and Comput., 2016

Smoothed Analysis of the 2-Opt Algorithm for the General TSP.
ACM Trans. Algorithms, 2016

2014
Approximation Algorithms for Secondary Spectrum Auctions.
ACM Trans. Internet Techn., 2014

Comparative study of approximation algorithms and heuristics for SINR scheduling with power control.
Theor. Comput. Sci., 2014

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Algorithmica, 2014

Thorp Shuffling, Butterflies, and Non-Markovian Couplings.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Optimized buffer allocation in multicore platforms.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2014

2013
Economical Caching.
TOCT, 2013

Electronic Markets and Auctions (Dagstuhl Seminar 13461).
Dagstuhl Reports, 2013

An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Computing approximate Nash equilibria in network congestion games.
Networks, 2012

Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Online Mechanism Design (Randomized Rounding on the Fly).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Scheduling and Power Assignments in the Physical Model.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Improved algorithms for latency minimization in wireless networks.
Theor. Comput. Sci., 2011

Approximation Techniques for Utilitarian Mechanism Design.
SIAM J. Comput., 2011

Considerate Equilibrium.
Proceedings of the IJCAI 2011, 2011

The Knapsack Problem.
Proceedings of the Algorithms Unplugged, 2011

2010
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods.
SIAM J. Comput., 2010

Selfish Traffic Allocation for Server Farms.
SIAM J. Comput., 2010

Berechnung von Nash-Gleichgewichten.
Informatik Spektrum, 2010

Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Online Capacity Maximization in Wireless Networks.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Distributed Contention Resolution in Wireless Networks.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief announcement: distributed contention resolution in wireless networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

10211 Abstracts Collection - Flexible Network Design.
Proceedings of the Flexible Network Design, 24.05. - 28.05.2010, 2010

2009
Adaptive routing with stale information.
Theor. Comput. Sci., 2009

Pure Nash equilibria in player-specific and weighted congestion games.
Theor. Comput. Sci., 2009

Uncoordinated two-sided matching markets.
SIGecom Exchanges, 2009

Economical Caching with Stochastic Prices.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

Oblivious interference scheduling.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Congestion games: Equilibria, convergence and complexity.
Proceedings of the 1st International Conference on Game Theory for Networks, 2009

Approximability of OFDMA Scheduling.
Proceedings of the Algorithms, 2009

Management of Variable Data Streams in Networks.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008
Utilitarian Mechanism Design for Single-Minded Agents.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Price of Anarchy for Machines Models.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Das Rucksackproblem.
Proceedings of the Taschenbuch der Algorithmen, 2008

On the impact of combinatorial structure on congestion games.
J. ACM, 2008

A Unified Approach to Congestion Games and Two-Sided Markets.
Internet Mathematics, 2008

Who Should Pay for Forwarding Packets?
Internet Mathematics, 2008

Approximating Wardrop equilibria with finitely many agents.
Distributed Computing, 2008

Inapproximability of pure nash equilibria.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2007
On the structure and complexity of worst-case equilibria.
Theor. Comput. Sci., 2007

Decision-making based on approximate and smoothed Pareto curves.
Theor. Comput. Sci., 2007

Tight bounds for worst-case equilibria.
ACM Trans. Algorithms, 2007

Smoothed analysis of integer programming.
Math. Program., 2007

Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms.
Proceedings of the Probabilistic Methods in the Design and Analysis of Algorithms, 23.09., 2007

Distributed Load Balancing Algorithm for Adaptive Channel Allocation for Cognitive Radios.
Proceedings of the 2nd International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, 2007

2006
Computing equilibria for a service provider game with (Im)perfect information.
ACM Trans. Algorithms, 2006

Balanced Allocations: The Heavily Loaded Case.
SIAM J. Comput., 2006

Typical Properties of Winners and Losers in Discrete Optimization.
SIAM J. Comput., 2006

Foreword.
Theory Comput. Syst., 2006

An Experimental Study of Random Knapsack Problems.
Algorithmica, 2006

Congestion Games: Optimization in Competition.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2004
Foreword.
Theory Comput. Syst., 2004

Random knapsack in expected polynomial time.
J. Comput. Syst. Sci., 2004

Probabilistic analysis of knapsack core algorithms.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Computing equilibria for congestion games with (im)perfect information.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On the Evolution of Selfish Routing.
Proceedings of the Algorithms, 2004

2003
How asymmetry helps load balancing.
J. ACM, 2003

Tail Bounds And Expectations For Random Arc Allocation And Applications.
Combinatorics, Probability & Computing, 2003

Randomized Pursuit-Evasion In Graphs.
Combinatorics, Probability & Computing, 2003

Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.
Theory Comput. Syst., 2002

Random Arc Allocation and Applications.
Proceedings of the Algorithm Theory, 2002

Routing and Communication in Interconnection Networks.
Proceedings of the Euro-Par 2002, 2002

2001
Almost optimal permutation routing on hypercubes.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A data tracking scheme for general networks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.
SIAM J. Comput., 2000

Improved Routing and Sorting on Multibutterflies.
Algorithmica, 2000

Caching in networks (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Randomized Rumor Spreading.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Shortest-Path Routing in Arbitrary Networks.
J. Algorithms, 1999

Approximating Multicast Congestion.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.
Proceedings of the Algorithms, 1999

1998
Static and dynamic data Management in networks.
PhD thesis, 1998

Universal Continuous Routing Strategies.
Theory Comput. Syst., 1998

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997
Exploiting Locality for Data Management in Systems of Limited Bandwidth.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Static and Dynamic Data Management in Networks.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
Universal Algorithms for Store-and-Forward and Wormhole Routing.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995
A Packet Routing Protocol for Arbitrary Networks.
Proceedings of the STACS 95, 1995


  Loading...