Woelfel, Philipp - Department of Computer Science, University of Calgary

• A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs
• Symbolic Topological Sorting with OBDDs (Extended Abstract)
• Ecient Strongly Universal and Optimally Universal Hashing
• A Construction Method for Optimally Universal Hash Families and its Consequences for the
• An O(1) RMRs Leader Election Algorithm [Extended Abstract]
• PARITY GRAPH-DRIVEN READ-ONCE BRANCHING PROGRAMS AND AN
• Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
• On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in ReadOnce Branching Programs with Limited
• On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited
• Symbolic Topological Sorting with OBDDs (Extended Abstract)
• Symbolic Topological Sorting with OBDDs Philipp Woelfel
• Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
• ber die Komplexitt der Multiplikation in eingeschrnkten
• Tight RMR Lower Bounds for Mutual Exclusion and Other Problems
• Constant-RMR Implementations of CAS and Other Synchronization Primitives Using Read and Write
• Asymmetric Balanced Allocation with Simple Hash Functions Philipp Woelfel
• A Construction Method for Optimally Universal Hash Families and its Consequences for the
• Symbolic Topological Sorting with OBDDs Philipp Woelfel
• Time-Space Tradeoff Lower Bounds for Integer Multiplication and Graphs of Arithmetic Functions
• A Lower Bound Technique for Restricted Branching Programs and Applications
• Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
• Efficient Strongly Universal and Optimally Universal Hashing
• New Results on the Complexity of the Middle Bit of Multiplication
• Precision, Local Search and Unimodal Functions Martin Dietzfelbinger
• An O(1) RMRs Leader Election Algorithm [Extended Abstract]
• Almost Random Graphs with Simple Hash Functions Martin Dietzfelbinger
• A ReadOnce Branching Program Lower Bound for Integer Multiplication Using Universal Hashing
• Bounds on the OBDDSize of Integer Multiplication via Universal Hashing
• Bounds on the OBDDSize of Integer Multiplication via Universal Hashing
• A Lower Bound Technique for Restricted Branching Programs and Applications
• PARITY GRAPH-DRIVEN READ-ONCE BRANCHING PROGRAMS AND AN
• Almost Random Graphs with Simple Hash Functions Martin Dietzfelbinger
• New Results on the Complexity of the Middle Bit of Multiplication
• PARITY GRAPH-DRIVEN READ-ONCE BRANCHING PROGRAMS AND AN
• On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited
• Asymmetric Balanced Allocation with Simple Hash Functions # Philipp Woelfel +
• TimeSpace Tradeoff Lower Bounds for Integer Multiplication and Graphs of Arithmetic Functions
• A Construction Method for Optimally Universal Hash Families and its Consequences for the Existence of
• A Lower Bound Technique for Restricted Branching Programs and Applications
• A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs
• A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs
• New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
• ber die Komplexitt der Multiplikation in eingeschrnkten
• A Construction Method for Optimally Universal Hash Families and its Consequences for the Existence of
• A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs