 | 2009 |
|---|
| 38 |       | Danny Hendler,
Philipp Woelfel:
Randomized mutual exclusion in O(log N / log log N) RMRs.
PODC 2009: 26-35 |
| 37 | | Martin Dietzfelbinger,
Philipp Woelfel:
Brief announcement: tight lower bounds for greedy routing in uniform small world rings.
PODC 2009: 300-301 |
| 36 | | Martin Dietzfelbinger,
Philipp Woelfel:
Tight lower bounds for greedy routing in uniform small world rings.
STOC 2009: 591-600 |
| 35 | | Robin Nunkesser,
Philipp Woelfel:
Representation of graphs by OBDDs.
Discrete Applied Mathematics 157(2): 247-261 (2009) |
| 2008 |
|---|
| 34 | | Martin Dietzfelbinger,
Jonathan E. Rowe,
Ingo Wegener,
Philipp Woelfel:
Precision, local search and unimodal functions.
GECCO 2008: 771-778 |
| 33 | | Hagit Attiya,
Danny Hendler,
Philipp Woelfel:
Tight RMR lower bounds for mutual exclusion and other problems.
PODC 2008: 447 |
| 32 | | Martin Dietzfelbinger,
Jonathan E. Rowe,
Ingo Wegener,
Philipp Woelfel:
Tight Bounds for Blind Search on the Integers.
STACS 2008: 241-252 |
| 31 | | Hagit Attiya,
Danny Hendler,
Philipp Woelfel:
Tight rmr lower bounds for mutual exclusion and other problems.
STOC 2008: 217-226 |
| 30 | | Martin Dietzfelbinger,
Jonathan E. Rowe,
Ingo Wegener,
Philipp Woelfel:
Tight Bounds for Blind Search on the Integers
CoRR abs/0802.2852: (2008) |
| 2007 |
|---|
| 29 | | Paul Beame,
Matei David,
Toniann Pitassi,
Philipp Woelfel:
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity.
ICALP 2007: 134-145 |
| 28 | | Wojciech M. Golab,
Vassos Hadzilacos,
Danny Hendler,
Philipp Woelfel:
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations.
PODC 2007: 3-12 |
| 27 | | Ingo Wegener,
Philipp Woelfel:
New Results on the Complexity of the Middle Bit of Multiplication.
Computational Complexity 16(3): 298-323 (2007) |
| 2006 |
|---|
| 26 | | Philipp Woelfel:
Maintaining External Memory Efficient Hash Tables.
APPROX-RANDOM 2006: 508-519 |
| 25 | | Alex Brodsky,
Faith Ellen,
Philipp Woelfel:
Fully-Adaptive Algorithms for Long-Lived Renaming.
DISC 2006: 413-427 |
| 24 | | Wojciech M. Golab,
Danny Hendler,
Philipp Woelfel:
An O(1) RMRs leader election algorithm.
PODC 2006: 238-247 |
| 23 | | Philipp Woelfel:
Asymmetric balanced allocation with simple hash functions.
SODA 2006: 424-433 |
| 22 | | Philipp Woelfel:
Symbolic topological sorting with OBDDs.
J. Discrete Algorithms 4(1): 51-71 (2006) |
| 21 | | Beate Bollig,
Stephan Waack,
Philipp Woelfel:
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication.
Theor. Comput. Sci. 362(1-3): 86-99 (2006) |
| 20 | | Philipp Woelfel:
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs.
Theor. Comput. Sci. 363(1): 76-84 (2006) |
| 2005 |
|---|
| 19 | | Ingo Wegener,
Philipp Woelfel:
New Results on the Complexity of the Middle Bit of Multiplication.
IEEE Conference on Computational Complexity 2005: 100-110 |
| 18 | | Robin Nunkesser,
Philipp Woelfel:
Representation of Graphs by OBDDs.
ISAAC 2005: 1132-1142 |
| 17 | | Philipp Woelfel:
Bounds on the OBDD-size of integer multiplication via universal hashing.
J. Comput. Syst. Sci. 71(4): 520-534 (2005) |
| 16 | | Beate Bollig,
Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.
Theory Comput. Syst. 38(6): 671-685 (2005) |
| 2004 |
|---|
| 15 | | Philipp Woelfel:
A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs.
COCOON 2004: 23-32 |
| 14 | | Ingo Wegener,
Philipp Woelfel:
New Results on the Complexity of the Middle Bit of Multiplication
Electronic Colloquium on Computational Complexity (ECCC)(107): (2004) |
| 2003 |
|---|
| 13 | | Philipp Woelfel:
Symbolic Topological Sorting with OBDDS.
MFCS 2003: 671-680 |
| 12 | | Martin Sauerhoff,
Philipp Woelfel:
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions.
STOC 2003: 186-195 |
| 11 | | Martin Dietzfelbinger,
Philipp Woelfel:
Almost random graphs with simple hash functions.
STOC 2003: 629-638 |
| 2002 |
|---|
| 10 | | Philipp Woelfel:
On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism.
IEEE Conference on Computational Complexity 2002: 80-89 |
| 9 |  | Beate Bollig,
Stephan Waack,
Philipp Woelfel:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.
IFIP TCS 2002: 83-94 |
| 8 | | Beate Bollig,
Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.
MFCS 2002: 131-142 |
| 7 | | Philipp Woelfel:
A Lower Bound Technique for Restricted Branching Programs and Applications.
STACS 2002: 431-442 |
| 2001 |
|---|
| 6 | | Philipp Woelfel:
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing.
STACS 2001: 563-574 |
| 5 | | Beate Bollig,
Philipp Woelfel:
A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal.
STOC 2001: 419-424 |
| 4 | | Beate Bollig,
Philipp Woelfel,
Stephan Waack:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Electronic Colloquium on Computational Complexity (ECCC) 8(073): (2001) |
| 3 | | Philipp Woelfel:
A Lower Bound Technique for Restricted Branching Programs and Applications
Electronic Colloquium on Computational Complexity (ECCC)(101): (2001) |
| 2000 |
|---|
| 2 | | Philipp Woelfel:
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Electronic Colloquium on Computational Complexity (ECCC) 7(46): (2000) |
| 1999 |
|---|
| 1 | | Philipp Woelfel:
Efficient Strongly Universal and Optimally Universal Hashing.
MFCS 1999: 262-272 |
