PODC 2009 (accepted)
|
|
Danny Hendler and Philipp Woelfel
Randomized Mutual Exclusion in O(log N/loglog N) RMRs
|
|
STOC 2009 (accepted)
|
|
Martin Dietzfelbinger and Philipp Woelfel
Tight Lower Bounds for Greedy Routing in
Uniform Small World Rings
|
|
GECCO 2008
|
|
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, and Philipp Woelfel
Precision, Local Search and Unimodal Functions. (Best paper award, theory track.)
|
|
STOC 2008
|
|
Hagit Attiya, Danny Hendler, and Philipp Woelfel
Tight RMR Lower Bounds for Mutual Exclusion and Other Problems
|
|
STACS 2008
|
|
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, and Philipp Woelfel
Tight Bounds for Blind Search on the Integers
|
|
PODC 2007
|
|
Wojciech Golab,
Vassos Hadzilacos, Danny Hendler, and Philipp Woelfel
Constant-RMR Implementations of
CAS and Other Synchronization
Primitives Using Read and Write Operations
|
|
ICALP
2007
|
|
Paul Beame, Matei
David, Toniann Pitassi, and Philipp Woelfel
Separating Deterministic from
Nondeterministic NOF Multiparty Communication Complexity
|
|
| DISC
2006 |
|
Alex Brodsky, Faith
Ellen, and Philipp Woelfel
Fully-Adaptive
Algorithms for
Long-Lived Renaming
|
|
RANDOM
2006
|
|
Philipp Woelfel
Maintaining External Memory Efficient
Hash Tables
|
| PODC
2006 |
|
Wojciech Golab, Danny Hendler,
and Philipp Woelfel
An O(1) RMRs Leader Election Algorithm
|
| SODA
2006 |
|
Philipp Woelfel
Asymmetric
Balanced Allocation
with Simple Hash Functions
|
| ISAAC
2005 |
|
Robin Nunkesser and Philipp
Woelfel
Representation
of Graphs by OBDDs
|
CCC
2005
|
|
Ingo Wegener and Philipp Woelfel
New Results on the Complexity of the Middle Bit of Multiplication
|
| COCOON
2004 |
|
Philipp Woelfel
A
Construction Method for
Optimally Universal Hash Families and its Consequences for the
Existence of RBIBDs
|
MFCS
2003
|
|
Philipp Woelfel
Symbolic
Topological Sorting
with OBDDs
|
STOC
2003
|
|
Martin Sauerhoff and Philipp
Woelfel
Time-Space
Tradeoff Lower
Bounds for Integer Multiplication and Graphs of Arithmetic Functions
|
| STOC
2003 |
|
Martin Dietzfelbinger and
Philipp Woelfel
Almost
Random Graphs with
Simple Hash Functions
|
MFCS
2002
|
|
Beate Bollig and Philipp Woelfel
A
Lower Bound
Technique for Nondeterministic Graph-Driven Read-Once-Branching
Programs and its Applications
|
| IFIP
TCS 2002 |
|
Beate Bollig, Stephan Waack, and
Philipp Woelfel
Parity
Graph-driven
Read-Once Branching Programs and an Exponential Lower Bound for Integer
Multiplication
|
| CCC
2002 |
|
Philipp Woelfel
On
the Complexity of Integer
Multiplication in Branching Programs with Multiple Tests and in
Read-Once Branching Programs with Limited Nondeterminism
|
| STACS
2002 |
|
Philipp Woelfel
A
Lower Bound
Technique for Restricted Branching Programs and Applications
|
| STOC
2001 |
|
Beate Bollig and Philipp Woelfel
A
Read-Once Branching Program
Lower Bound of Omega (2 n/4 ) for Integer Multiplication
using Universal Hashing
|
| STACS
2001 |
|
Philipp Woelfel
New
Bounds on the OBDD-Size
of Integer Multiplication via Universal Hashing
|
| MFCS
1999 |
|
Philipp Woelfel
Efficient Strongly
Universal and Optimally Universal Hashing |