| Influence maximization in social networks when negative opinions may emerge and propagate W Chen, A Collins, R Cummings, T Ke, Z Liu, D Rincon, X Sun, Y Wang, ... Proceedings of the 2011 siam international conference on data mining, 379-390, 2011 | 487 | 2011 |
| A game-theoretic framework to identify overlapping communities in social networks W Chen, Z Liu, X Sun, Y Wang Data Mining and Knowledge Discovery 21 (2), 224-240, 2010 | 260 | 2010 |
| Asymptotically optimal strategy-proof mechanisms for two-facility games P Lu, X Sun, Y Wang, ZA Zhu Proceedings of the 11th ACM conference on Electronic commerce, 315-324, 2010 | 235 | 2010 |
| Efficient density estimation via piecewise polynomial approximation SO Chan, I Diakonikolas, RA Servedio, X Sun Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 138 | 2014 |
| Linear regression without correspondence DJ Hsu, K Shi, X Sun Advances in Neural Information Processing Systems 30, 2017 | 98 | 2017 |
| Learning mixtures of structured distributions over discrete domains S Chan, I Diakonikolas, RA Servedio, X Sun Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 96 | 2013 |
| Efficient massively parallel methods for dynamic programming S Im, B Moseley, X Sun Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 70 | 2017 |
| Near-optimal density estimation in near-linear time using variable-width histograms SO Chan, I Diakonikolas, RA Servedio, X Sun Advances in neural information processing systems 27, 2014 | 68 | 2014 |
| Massively parallel algorithms for finding well-connected components in sparse graphs S Assadi, X Sun, O Weinstein Proceedings of the 2019 ACM Symposium on principles of distributed computing …, 2019 | 67 | 2019 |
| The complexity of optimal multidimensional pricing X Chen, I Diakonikolas, D Paparas, X Sun, M Yannakakis Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 53 | 2014 |
| Approximation algorithms for LCS and LIS with truly improved running times A Rubinstein, S Seddighin, Z Song, X Sun SIAM Journal on Computing 54 (4), FOCS19-276-FOCS19-331, 2025 | 51 | 2025 |
| Participation maximization based on social influence in online discussion forums T Sun, W Chen, Z Liu, Y Wang, X Sun, M Zhang, CY Lin Proceedings of the International AAAI Conference on Web and Social Media 5 …, 2011 | 50 | 2011 |
| On the complexity of optimal lottery pricing and randomized mechanisms X Chen, I Diakonikolas, A Orfanou, D Paparas, X Sun, M Yannakakis 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1464-1479, 2015 | 48 | 2015 |
| Parallel batch-dynamic graphs: Algorithms and lower bounds L Dhulipala, D Durfee, J Kulkarni, R Peng, S Sawlani, X Sun Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 43 | 2020 |
| Community detection in social networks through community formation games W Chen, Z Liu, X Sun, Y Wang IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011 | 43 | 2011 |
| Massively parallel approximation algorithms for edit distance and longest common subsequence MT Hajiaghayi, S Seddighin, X Sun Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 42 | 2019 |
| Fully dynamic st edge connectivity in subpolynomial time W Jin, X Sun 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 40 | 2022 |
| Fast noise removal for k-means clustering S Im, MM Qaem, B Moseley, X Sun, R Zhou International Conference on Artificial Intelligence and Statistics, 456-466, 2020 | 40 | 2020 |
| Faster canonical forms for strongly regular graphs L Babai, X Chen, X Sun, SH Teng, J Wilmes 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 157-166, 2013 | 39 | 2013 |
| Approximating Longest Common Subsequence in Linear Time: Beating the Barrier MT HajiAghayi, M Seddighin, S Seddighin, X Sun SIAM Journal on Computing 51 (4), 1341-1367, 2022 | 38* | 2022 |
