| Almost 3-approximate correlation clustering in constant rounds S Behnezhad, M Charikar, W Ma, LY Tan 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 20 | 2022 |
| DTL-RnB: Algorithms and tools for summarizing the space of DTL reconciliations W Ma, D Smirnov, J Forman, A Schweickart, C Slocum, S Srinivasan, ... IEEE/ACM transactions on computational biology and bioinformatics 15 (2 …, 2016 | 16 | 2016 |
| Single-pass streaming algorithms for correlation clustering S Behnezhad, M Charikar, W Ma, LY Tan Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 14 | 2023 |
| Unconditional lower bounds for adaptive massively parallel computation M Charikar, W Ma, LY Tan Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 11 | 2020 |
| The power of many samples in query complexity A Bassilakis, A Drucker, M Göös, L Hu, W Ma, LY Tan arXiv preprint arXiv:2002.10654, 2020 | 9 | 2020 |
| DTL reconciliation repair W Ma, D Smirnov, R Libeskind-Hadas BMC bioinformatics 18, 13-21, 2017 | 8 | 2017 |
| Brief announcement: A randomness-efficient massively parallel algorithm for connectivity M Charikar, W Ma, LY Tan Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 3 | 2021 |
| New lower bounds for Massively Parallel Computation from query complexity M Charikar, W Ma, LY Tan arXiv preprint arXiv:2001.01146, 2020 | 1 | 2020 |
| Fully Dynamic Correlation Clustering: Breaking 3-Approximation S Behnezhad, M Charikar, V Cohen-Addad, A Ghafari, W Ma arXiv preprint arXiv:2404.06797, 2024 | | 2024 |
| Correlation Clustering at Scale W Ma Stanford University, 2023 | | 2023 |
| The Power of Many Samples in Query Complexity, ICALP A Bassilakis, A Drucker, M Göös, L Hu, W Ma, LY Tan Leibniz international proceedings in informatics, 2020 | | 2020 |
| Review of “Learning from Untrusted Data,” B Liu, W Ma | | 2018 |
