Travelled to:1 × Canada
1 × Greece
1 × Poland
5 × USA
Collaborated with:M.Dietzfelbinger G.Giakkoupis L.Higham M.Sauerhoff B.Bollig W.M.Golab H.Attiya D.Hendler M.Helmi P.Beame M.David T.Pitassi
Talks about:lower (5) bound (5) random (3) tight (3) function (2) multipl (2) mutual (2) exclus (2) space (2) integ (2)
Person: Philipp Woelfel
DBLP: Woelfel:Philipp
Contributed to:
20152012201120092008
200720032001Wrote 9 papers:
- STOC-2015-GiakkoupisHHW
- Test-and-Set in Optimal Space (GG, MH, LH, PW), pp. 615–623.
- STOC-2012-GiakkoupisW #bound #random
- A tight RMR lower bound for randomized mutual exclusion (GG, PW), pp. 983–1002.
- STOC-2011-GolabHW #distributed #implementation #random
- Linearizable implementations do not suffice for randomized distributed computation (WMG, LH, PW), pp. 373–382.
- STOC-2009-DietzfelbingerW #bound
- Tight lower bounds for greedy routing in uniform small world rings (MD, PW), pp. 591–600.
- STOC-2008-AttiyaHW #bound #problem
- Tight rmr lower bounds for mutual exclusion and other problems (HA, DH, PW), pp. 217–226.
- ICALP-2007-BeameDPW #communication #complexity #multi #nondeterminism
- Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity (PB, MD, TP, PW), pp. 134–145.
- STOC-2003-DietzfelbingerW #graph #random
- Almost random graphs with simple hash functions (MD, PW), pp. 629–638.
- STOC-2003-SauerhoffW #bound #graph #integer #multi #trade-off
- Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions (MS, PW), pp. 186–195.
- STOC-2001-BolligW #bound #branch #integer #multi #using
- A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal (BB, PW), pp. 419–424.