Philipp Woelfel
Title
Cited by
Cited by
Year
Almost random graphs with simple hash functions
M Dietzfelbinger, P Woelfel
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
752003
Tight RMR lower bounds for mutual exclusion and other problems
H Attiya, D Hendler, P Woelfel
Proceedings of the 40th annual ACM symposium on Theory of computing, 217-226, 2008
712008
Linearizable implementations do not suffice for randomized distributed computation
W Golab, L Higham, P Woelfel
Proceedings of the 43rd annual ACM symposium on Theory of computing, 373-382, 2011
482011
On the time and space complexity of randomized test-and-set
G Giakkoupis, P Woelfel
Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012
392012
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
W Golab, V Hadzilacos, D Hendler, P Woelfel
Proceedings of the twenty-sixth annual ACM symposium on Principles of …, 2007
342007
Symbolic topological sorting with OBDDs
P Woelfel
Journal of Discrete Algorithms 4 (1), 51-71, 2006
342006
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
M Sauerhoff, P Woelfel
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
312003
A read-once branching program lower bound of Ω(2^n/4) for integer multiplication using universal hashing
B Bollig, P Woelfel
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
312001
Tight lower bounds for greedy routing in uniform small world rings
M Dietzfelbinger, P Woelfel
Proceedings of the 41st annual ACM symposium on Theory of computing, 591-600, 2009
302009
An Space Bound for Obstruction-Free Leader Election
G Giakkoupis, M Helmi, L Higham, P Woelfel
International Symposium on Distributed Computing, 46-60, 2013
292013
Explicit and efficient hash families suffice for cuckoo hashing with a stash
M Aumüller, M Dietzfelbinger, P Woelfel
Algorithmica 70 (3), 428-456, 2014
282014
A tight RMR lower bound for randomized mutual exclusion
G Giakkoupis, P Woelfel
Proceedings of the 44th symposium on Theory of Computing, 983-1002, 2012
252012
Bounds on the OBDD-size of integer multiplication via universal hashing
P Woelfel
Journal of Computer and System Sciences 71 (4), 520-534, 2005
252005
Making objects writable
Z Aghazadeh, W Golab, P Woelfel
Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014
242014
New bounds on the OBDD-size of integer multiplication via universal hashing
P Woelfel
Annual Symposium on Theoretical Aspects of Computer Science, 563-574, 2001
242001
Randomized mutual exclusion with sub-logarithmic RMR-complexity
D Hendler, P Woelfel
Distributed Computing 24 (1), 3-19, 2011
232011
Efficient strongly universal and optimally universal hashing
P Woelfel
International Symposium on Mathematical Foundations of Computer Science, 262-272, 1999
221999
An O(1) RMRs leader election algorithm
WM Golab, D Hendler, P Woelfel
SIAM Journal on Computing 39 (7), 2726-2760, 2010
212010
On the randomness requirements of rumor spreading
G Giakkoupis, P Woelfel
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
202011
Separating deterministic from randomized multiparty communication complexity
P Beame, M David, T Pitassi, P Woelfel
Theory of Computing 6 (1), 201-225, 2010
202010
The system can't perform the operation now. Try again later.
Articles 1–20