Parallel Discrete Sampling via Continuous Walks
Subscribers:
68,600
Published on ● Video Link: https://www.youtube.com/watch?v=vbhcJmNhV9U
Nima Anari (Stanford University)
https://simons.berkeley.edu/talks/nima-anari-stanford-university-2023-06-28
Beyond the Boolean Cube
Nima Anari (Stanford) and collaborators Yizhi Huang, Tianyu Liu, Thuy-Duong Vuong, Brian Xu, and Katherine Yu obtain the first polylogarithmic-time sampling algorithms for determinantal point processes, directed Eulerian tours, and more.
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Beyond the Boolean Cube
Nima Anari