Seminars

Speaker: Ramneek Kaur, post-doctoral fellow, CSE, IIT Delhi Abstract: With over 70% of India's rural population dependent on agriculture, and 82% of farmers being small and marginal, the availability of water for irrigation is critical to ensuring sustainable rural livelihoods. Government welfare schemes such as the Mahatma Gandhi National Rural Employment Guarantee Act (MGNREGA) play… Read More »Impact Assessment of Natural Resource Management (NRM) Interventions in India

Speaker: Dr. Pritam Choudhury Abstract: In his article „Constructive Mathematics and Computer Programming‟, the renowned logician and type-theorist, Per Martin-Löf notes, "If programming is understood not as the writing of instructions for this or that computing machine but as the design of methods of computation that it is the computer‟s duty to execute (a difference… Read More »Mathematics and Programming: The Past, Present and Future A Personal Perspective

Speaker: Dominik Peters  Abstract: Lindahl equilibrium is a solution concept for allocating a fixed budget across several divisible public goods. It always lies in the core, meaning that the equilibrium allocation satisfies desirable stability and proportional fairness properties. We consider a model where agents have separable linear utility functions over the public goods, and the output… Read More »Computing Lindahl Equilibrium for Public Goods with and without Funding Caps

Speaker: Neeldhara Misra Abstract: Suppose there are n horses and we have a track with k lanes. If we pick k horses to run a race, a linear ordering is established among the chosen horses, based only on the finishing order (race time is not considered). How many races do we need to organize to determine the… Read More »How many matches does it take to find a champion?

Speaker: Prof. Sanjiva Prasad The talk explores a few elementary concepts from abstract algebra that (should) inform our data-centric development of common programs and data types, but are often elided in most textbook treatments.  Included are sets, monoids, boolean algebras, semirings and Kleene algebras, structure-preserving maps and homomorphisms, and notions of co-induction.  The talk is… Read More »Algebra and co- ..in the theory of programming

Speaker: Sumit Diware Abstract: Recent advancements in artificial intelligence (AI) have driven the emergence of real-world cognitive products and services, which rely on neural networks to perform complex tasks. Edge computing for AI (edge-AI) combines data sources with local hardware that executes neural network computations, to improve the response latency, data privacy/security, and service reliability. Computation-in-memory (CIM)… Read More »Computation-In-Memory based Edge-AI for Healthcare: A Cross-Layer Approach

Speaker: Isha Chaudhary Abstract: Large Language Models (LLMs) are increasingly deployed in critical systems, e.g., healthcare and finance and can produce incorrect and biased responses. These can cause huge social and economic losses to the deploying agencies and their clients. Conventional studies are, however, insufficient to thoroughly evaluate LLMs, as they cannot scale to a… Read More »Certifying Large Language Models with LLMCert

Title: Power and limitations of quantum computation and quantum cryptography Speaker: Dr. Srijita Kundu Abstract: Quantum computers are approaching practical viability, and quantum cryptography is already being deployed for secure communication. Understanding the capabilities and limitations of these technologies is crucial for their effective use. My research lies at the intersection of quantum complexity theory… Read More »Power and limitations of quantum computation and quantum cryptography by Dr. Srijita Kundu

Speaker: Surbhi Rajput, MSR Student, CSE Dept., IIT Delhi Abstract: In the (single stock) \emph{trading prophet} problem formulated by Correa et al.\ , an online algorithm observes a sequence of prices of a stock. At each step, the algorithm can either buy the stock by paying the current price if it doesn't already hold the… Read More »Trading Prophets: How to trade multiple stocks optimally

Speaker: Amolak Kalra (https://sites.google.com/view/amolakratankalra/home) Abstract: Efficient decomposition of a unitary operator U using words from a universal gate set G is a fundamental problem in quantum computing. The process by which this is achieved is called circuit synthesis. This problem arises naturally in the context of quantum circuit compilation. In this talk, I will introduce… Read More »Synthesis and Arithmetic of Quantum Circuits