Duke Computer Science Colloquium

Algorithmic aspects of Discrepancy

Speaker:Nikhil Bansal
Date: Monday, November 13, 2017
Time: 12:00pm - 1:00pm
Location: D106 LSRC, Duke
Lunch will be served.


The theory of computation has benefited greatly from the interplay between the continuous and the discrete. A systematic way to understand this interplay is via discrepancy theory, which is a branch of combinatorics that studies how well the continuous can be approximated by the discrete. In this talk, I will describe various interesting applications of discrepancy to computer science, and give an overview of some of the exciting recent developments in the algorithmic aspects of discrepancy.


Nikhil Bansal is a professor in the Department of Mathematics and Computer Science at the Eindhoven University of Technology. He obtained his Bachelors from IIT Mumbai in 1999, and his PhD from Carnegie Mellon University in 2003. He worked at the IBM T.J. Watson Research Center until 2011, where he also managed the Algorithms group. He is broadly interested in theoretical computer science with focus on the design and analysis of algorithms. He has received several best paper awards for his work, including one at FOCS 2011, and is on the editorial board of the journals JACM, SICOMP and Math of OR.

Hosted by:
Debmalya Panigrahi