Venue: Bhart501 Abstract: Quantum computing is approaching an inflection point. Global investment is scaling up, hardware platforms are maturing - and the software stack is beginning to form. But what exactly… Read More »Building the Quantum Software Stack – and Verifying It by Prof. Ramanathan S. Thinniyam
Venue: SIT001 Online Link: https://teams.microsoft.com/meet/4492945053702?p=Gz8szja9ebX7NoIitC Abstract: "In an era where AI can synthesize hyper-realistic faces and voices, does the axiom 'seeing is believing' still hold water?" This question strikes at the very… Read More »The End of “Seeing is Believing” – Securing Identity in the Age of Generative AI by Richa Singh
Venue: SIT001 Abstract: Large Language Models (LLMs) demonstrate strong general reasoning ability, yet still suffer from hallucination, limited faithfulness, and a lack of interpretability—especially in knowledge-intensive or domain-specific settings. Knowledge… Read More »Unifying Large Language Models and Knowledge Graphs for Faithful and Interpretable Reasoning by Gholamreza (Reza) Haffari
Speaker:Sukriti Gupta (PhD student), CSE Dept., IIT Delhi Abstract - We consider the problem of file sharing among peers who are connected to a common core network through links of… Read More »Approximating Optimal Broadcast of Files in a Hose-Model Network
Venue: Bharti501 / Teams link will also be shared Abstract: Multiparty session types (MPST) are a type discipline for enforcing the structured, deadlock-free communication of concurrent and message-passing programs. Traditional… Read More »Multiparty Session Types: Separation and Encodability Results by Prof. Nobuko Yoshida
Venue: Bharti501 Abstract: Pretrained transformers readily adapt to new sequence modeling tasks via zero-shot prompting, but relational domains still lack architectures that transfer across datasets and tasks. The core challenge is… Read More »Relational Transformer: Toward Zero-Shot Foundation Models for Relational Data by Rishabh Ranjan
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… Read More »Matroids are Equitable by Hannaneh Akrami
Venue: Bharti 501 Abstract: Suppose Alice uses a t-out-of-n secret sharing to store her secret key on n servers. Her secret key is protected as long as t of them… Read More »Traceable Secret Sharing: Strong Security and Efficient Constructions by Aditi Partap
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… 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… Read More »Coping with choices – List Decoding in Coding Theory by Dr. Shashank Srivastava
