Concepedia
Statistics
Publications
33
Citations
826
H-Index
18
Active since
2001
Affiliations
University of Calgary(Current)
TU Dortmund University
Centre Inria de l'Université de Rennes
Institut national de recherche en sciences et technologies du numérique
University of Toronto
Philipp Woelfel is an author at University of Calgary specializing in engineering, computer science, and computational complexity.
Top concepts
EngineeringComputer ScienceComputational ComplexityParallel ComputingParallel ProgrammingComputer EngineeringFormal MethodsProbabilityDiscrete MathematicsCombinatorial Optimization
Publications per year
2001–2021
Almost random graphs with simple hash functions
Martin Dietzfelbinger, Philipp Woelfel · 2003 · 90 citations
Theory Of Computing, Simple Randomized Construction, Engineering +15
Tight RMR lower bounds for mutual exclusion and other problems
Hagit Attiya, Danny Hendler, Philipp Woelfel · 2008 · 76 citations
Mathematical Programming, Computational Complexity Theory, Engineering +22
Linearizable implementations do not suffice for randomized distributed computation
Wojciech Golab, Lisa Highám, Philipp Woelfel · 2011 · 68 citations · Full text
Cryptographic Primitive, Engineering, Information Security +20
Symbolic topological sorting with OBDDs
Philipp Woelfel · Journal of Discrete Algorithms · 2005 · 43 citations
Engineering, Automated Reasoning, Sorting Algorithm +5
On the time and space complexity of randomized test-and-set
George Giakkoupis, Philipp Woelfel · 2012 · 35 citations
Computational Complexity Theory, Engineering, Computational Complexity +19
1–5 of 33