Sampling random spanning trees faster than matrix multiplication - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva. Sampling random spanning trees faster than matrix multiplication. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 730-742, ACM, 2017. [doi]

This author has not been identified. Look up 'David Durfee' in GoogleThis author has not been identified. Look up 'Rasmus Kyng' in GoogleThis author has not been identified. Look up 'John Peebles' in GoogleThis author has not been identified. Look up 'Anup B. Rao' in GoogleThis author has not been identified. Look up 'Sushant Sachdeva' in Google

runs on WebDSL