Algorithms for Communication Systems

Course ID
CEID_ΝΕ5127
Level
Undergraduate
Semester
Winter
Department
Division of Applications and Foundations of Computer Science
Professor
KAKLAMANIS CHRISTOS
ECTS
5
  • Packet routing  
  • Greedy algorithm in meshes – Worst case analysis 
  • Greedy algorithm in butterflies and hypercubes – Worst case analysis 
  • Average case analysis of greedy algorithms 
  • Randomized algorithms for packet routing 
  • Routing in Internet-like networks 
  • The small-world phenomenon
Skip to content