Venue: Bharti501 Abstract: We study the online busy time scheduling model on heterogeneous machines. In our setting, jobs with uniform length arrive online with a deadline that becomes known to the algorithm at the job's arrival time. An algorithm has access to machines, each with different associated capacities and costs. The goal is to schedule… Read More »Online Flexible Busy Time Scheduling on Heterogeneous Machines by Gruia Calinescu

Venue: Bharti-501/MS Teams Abstract: The goal of error correcting codes is to encode data in a way that allows for this data to be recovered even if the encoded copy is corrupted by an adversary. The usual algorithmic challenge associated with codes, called decoding, is to output the uncorrupted copy of data by looking only at… Read More »Coping with choices – List Decoding in Coding Theory by Dr. Shashank Srivastava

Venue: SIT001 Abstract:  The vast expansion of online information has shifted the challenge from simply locating data to efficiently filtering and aggregating relevant content from diverse sources. This talk introduces innovative methodologies aimed at enhancing automated information seeking capabilities within intelligent systems. I will present a modular, agent-based framework that decomposes the information-seeking process into navigation,… Read More »Agentic Information Seeking for Knowledge Acquisition by Revanth Reddy

Venue: SIT113 Abstract: The Android operating system uses a permission framework that allows users to control access to their private data, such as location and contacts, when using apps. However, many apps become non-functional or crash if denied these permissions, effectively pressuring users to grant access and compromising their privacy. In this paper, we introduce WhiteLie,… Read More »WhiteLie: A Robust System for Spoofing User Data in Android Platforms by Harish Yadav

Venue: Bharti 501 Abstract: As Language Model Systems (LMS) are deployed across an expanding range of applications, aligning them with human ethics has become crucial. Although recent works propose methods to formally certify LMS properties such as fairness, correct question answering, and safety, these approaches are generally ad hoc and hard to generalize. We introduce a principled… Read More »Lumos: A DSL for Language Model System Certification by Isha Chaudhary

Venue: Bharti501 Abstract: Fluorescence microscopy is limited by optics, fuorophore chemistry, and photon exposure, forcing trade-ofs in speed, resolution, and depth. In this talk, I will discuss my PhD research that addresses these challenges. Specifcally, my PhD research enables imaging of multiple cellular structures within a single fuorescent channel, allowing faster imaging with less photon… Read More »Image decomposition with Fluorescence Microscopy Data by Ashesh

Venue: Bharti501 Abstract: Understanding the algebraic complexity class VNP through alternative characterizations is a central theme in algebraic complexity theory, closely tied to the VP vs. VNP problem. While the permanent provides a canonical complete polynomial for VNP, identifying natural and combinatorial variants that lead to new structural insights remains an important challenge.In this talk,… Read More »A new characterization of VNP via colored determinant by Dr. Prasad Chaugule

Venue: Bharti501 Abstract: In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects each dicut. Woodall conjectured in 1976 that in every digraph, the minimum size of a dicut equals to the maximum number of disjoint dijoins. By building connections… Read More »Approximately Packing Dijoins Via Nowhere-Zero Flows by Dr. Ravi