BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.17.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250424T153000
DTEND;TZID=Asia/Kolkata:20250424T163000
DTSTAMP:20250423T014318Z
CREATED:20250422T033158Z
LAST-MODIFIED:20250423T014318Z
UID:76430-1745508600-1745512200@www.ashoka.edu.in
SUMMARY:CS Seminar:  Karger\'s Min-Cut Algorithm
DESCRIPTION:Abstract: We will discuss Karger's Algorithm\, which is a simple randomized algorithm to compute the global minimum cut of a graph. Karger's algorithm is elementary\, and avoids the use of maximum flows to compute the min cut. \nAbout the Speaker: Aditi is a postdoc in the Big Data Algorithms Group at the University of Salzburg. She has done her PhD from the Computer Science Department of Rutgers University. Her research interests are in graph algorithms. \nWe look forward to your active participation.
URL:https://www.ashoka.edu.in/event/cs-seminar-kargers-mincut-algorithm/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250424T170000
DTEND;TZID=Asia/Kolkata:20250424T183000
DTSTAMP:20250424T043927Z
CREATED:20250424T043927Z
LAST-MODIFIED:20250424T043927Z
UID:76562-1745514000-1745519400@www.ashoka.edu.in
SUMMARY:Write Here\, Write Now: Mastering Academic Prose
DESCRIPTION:
URL:https://www.ashoka.edu.in/event/write-here-write-now-mastering-academic-prose/
END:VEVENT
END:VCALENDAR