 |
|
||||||||||
Topics in Mathematics of Computer Science
Lecturer: Dr. Maurice Cochand
Coordinator: Aleksander Momot
- Lectures : Tuesday 15-17 HG E 33.1
- Problem classes: Tuesday 14-15 HG E 33.1
Contents: This is a course in graph theory with a focus on new developments in expander graphs. It is suitable for master students in Mathematics or Ph.D. candidates in computer sciences. An expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes.
Examination modus: Oral exam. 'Testat' required.
Problem sheets, solutions to the exercises and information about the 'Testat' can be found here.
Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne
graphische Elemente dargestellt. Die Funktionalität der
Website ist aber trotzdem gewährleistet. Wenn Sie diese
Website regelmässig benutzen, empfehlen wir Ihnen, auf
Ihrem Computer einen aktuellen Browser zu installieren. Weitere
Informationen finden Sie auf
folgender
Seite.
Important Note:
The content in this site is accessible to any browser or
Internet device, however, some graphics will display correctly
only in the newer versions of Netscape. To get the most out of
our site we suggest you upgrade to a newer browser.
More
information
