Algorithms Under Uncertainty
Indo-US Virtual Networked Joint Center
Mission Statement

This center aims to foster research collaborations between the partner research groups in India and the US working in several areas related to designing algorithms under uncertainty. These areas (online algorithms, dynamic algorithms, stochastic optimization, and machine learning) approach this general theme in different ways. The center aims to find commonalities that cut across these traditional boundaries.

The centre will enable visits between researchers listed below, at the partner institutions (at the IIT Delhi and Kanpur campuses in India, and at Carnegie Mellon and Duke Universities in the US), in order to foster collaboration and dissemination of ideas related to algorithms that work in uncertain environments.

The virtual networked center is supported by a grant from the Indo-US Science and Technology Forum (IUSSTF).


The partnering institutions and researchers from India and the United States are:


  • Visit of Dr. Amit Kumar to Carnegie Mellon and Duke in June 2018.
  • Visit of Dr. Naveen Garg to Carnegie Mellon in June 2018.
  • Visit of Jatin Batra (PhD student) to Duke University during April-May, 2018
  • Visit of Jai Moondra (BTech student) to Duke University during June-July, 2018


  • Plenary talk at the Symposium on Discrete Algorithms (SODA) 2018 conference, New Orleans by A. Gupta
  • Talk by PI Gupta on stochastic load-balancing at ISMP 2018.
  • Talk by student David Wajc on bin-packing with recourse at ICALP 2018.
  • Talk by PI Gupta on non-preemptive scheduling at ICALP 2018.
  • Talk by student Sahil Singla on prophet ineqaulities at ESA 2018.


  • Elastic Caching
    Anupam Gupta, Ravishakar Krishnaswamy, Amit Kumar and Debmalya Panigrahi
    To appear in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019.

  • Fully-Dynamic Bin Packing with Limited Repacking
    Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers and David Wajc
    International Colloquium on Automata, Languages and Programming (ICALP), 2018.

  • Non-Preemptive Flow-Time Minimization via Rejections
    Anupam Gupta, Amit Kumar and Jason Li
    International Colloquium on Automata, Languages and Programming (ICALP), 2018.

Design based on the CSD Immigration Course webpage.