BibSLEIGH — Berthold

Travelled to:

1 × Germany
1 × Spain
1 × United Kingdom
10 × USA
2 × Canada
2 × Denmark
2 × Greece

Collaborated with:

P.Krysta A.Czumaj ∅ R.Beier T.Keßelheim C.Scheideler B.M.Maggs K.Radke H.Räcke A.Skopalik F.M.a.d.Heide M.Ochel A.Fanghänel S.Fischer P.Briest A.Tönnis P.Berenbrink A.Steger R.Cypher O.Göbel M.Hoefer T.Schleiden M.Adler N.Sivadasan C.Sohler M.Odendahl A.Goens R.Leupers G.Ascheid B.Ries T.Henriksson R.Cole M.Mitzenmacher A.W.Richa K.Schröder R.K.Sitaraman

Talks about:

random (6) rout (5) onlin (4) network (3) mechan (3) improv (3) optim (3) alloc (3) equilibria (2) algorithm (2)

Person: Berthold Vöcking

DBLP: V=ouml=cking:Berthold

Contributed to:

2014

2012

2009

2008

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

Wrote 21 papers:

DATE-2014-OdendahlGLARVH #manycore: Optimized buffer allocation in multicore platforms (MO, AG, RL, GA, BR, BV, TH), pp. 1–6.
ICALP-v1-2014-CzumajV #markov: Thorp Shuffling, Butterflies, and Non-Markovian Couplings (AC, BV), pp. 344–355.
ICALP-v2-2014-0002HKSV #independence #online #set #worst-case: Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods (OG, MH, TK, TS, BV), pp. 508–519.
STOC-2014-KesselheimTRV #online: Primal beats dual on online packing LPs in the random-order model (TK, KR, AT, BV), pp. 303–312.
ICALP-v2-2012-KrystaV #design #on the fly #online #random: Online Mechanism Design (Randomized Rounding on the Fly) (PK, BV), pp. 636–647.
ICALP-v2-2012-OchelRV #capacity #network #online: Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization (MO, KR, BV), pp. 648–659.
ICALP-v2-2012-Vocking #multi #random: Randomized Mechanisms for Multi-unit Auctions — (BV), pp. 27–29.
ICALP-v2-2009-FanghanelKV #algorithm #latency #network: Improved Algorithms for Latency Minimization in Wireless Networks (AF, TK, BV), pp. 447–458.
STOC-2008-SkopalikV #nash: Inapproximability of pure nash equilibria (AS, BV), pp. 355–364.
STOC-2006-FischerRV #adaptation #convergence #performance: Fast convergence to Wardrop equilibria by adaptive sampling methods (SF, HR, BV), pp. 653–662.
STOC-2005-BriestKV #approximate #design: Approximation techniques for utilitarian mechanism design (PB, PK, BV), pp. 39–48.
STOC-2004-BeierV #optimisation: Typical properties of winners and losers in discrete optimization (RB, BV), pp. 343–352.
STOC-2003-BeierV #polynomial #random: Random knapsack in expected polynomial time (RB, BV), pp. 232–241.
ICALP-2002-AdlerRSSV #graph #random: Randomized Pursuit-Evasion in Graphs (MA, HR, NS, CS, BV), pp. 901–912.
STOC-2002-CzumajKV: Selfish traffic allocation for server farms (AC, PK, BV), pp. 287–296.
STOC-2001-Vocking #permutation: Almost optimal permutation routing on hypercubes (BV), pp. 530–539.
STOC-2000-BerenbrinkCSV: Balanced allocations: the heavily loaded case (PB, AC, AS, BV), pp. 745–754.
STOC-1999-ScheidelerV #performance #protocol: From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols (CS, BV), pp. 215–224.
STOC-1998-ColeMHMRSSV #multi #network #protocol #random: Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks (RC, BMM, FMadH, MM, AWR, KS, RKS, BV), pp. 378–388.
STOC-1997-MaggsV #multi #sorting: Improved Routing and Sorting on Multibutterflies (BMM, BV), pp. 517–530.
STOC-1996-CypherHSV #algorithm: Universal Algorithms for Store-and-Forward and Wormhole Routing (RC, FMadH, CS, BV), pp. 356–365.