Sign inSign in

Nikhil Bansal is a Professor of Computer Science at UC Berkeley who works on approximation algorithms, online algorithms and discrepancy theory.

More

Nikhil Bansal is a Professor of Computer Science at UC Berkeley who works on approximation algorithms, online algorithms and discrepancy theory. His Simons Institute lecture builds an O((log n)^(1/4)) bound for the Komlós conjecture from Beck–Fiala rounding, subspace random walks and semidefinite programming.

Playlists

1

About

Nikhil Bansal is a Professor of Computer Science at UC Berkeley who works on approximation algorithms, online algorithms and discrepancy theory. His Simons Institute lecture builds an O((log n)^(1/4)) bound for the Komlós conjecture from Beck–Fiala rounding, subspace random walks and semidefinite programming.

Connections

9

Their places, courses, books and lectures.