MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Algorithmic Methods in Combinatorial Discrepancy

Nikhil Bansal
Eindhoven University of Technology.
INF Distinguished Lecture Series

Nikhil Bansal is a Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology.
He did his Bachelors in Computer Science from IIT Mumbai (1999) and obtained 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 and he is on the editorial boards for several journals.
He is also the recipient of a NWO Vidi grant, an ERC consolidator grant and an NWO TOP grant.
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI  
Public Audience
English

Date, Time and Location

Thursday, 14 July 2016
10:00
60 Minutes
E1 4
024
Saarbrücken

Abstract

Discrepancy theory is widely studied area in combinatorics, and has various applications in computer science to areas such as approximation algorithms, space-time lower bounds, geometric algorithms, numerical integration and so on.
In the last few years there has been remarkable progress in our understanding of algorithmic aspects of discrepancy.
In addition to leading to efficient algorithms for various problems where only non-constructive proofs were known before, these methods have also led to improved results and various new connections between discrepancy and convex geometry, optimization and probability.
In this talk, we will give an overview of some of these developments.

Contact

Connie Balzert
--email hidden
passcode not visible
logged in users only

Connie Balzert, 06/20/2016 16:29
Connie Balzert, 06/20/2016 16:27 -- Created document.