BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Randomized algorithms through the st-connectivity framework - Arja
 n Cornelissen (UC Berkeley)
DTSTART:20260408T120000Z
DTEND:20260408T130000Z
UID:TALK246819@talks.cam.ac.uk
CONTACT:Tom Gur
DESCRIPTION:<p><span style="color: rgb(0\, 0\, 0)\;">In this talk\, we wil
 l take a look at a novel the connection between the st-connectivity framew
 ork and randomized and quantum algorithms. Specifically\, I will introduce
  the st-connectivity framework\, and then we will see how randomized algor
 ithms can be represented in this framework. If time permits\, we can also 
 have a look at some applications of the st-connectivity framework.</span><
 /p>
LOCATION:Computer Laboratory\, William Gates Building\, Room SS03
END:VEVENT
END:VCALENDAR