Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
1 Publication
2024 | Published | Conference Paper | IST-REx-ID: 17236 | 
Kolmogorov, Vladimir. “A Simpler and Parallelizable O(√log n)-Approximation Algorithm for Sparsest Cut.” Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2024, pp. 403–14, doi:10.1145/3626183.3659969.
[Published Version]
View
| Files available
| DOI
| arXiv