Academic year 2010/2011 - Spring semester
Interest in algorithmic problems
Networks and distributed computing in general are essential in modern computing and information systems. Examples are on the one hand large-scale networks such as the Internet, and on the other hand multiprocessors such as the one in your new multi-core laptop. This course introduces the principles of network algorithms and distributed computing, emphasizing the fundamental issues underlying the design of networks and distributed systems: communication, coordination, fault-tolerance, locality, parallelism, self-organization, symmetry breaking, synchronization, uncertainty. We explore essential algorithmic ideas and lower bound techniques.
The course is also open to Master students.