Skip to main content

Home

Tom Friedetzky

Member of

  • ACiD (Algorithms & Complexity in Durham)
  • NESTiD (Network Engineering, Science and Theory in Durham)

List of some workshops and conferences

Research interests

Theoretical Computer Science, in particular:

  • theoretical foundations of distributed algorithms,
  • randomised algorithms & probabilistic analysis,
  • combinatorial algorithms,
  • evolutionary processes,
  • communication in networks (e.g., broadcasting, rumour spreading),
  • load balancing (especially balls into bins)

Please check out DBLP

Supervised PhD students

Currently supervising

Graduated

  • Chris Wastell – EPSRC DTA funded studentship
  • Sepehr Meshkinfamfard – EU FP7 Marie Curie ITN “Scaling by means of ubiquitous storage” (SCALUS)
  • Lars Nagel – EPSRC 1st Grant scheme

Teaching & Admin 2025/26

Teaching

  • L3 Computational Complexity
  • L3 Design of Algorithms and Data Structures
  • AdvCS Taught MSc Algorithms and Complexity

Admin

  • Sadly, none