• Derandomizing Algorithms via Spectral Graph Theory

    CMSA 20 Garden Street, Cambridge, MA, United States

    Speaker: Salil Vadhan (Harvard) Title: Derandomizing Algorithms via Spectral Graph Theory Abstract: Randomization is a powerful tool for algorithms; it is often easier to design efficient algorithms if we allow the algorithms to "toss coins" […]