BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Science and Engineering - ECPv6.13.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computer Science and Engineering
X-ORIGINAL-URL:https://homecse.iitd.ac.in
X-WR-CALDESC:Events for Computer Science and Engineering
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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20251209T140000
DTEND;TZID=Asia/Kolkata:20251209T150000
DTSTAMP:20260922T154234
CREATED:20251208T052758Z
LAST-MODIFIED:20251208T052758Z
UID:2233-1765288800-1765292400@homecse.iitd.ac.in
SUMMARY:Approximating Optimal Broadcast of Files in a Hose-Model Network
DESCRIPTION:Speaker:Sukriti Gupta (PhD student)\, CSE Dept.\, IIT Delhi\nAbstract -\nWe consider the problem of file sharing among peers who are connected to \na common core network through links of differing upload and download \ncapacities\, as is the case in networks provisioned according to the hose \nmodel. The file is assumed to be divided into equal-sized chunks\, and a \npeer can start sending a “chunk” of the file to another peer only after \nit has received the entire chunk. The objective is to share a chunk\, \ninitially residing on one of the peers\, with all other peers in the \nleast time possible. Peers can simultaneously send/receive parts of a \nchunk to/from multiple peers\, subject to the upload and download \ncapacity constraints.
URL:https://homecse.iitd.ac.in/event/approximating-optimal-broadcast-of-files-in-a-hose-model-network/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20251211T110000
DTEND;TZID=Asia/Kolkata:20251211T170000
DTSTAMP:20260922T154234
CREATED:20251209T113155Z
LAST-MODIFIED:20251209T113155Z
UID:2239-1765450800-1765472400@homecse.iitd.ac.in
SUMMARY:Multiparty Session Types: Separation and Encodability Results by Prof. Nobuko Yoshida
DESCRIPTION:Venue: Bharti501 / Teams link will also be shared \nAbstract: Multiparty session types (MPST) are a type discipline for enforcing the structured\, deadlock-free communication of concurrent and message-passing programs. Traditional MPST have a limited form of choice in which alternative communication possibilities are offered by a single participant and selected by another. Mixed choice multiparty session types (MCMP) extend the choice construct to include both selections and offers in the same choice. This talk presents a mixed-choice synchronous multiparty session calculus and its typing system\, which guarantees communication safety and deadlock-freedom. We then talk of expressiveness of nine subcalculi of the MCMP-calculus by examining their encodability (there exists a good encoding from one to another) and separation (there exists no good encoding from one calculus to another). The highlight is that the binary (2-party) mixed sessions by Casal et al. (2022) are strictly less expressive than the MCMP-calculus. \n\nJoint work with Kirstin Peters appeared in LICS’24 (https://arxiv.org/abs/2405.08104) \nAbout the speaker. Nobuko Yoshida is Christopher Strachey Chair of Computer Science in University of Oxford. She is an EPSRC Established Career Fellow and an Honorary Fellow at Glasgow University. Last 10 years\, her main research interests are theories and applications of protocol specification and verification. She introduced multiparty session types [ POPL’08\, JACM ] which received the Most Influential POPL Paper Award in 2018 (judged by its influence over the last decade). This work enlarged the community and widened the scope of applications of session types\, e.g. runtime monitoring based on Scribble (co-developed with Red Hat) has been deployed to other projects such as cyberinfrastructure in the US Ocean Observatories Initiative (OOI); and widened the scope of her research areas. She received the Test-of-time-award from PPDP’24 and the best paper awards from CC’20\, COORDINATION’23 and DisCoTech’23. She received the third Suffrage Science Award for Mathematics and Computing from MRC for her STEM activity. She is an editor of ACM Transactions on Programming Languages and Systems\, Theoretical Computer Science\,  ACM Formal Aspects of Computing\, Mathematical Structures in Computer Science\, Journal of Logical Algebraic Methods in Programming\, and the chief editor of The Computer-aided Verification and Concurrency Column for EATCS Bulletin.
URL:https://homecse.iitd.ac.in/event/multiparty-session-types-separation-and-encodability-results-by-prof-nobuko-yoshida/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20251215T120000
DTEND;TZID=Asia/Kolkata:20251215T130000
DTSTAMP:20260922T154234
CREATED:20251209T045950Z
LAST-MODIFIED:20251209T045950Z
UID:2235-1765800000-1765803600@homecse.iitd.ac.in
SUMMARY:Matroids are Equitable by Hannaneh Akrami
DESCRIPTION:Abstract: We show that if the ground set of a matroid can be partitioned into k≥2 bases\, then for any given subset S of the ground set\, there is a partition into k bases such that the sizes of the intersections of the bases with S may differ by at most one. This settles the matroid equitability conjecture by Fekete and Szabó (Electron.~J.~Comb.~2011) in the affirmative. We also investigate equitable splittings of two disjoint sets S1 and S2\, and show that there is a partition into k bases such that the sizes of the intersections with S1 may differ by at most one and the sizes of the intersections with S2 may differ by at most two; this is the best possible one can hope for arbitrary matroids. \nWe also derive applications of this result into matroid constrained fair division problems. We show that there exists a matroid-constrained fair division that is envy-free up to 1 item if the valuations are identical and tri-valued additive. We also show that for bi-valued additive valuations\, there exists a matroid-constrained allocation that provides everyone their maximin share. \nThis is based on joint work with Siyue Liu\, Roshan Raj\, and László A. Végh. \nSpeaker Bio: Hannaneh Akrami is a postdoctoral fellow at the University of Bonn and a Minerva Fast-track fellow at MPI-Informatik. She obtained her PhD from the University of Saarlandes and MPI-Informatik in 2024 and completed a BSc from Sharif University of Technology in 2019. Her interests are in fair division\, Algorithmic Game theory\, Combinatorics\, Graph theory and Approximation algorithms. \n 
URL:https://homecse.iitd.ac.in/event/matroids-are-equitable-by-hannaneh-akrami/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
END:VCALENDAR