Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

Since the very first days of computer science — a field known for its methodical approach to problem-solving — randomness has played an important role. The first program to run on the world’s first ...

The DOE SC program in Advanced Scientific Computing Research (ASCR) hereby announces its interest in basic research in the design, development, analysis, and scalability of randomized algorithms for ...

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...

*Please note this will be a 0 credit 3-week course during the weeks of May 1-17. This course does not fulfill the Technical Elective area.