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, V. (2024). A simpler and parallelizable O(√log n)-approximation algorithm for sparsest cut. In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 403–414). Nantes, France: Association for Computing Machinery. https://doi.org/10.1145/3626183.3659969
[Published Version]
View
| Files available
| DOI
| arXiv