Abstract: Ultra Large-scale Linear Programming refers to class of problems where number of linear inequality constraints grows exponentially w.r.t. the number of variables.

Abstract: An Algebraic Branching Program (ABP) is a layered graph where each edge is labeled by an affine linear form and the first and the last layer have one vertex each, called the “start” and the “end” vertex respectively.

"2nd UNESCO World Logic Day Celebration Lecture"

Abstract: Anomaly detection is a ubiquitous problem in machine learning. Here one is given a large population of points, we may not have much knowledge about their structure a priori.