BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1781
DTSTAMP:20261006T063751Z
SUMMARY:A deterministic parallel algorithm for bipartite matching
DESCRIPTION:Speaker: Rohit Gurjar (IIT Bombay)\n\nAbstract: \n\nThe bipart
 ite matching problem is one of the most extensively studied problems in 
 algorithms and complexity theory. Beyond numerous practical applications s
 uch as assigning suitable tasks to machines\, its study has led to several
  influential ideas in the field. In this talk\, we will review the history
  of the problem from the perspective of parallel algorithms and present a 
 recent result that gives the first deterministic parallel algorithm for it
 \, settling a question that had remained open for more than four decades.B
 ased on joint work with Abhranil Chatterjee\, Sumanta Ghosh\, Roshan Raj\,
  and Thomas Thierauf\n \nBio: Rohit Gurjar is a faculty member in the CSE
  department at IIT Bombay since 2018. His research interests center on the
 oretical computer science\, specifically Computational Complexity\, Derand
 omization\, Polyhedral Combinatorics\, and Parallel Complexity. In particu
 lar\, he has worked on the polynomial identity testing\, bipartite matchin
 g and related combinatorial problems. Before joining IITB\, he did his pos
 tdocs at the University of Ulm (Germany)\, Tel Aviv University (Israel)\, 
 and Caltech (USA)\, and obtained his Ph.D. from IIT Kanpur.\n \n \n \n
URL:https://www.tcs.tifr.res.in/web/events/1781
DTSTART;TZID=Asia/Kolkata:20261211T113000
DTEND;TZID=Asia/Kolkata:20261211T121500
LOCATION:Homi Bhabha Auditorium
END:VEVENT
END:VCALENDAR