BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Churchill CompSci Talks
SUMMARY:Expander Graphs - Marios Dimitriadis\, Homerton Co
 llege
DTSTART;TZID=Europe/London:20191106T193000
DTEND;TZID=Europe/London:20191106T200000
UID:TALK134494AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/134494
DESCRIPTION:Graphs are a useful mathematical entity with many 
 applications in computer science. Expanders are gr
 aphs with high sparseness  and connectivity (as qu
 antified by measures like Cheeger's constant)\, tw
 o properties that are hard to maximize concurrentl
 y. \n\nThis talk introduces expander graphs\, some
  of their basic properties and describes applicati
 ons such as error correcting codes\, and error red
 uction in probabilist algorithms.
LOCATION:Wolfson Hall\, Churchill College
CONTACT:Matthew Ireland
END:VEVENT
END:VCALENDAR