Philipp Woelfel

Philipp Woelfel

Positions

Professor

Faculty of Science, Department of Computer Science

Associate Head (Graduate Affairs)

Faculty of Science, Department of Computer Science

NSERC CRC II in Randomized and Distributed Algorithms

Faculty of Science, Department of Computer Science

Contact information

Email

woelfel@ucalgary.ca

Web presence

Website

Phone number

Office: +1 (403) 220-7259

Location

Office: ICT614

Research

Areas of Research

Randomized algorithms and data structures, Computational complexity, Theory of distributed computing

Courses

Course number Course title Semester
CPSC 351 Theoretical Foundations of Computer Science II Fall
CPSC 522 Introduction to Randomized Algorithms Fall
CPSC 622 Randomized Algorithms Fall

Awards

  • Best paper award of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing , PODC'12, 2012
  • Best paper award of the 9th International Conference on Quantitative Evaluation of SysTems (QEST) 2012, 2012
  • Best paper award of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing , PODC'11, 2011
  • Best paper award of the formal theory track of the Genetic and Evolutionary Computation Conference, GECCO'08, 2008
  • Dissertation Award, 2004

Publications

  • An Almost Tight RMR Lower Bound for Abortable Test-And-Set. Aryaz Eghbali; Philipp Woelfel. Distributed Computing - 32nd International Symposium (DISC). 21:1-21:19. (2018)
  • An Improved Bound for Random Binary Search Trees with Concurrent Insertions. George Giakkoupis; Philipp Woelfel. 35th International Symposium on Theoretical Aspects of Computer Science (STACS). 37:1-37:13. (2018)
  • Towards a Theory of Randomized Shared Memory Algorithms. Philipp Woelfel. 38th ACM Symposium on Principles of Distributed Computing (PODC). 156. (2019)
  • Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. Zahra Aghazadeh; Philipp Woelfel; Damien Imbs; Michel Raynal; Gadi Taubenfeld. 38th ACM Symposium on Principles of Distributed Computing (PODC). 157-166. (2019)
  • Strongly Linearizable Implementations of Snapshots and Other Types. Philipp Woelfel; Sean Ovens. 38th ACM Symposium on Principles of Distributed Computing (PODC). 197-206. (2019)
  • Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. Philipp Woelfel; George Giakkoupis. 36th ACM Symposium on Principles of Distributed Computing (PODC). 221-229. (2017)
  • Space Lower Bounds for the Signal Detection Problem. Faith Ellen; Leqi Zu; Rati Gelashvili; Philipp Woelfel. 36th International Symposium on Theoretical Aspects of Computer Science (STACS). 26:1-26:13. (2019)
  • Allocate-On-Use Space Complexity of Shared-Memory Algorithms. Bernhard Haeupler; Philipp Woelfel; Alexander Tong; James Aspnes. Distributed Computing - 32nd International Symposium (DISC). 8:1--8:17. (2018)