BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Subhash Khot (New York University)
DTSTART:20200824T140000Z
DTEND:20200824T150000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/1/
 ">Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theo
 rem</a>\nby Subhash Khot (New York University) as part of Prague Summer Sc
 hool on Discrete Mathematics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shayan Oveis Gharan (University of Washington)
DTSTART:20200824T153000Z
DTEND:20200824T163000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/2/
 ">Polynomial Paradigm in Algorithm Design</a>\nby Shayan Oveis Gharan (Uni
 versity of Washington) as part of Prague Summer School on Discrete Mathema
 tics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Subhash Khot (New York University)
DTSTART:20200825T140000Z
DTEND:20200825T150000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/3/
 ">Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theo
 rem</a>\nby Subhash Khot (New York University) as part of Prague Summer Sc
 hool on Discrete Mathematics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shayan Oveis Gharan (University of Washington)
DTSTART:20200825T153000Z
DTEND:20200825T163000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/4/
 ">Polynomial Paradigm in Algorithm Design</a>\nby Shayan Oveis Gharan (Uni
 versity of Washington) as part of Prague Summer School on Discrete Mathema
 tics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Subhash Khot (New York University)
DTSTART:20200826T140000Z
DTEND:20200826T150000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/5/
 ">Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theo
 rem</a>\nby Subhash Khot (New York University) as part of Prague Summer Sc
 hool on Discrete Mathematics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shayan Oveis Gharan (University of Washington)
DTSTART:20200826T153000Z
DTEND:20200826T163000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/6/
 ">Polynomial Paradigm in Algorithm Design</a>\nby Shayan Oveis Gharan (Uni
 versity of Washington) as part of Prague Summer School on Discrete Mathema
 tics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Subhash Khot (New York University)
DTSTART:20200827T140000Z
DTEND:20200827T150000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/7/
 ">Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theo
 rem</a>\nby Subhash Khot (New York University) as part of Prague Summer Sc
 hool on Discrete Mathematics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shayan Oveis Gharan (University of Washington)
DTSTART:20200827T153000Z
DTEND:20200827T163000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/8
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/8/
 ">Polynomial Paradigm in Algorithm Design</a>\nby Shayan Oveis Gharan (Uni
 versity of Washington) as part of Prague Summer School on Discrete Mathema
 tics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Subhash Khot (New York University)
DTSTART:20200828T140000Z
DTEND:20200828T150000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/9/
 ">Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theo
 rem</a>\nby Subhash Khot (New York University) as part of Prague Summer Sc
 hool on Discrete Mathematics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shayan Oveis Gharan (University of Washington)
DTSTART:20200828T153000Z
DTEND:20200828T163000Z
DTSTAMP:20260415T014722Z
UID:PSSDM2020/10
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PSSDM2020/10
 /">Polynomial Paradigm in Algorithm Design</a>\nby Shayan Oveis Gharan (Un
 iversity of Washington) as part of Prague Summer School on Discrete Mathem
 atics 2020\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/PSSDM2020/10/
END:VEVENT
END:VCALENDAR