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:20250304T150000
DTEND;TZID=Asia/Kolkata:20250304T170000
DTSTAMP:20260924T045028
CREATED:20250304T073434Z
LAST-MODIFIED:20250304T073434Z
UID:1448-1741100400-1741107600@homecse.iitd.ac.in
SUMMARY:Distribution Testing: The New Frontier for Formal Methods
DESCRIPTION:Speaker: Kuldeep S. Meel (Georgia Institute of Technology)\n\n\nAbstract:  The dominant guiding philosophy in the first sixty years of Computer Science was for designers to design systems that were always correct\, and to accept nothing less as users. But times have changed: Users and designers are accustomed to systems with statistical components and behaviors. What does it mean for the formal methods community? In this talk\, we argue that such a dramatic change in the acceptance and design of systems presents exciting opportunities to make fundamental contributions: we need to rethink the notions and techniques for the design of specifications and verification methodologies. In particular\, we will focus on the systems whose behaviors are not naturally captured by symbolic relations but rather require reliance on probability distributions. We will discuss our recent efforts in designing formal methodologies for testing whether a sampling subroutine generates a desired distribution. We will showcase the challenges\, opportunities\, and rewards in our journey.\n\nSpeaker Bio:  Kuldeep Meel holds Stephen Fleming Early-Career Associate Professorship in the School of Computer Science\, and an Associate Professor at the University of Toronto (on leave). His research interests lie at the intersection of Formal Methods and Artificial Intelligence. He is a recipient of the 2022 ACP Early Career Researcher Award\, the 2019 NRF Fellowship for AI\, and was named AI’s 10 to Watch by IEEE Intelligent Systems in 2020. His research program’s recent recognitions include the Distinguished Paper Award at CAV-23 and CAV-24\, ICLP-24 Best Paper Award\,2023  CACM Research Highlight Award\, 2022 ACM SIGMOD Research Highlight\, IJCAI-22 Early Career Spotlight\,  Best Paper Award nominations at ICCAD-21 and DATE-23\, 1st Place in Model Counting Competition (2020 and 2022).  He is passionate about teaching\, and most proud of being recipient of university-level Annual Teaching Excellence Awards in 2022 and 2023.
URL:https://homecse.iitd.ac.in/event/distribution-testing-the-new-frontier-for-formal-methods-2/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250304T160000
DTEND;TZID=Asia/Kolkata:20250304T170000
DTSTAMP:20260924T045028
CREATED:20250225T150648Z
LAST-MODIFIED:20250225T150648Z
UID:1409-1741104000-1741107600@homecse.iitd.ac.in
SUMMARY:Distribution Testing: The New Frontier for Formal Methods
DESCRIPTION:Speaker: Kuldeep S. Meel (Georgia Institute of Technology) \n  \nAbstract:  The dominant guiding philosophy in the first sixty years of Computer Science was for designers to design systems that were always correct\, and to accept nothing less as users. But times have changed: Users and designers are accustomed to systems with statistical components and behaviors. What does it mean for the formal methods community? In this talk\, we argue that such a dramatic change in the acceptance and design of systems presents exciting opportunities to make fundamental contributions: we need to rethink the notions and techniques for the design of specifications and verification methodologies. In particular\, we will focus on the systems whose behaviors are not naturally captured by symbolic relations but rather require reliance on probability distributions. We will discuss our recent efforts in designing formal methodologies for testing whether a sampling subroutine generates a desired distribution. We will showcase the challenges\, opportunities\, and rewards in our journey.\n\nSpeaker Bio:  Kuldeep Meel holds Stephen Fleming Early-Career Associate Professorship in the School of Computer Science\, and an Associate Professor at the University of Toronto (on leave). His research interests lie at the intersection of Formal Methods and Artificial Intelligence. He is a recipient of the 2022 ACP Early Career Researcher Award\, the 2019 NRF Fellowship for AI\, and was named AI’s 10 to Watch by IEEE Intelligent Systems in 2020. His research program’s recent recognitions include the Distinguished Paper Award at CAV-23 and CAV-24\, ICLP-24 Best Paper Award\,2023  CACM Research Highlight Award\, 2022 ACM SIGMOD Research Highlight\, IJCAI-22 Early Career Spotlight\,  Best Paper Award nominations at ICCAD-21 and DATE-23\, 1st Place in Model Counting Competition (2020 and 2022).  He is passionate about teaching\, and most proud of being recipient of university-level Annual Teaching Excellence Awards in 2022 and 2023.
URL:https://homecse.iitd.ac.in/event/distribution-testing-the-new-frontier-for-formal-methods/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250319T120000
DTEND;TZID=Asia/Kolkata:20250319T170000
DTSTAMP:20260924T045028
CREATED:20250317T044243Z
LAST-MODIFIED:20250317T044243Z
UID:1458-1742385600-1742403600@homecse.iitd.ac.in
SUMMARY:Delegation and Verification of Quantum Computation
DESCRIPTION:Prof. Venkata Koppula will be giving a talk on Wednesday\, March 19th\, in Bharti 501. Please note that this is not our usual Monday slot. The talk will begin at 12:00 PM\, with refreshments served at 11:50 AM\, prior to the talk. Below are the details:\n\n\nAbstract: Consider a resource-bounded client that wants to outsource some computation C to a powerful server. The client might want the following desirable features:\n(a) verifiability – some proof that the server has indeed performed the computation C\n(b) blind delegation – the server performs the computation without learning anything about C\n\nI will briefly discuss how these properties can achieved in the classical setting (where both client and server are classical\, but the server is more powerful than the client). Next\, I will discuss some recent progress for these questions in the quantum setting\, where the server is quantum\, and the client is classical. Both these problems can be solved using a single cryptographic tool.\n\nThis will be a (mostly non-technical) survey talk outlining the main results in this domain\, and I will conclude with some (minor/major) open questions. No crypto/quantum background will be assumed for this talk.
URL:https://homecse.iitd.ac.in/event/delegation-and-verification-of-quantum-computation/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250325T120000
DTEND;TZID=Asia/Kolkata:20250325T170000
DTSTAMP:20260924T045028
CREATED:20250317T044524Z
LAST-MODIFIED:20250317T044524Z
UID:1461-1742904000-1742922000@homecse.iitd.ac.in
SUMMARY:The Case for Decentralised Scheduling in Modern Data Centres
DESCRIPTION:Abstract: Modern data centres serve as a backbone for executing diverse workloads. The growing demand for resources has led to high traffic volumes\, requiring clusters to operate at high utilisation. In this talk\, I will examine how current data centre schedulers\, responsible for mapping workload tasks to resources\, perform under such challenging conditions. I will discuss how centralised schedulers struggle to scale under high load\, as they generate significant network traffic by continuously transferring up-to-date node data. Conversely\, distributed schedulers scale well but lack a global cluster view\, leading to suboptimal task allocations. As a result\, existing schedulers impose up to three times longer wait times on tail tasks\, that is\, tasks that finish last among tasks of a job\, leading to increased task and job completion times. \nI will then introduce our work on decentralised scheduling\, focusing on performance\, scalability\, and load balancing. These schedulers have been under-explored due to their design complexity. However\, we demonstrate that Murmuration\, our job-aware decentralised scheduler\, achieves high performance despite its simple approach using approximate load information. It does so by reducing scheduler-node communication overhead while still achieving balanced load distribution across nodes. Prototype evaluations show that Murmuration reduces task wait times under both normal and high cluster loads\, improving median job completion times by 25% as compared to default Kubernetes’ centralised scheduler. Simulations further show that it outperforms various distributed and hybrid schedulers by two orders of magnitude. By the end of this talk\, I hope to convince you that decentralised schedulers strike the right balance between performance and scalability\, and are indeed a practical solution for today’s high utilisation data centres. \nBio: Smita Vijayakumar recently completed her PhD from the Department of Computer Science and Technology at the University of Cambridge\, under the supervision of Evangelia Kalyvianaki. As a part of her thesis\, she developed a novel decentralised scheduling framework to reduce tail task latencies in highly utilised data centres. She has over twelve years of industry experience at companies like Cisco and Juniper\, working on networking\, cloud computing\, and distributed systems. She also has an MS from The Ohio State University\, where her work investigated cloud resource allocation to bottleneck stages for processing streaming applications. Her research has been published in top-tier conferences\, and also as a book. She has also been actively involved in mentoring\, teaching\, and community leadership\, including founding Women Who Go\, India. Smita’s expertise spans resource management\, scheduling\, and scalable distributed systems.
URL:https://homecse.iitd.ac.in/event/the-case-for-decentralised-scheduling-in-modern-data-centres/
LOCATION:SIT 001\, Amar Nath and Shashi Khosla School of Information Technology\, IIT Delhi\, Hauz Khas\, New Delhi 110016\, India\, Delhi\, Delhi\, 110016\, India
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250326T120000
DTEND;TZID=Asia/Kolkata:20250326T130000
DTSTAMP:20260924T045028
CREATED:20250312T025840Z
LAST-MODIFIED:20250312T025840Z
UID:1454-1742990400-1742994000@homecse.iitd.ac.in
SUMMARY:Visual Discovery for Science
DESCRIPTION:Abstract: From social media all the way to satellite images\, we are capturing visual data at an unprecedented scale. These images tell a story about our planet. With advances in automatic recognition\, we can build a collective understanding of world-scale events as recorded through visual media. In this talk\, we will first explore the idea of automatic discovery from visual data in a relatively simpler domain of fashion data from social media images\, where powerful recognition models already exist. I will then discuss my work on an annotation-efficient method for building a multimodal vision-language model in the scientific domain of remote sensing where language annotations are sparse. Finally\, I will present my recent research on building interpretable models for scientific discovery using such black-box vision language models. \n\nBio: Utkarsh Mall is a postdoctoral research scientist in Computer Science at Columbia University. His research also focuses on building interpretable\, reliable\, and data-efficient methods to make novel scientific discoveries from visual data. He has also applied this research in various areas such as agriculture\, anthropology\, archaeology\, urban planning\, public health\, climate science\, etc. Before joining Columbia\, he earned his PhD from Cornell University\, where he worked on building label-efficient foundation models for scientific domains and leveraging them for unsupervised discoveries. He also co-organizes the CVPR workshop: Computer Vision for Science (CV4Science). His doctoral research was selected for the WACV 2022 and CVPR 2023 Doctoral Consortium. \n  \nonline: https://teams.microsoft.com/l/meetup-join/19%3a178c8aaec5e040879a9a053743b825cd%40thread.tacv2/1741628666733?context=%7b%22Tid%22%3a%22624d5c4b-45c5-4122-8cd0-44f0f84e945d%22%2c%22Oid%22%3a%222ac13d43-5ced-4b3c-a68a-5b66063407a9%22%7d
URL:https://homecse.iitd.ac.in/event/visual-discovery-for-science/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250328T120000
DTEND;TZID=Asia/Kolkata:20250328T170000
DTSTAMP:20260924T045028
CREATED:20250327T132705Z
LAST-MODIFIED:20250327T132705Z
UID:1468-1743163200-1743181200@homecse.iitd.ac.in
SUMMARY:An amazing structure for representing all Steiner mincuts of a graph
DESCRIPTION:Speaker: Surender Baswana\, IIT Kanpur \n  \nAbstract: \nMincuts are one of the most well-researched topics in algorithms. In recent years\, there has been phenomenal research on algorithms for computing (s\, t)-mincuts and global mincuts. On the other hand\, the data structural and graph theoretical aspects of mincuts have also been well-researched in the last 50 years\, though they are not as widely known despite being very fundamental and seminal. \n\nWe shall begin with a light discussion of the following 2 classical results. (1) There is a directed acyclic graph that stores all (s\,t)-mincuts of a graph. (2) There is a tree-like graph that stores all global mincuts of a graph.  We shall then discuss a structure that stores Steiner mincuts – generalization of (s\,t)-mincuts and global mincuts. This structure\, designed by Dinitz and Vainshtein is amazingly elegant and beautiful. We shall discuss this structure along with new and much simpler proofs of its properties. \n\nNote: Anyone with basic knowledge of algorithms and elementary graph theory should be able to follow most of the talk. \n\nBiography of the Speaker: \nSurender Baswana is the Tapas Misra Memorial Chair Professor at the Department of Computer Science and Engineering at IIT Kanpur. He did BTech\, MTech\, and PhD from IIT Delhi\, and was a postdoctoral researcher at the Max Planck Institute for Computer Science. He has been a faculty member at IIT Kanpur since 2006. His research area is the design and analysis of algorithms.
URL:https://homecse.iitd.ac.in/event/an-amazing-structure-for-representing-all-steiner-mincuts-of-a-graph/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
END:VCALENDAR