Travelled to:1 × Denmark
1 × Greece
1 × Switzerland
2 × USA
Collaborated with:M.Hoefer B.Vöcking J.Dams R.D.Kleinberg R.Niazadeh A.Fanghänel K.Radke A.Tönnis O.Göbel T.Schleiden
Talks about:secretari (2) wireless (2) network (2) order (2) onlin (2) algorithm (1) independ (1) uniform (1) prophet (1) problem (1)
Person: Thomas Keßelheim
DBLP: Ke=szlig=elheim:Thomas
Contributed to:
2015
2014201420112009Wrote 6 papers:
- STOC-2015-KesselheimKN #order #problem
- Secretary Problems with Non-Uniform Arrival Order (TK, RDK, RN), pp. 879–888.
- 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.
- ICALP-v2-2014-DamsHK #learning #network
- Jamming-Resistant Learning in Wireless Networks (JD, MH, TK), pp. 447–458.
- 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-2011-DamsHK #convergence
- Convergence Time of Power-Control Dynamics (JD, MH, TK), pp. 637–649.
- ICALP-v2-2009-FanghanelKV #algorithm #latency #network
- Improved Algorithms for Latency Minimization in Wireless Networks (AF, TK, BV), pp. 447–458.