We study problems in the interface of geometry, probability and combinatorics with an algorithmic lens. Our focus areas include the complexity of randomized algorithms, randomized algorithms for matrix computations and data analysis, random polytopes and convex geometry, smoothed analysis of algorithms, and expander graphs.