Algorithms for Communication Systems

Course Code: 
CEID_ΝΕ5127
Period: 
Winter Semester
Credit Points: 
5

Course outline

  • 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

Startup Growth Lite is a free theme, contributed to the Drupal Community by More than Themes.