


default search action
Xiaorui Sun
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Yujie Liu, Xiaorui Sun, Wenbin Shao, Yafu Yuan:
S2ANet: Combining local spectral and spatial point grouping for point cloud processing. Virtual Real. Intell. Hardw. 6(4): 267-279 (2024) - [c37]Youming Qiao, Xiaorui Sun:
Canonical Forms for Matrix Tuples in Polynomial Time. FOCS 2024: 780-789 - [c36]Gábor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, Chuanqi Zhang:
Faster Isomorphism Testing of p-Groups of Frattini Class 2. FOCS 2024: 1408-1424 - [c35]Wenyu Jin, Xiaorui Sun, Mikkel Thorup
:
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. SODA 2024: 2999-3026 - [i25]Wenyu Jin, Xiaorui Sun, Mikkel Thorup:
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. CoRR abs/2401.09700 (2024) - [i24]Youming Qiao, Xiaorui Sun:
Canonical forms for matrix tuples in polynomial time. CoRR abs/2409.12457 (2024) - [i23]Xiaorui Sun, Jun Liu, Heng Tao Shen, Xiaofeng Zhu, Ping Hu:
On Efficient Variants of Segment Anything Model: A Survey. CoRR abs/2410.04960 (2024) - 2023
- [c34]Xiaorui Sun:
Faster Isomorphism for 𝑝-Groups of Class 2 and Exponent 𝑝. STOC 2023: 433-440 - [i22]Xiaorui Sun:
Faster Isomorphism for p-Groups of Class 2 and Exponent p. CoRR abs/2303.15412 (2023) - 2022
- [j7]Weiwei Yan
, Wanying Deng
, Xiaorui Sun
, Zihao Wang
:
Q&A participation and behavioral patterns on academic social networking sites: a comparative study of academic, corporate and government institutions on ResearchGate. Aslib J. Inf. Manag. 74(3): 495-521 (2022) - [j6]Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer. SIAM J. Comput. 51(3): 492-548 (2022) - [j5]MohammadTaghi Hajiaghayi, Masoud Seddighin
, Saeedreza Seddighin, Xiaorui Sun:
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier. SIAM J. Comput. 51(4): 1341-1367 (2022) - [c33]Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun:
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing. SODA 2022: 2549-2579 - [i21]Yichuan Deng, Wenyu Jin, Zhao Song, Xiaorui Sun, Omri Weinstein:
Dynamic Kernel Sparsifiers. CoRR abs/2211.14825 (2022) - 2021
- [c32]Wenyu Jin, Xiaorui Sun:
Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract). FOCS 2021: 861-872 - [c31]Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye:
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS 2021: 989-999 - [c30]MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun:
String Matching with Wildcards in the Massively Parallel Computation Model. SPAA 2021: 275-284 - [i20]Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun:
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. CoRR abs/2110.15944 (2021) - [i19]Aviad Rubinstein, Saeed Seddighin, Zhao Song, Xiaorui Sun:
Approximation Algorithms for LCS and LIS with Truly Improved Running Times. CoRR abs/2111.10538 (2021) - 2020
- [j4]Xiaorui Sun, Can Li
, Fengqun Zhao:
Local discontinuous Galerkin methods for the time tempered fractional diffusion equation. Appl. Math. Comput. 365 (2020) - [c29]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. AISTATS 2020: 456-466 - [c28]Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun:
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. SODA 2020: 1300-1319 - [c27]Kai-Min Chung, Kuan-Yi Ho, Xiaorui Sun:
On the Hardness of Massively Parallel Computation. SPAA 2020: 153-162 - [i18]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. CoRR abs/2003.02433 (2020) - [i17]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. CoRR abs/2003.07285 (2020) - [i16]Wenyu Jin, Xiaorui Sun:
Fully Dynamic c-Edge Connectivity in Subpolynomial Time. CoRR abs/2004.07650 (2020) - [i15]Kai-Min Chung, Kuan-Yi Ho, Xiaorui Sun:
On the Hardness of Massively Parallel Computation. CoRR abs/2008.06554 (2020) - [i14]Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye:
Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR abs/2012.15675 (2020)
2010 – 2019
- 2019
- [c26]Aviad Rubinstein, Saeed Seddighin, Zhao Song, Xiaorui Sun:
Approximation Algorithms for LCS and LIS with Truly Improved Running Times. FOCS 2019: 1121-1145 - [c25]Sepehr Assadi, Xiaorui Sun, Omri Weinstein:
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. PODC 2019: 461-470 - [c24]MohammadTaghi Hajiaghayi, Masoud Seddighin
, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. SODA 2019: 1181-1200 - [c23]MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun:
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. SODA 2019: 1654-1672 - [i13]David Durfee, Laxman Dhulipala, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun:
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. CoRR abs/1908.01956 (2019) - [i12]MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun:
Massively Parallel Algorithms for String Matching with Wildcards. CoRR abs/1910.11829 (2019) - 2018
- [j3]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The complexity of optimal multidimensional pricing for a unit-demand buyer. Games Econ. Behav. 110: 139-164 (2018) - [c22]Krzysztof Onak, Xiaorui Sun:
Probability-Revealing Samples. AISTATS 2018: 2018-2026 - [c21]Krzysztof Onak, Xiaorui Sun:
The query complexity of graph isomorphism: bypassing distribution testing lower bounds. STOC 2018: 165-171 - [i11]Sepehr Assadi, Xiaorui Sun, Omri Weinstein:
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. CoRR abs/1805.02974 (2018) - 2017
- [c20]Alexandr Andoni, Daniel J. Hsu, Kevin Shi, Xiaorui Sun:
Correspondence retrieval. COLT 2017: 105-126 - [c19]Daniel J. Hsu, Kevin Shi, Xiaorui Sun:
Linear regression without correspondence. NIPS 2017: 1531-1540 - [c18]Sungjin Im, Benjamin Moseley, Xiaorui Sun:
Efficient massively parallel methods for dynamic programming. STOC 2017: 798-811 - [i10]Daniel J. Hsu, Kevin Shi, Xiaorui Sun:
Linear regression without correspondence. CoRR abs/1705.07048 (2017) - 2016
- [b1]Xiaorui Sun:
On the isomorphism testing of graphs. Columbia University, USA, 2016 - 2015
- [c17]Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. FOCS 2015: 1464-1479 - [c16]Xiaorui Sun, John Wilmes
:
Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract. STOC 2015: 693-702 - [i9]Xiaorui Sun, John Wilmes:
Structure and automorphisms of primitive coherent configurations. CoRR abs/1510.02195 (2015) - 2014
- [j2]Ming Duan, Mohan Yang, Xiaorui Sun, Bo Zhu, Xuejia Lai:
Distinguishing properties and applications of higher order derivatives of Boolean functions. Inf. Sci. 271: 224-235 (2014) - [c15]Ryan O'Donnell, John Wright, Yu Zhao, Xiaorui Sun, Li-Yang Tan:
A Composition Theorem for Parity Kill Number. CCC 2014: 144-154 - [c14]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. NIPS 2014: 1844-1852 - [c13]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The Complexity of Optimal Multidimensional Pricing. SODA 2014: 1319-1328 - [c12]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio
, Xiaorui Sun:
Efficient density estimation via piecewise polynomial approximation. STOC 2014: 604-613 - [i8]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. CoRR abs/1411.0169 (2014) - 2013
- [c11]László Babai
, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes
:
Faster Canonical Forms for Strongly Regular Graphs. FOCS 2013: 157-166 - [c10]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio
, Xiaorui Sun:
Learning mixtures of structured distributions over discrete domains. SODA 2013: 1380-1394 - [c9]Xi Chen, Xiaorui Sun, Shang-Hua Teng:
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems. STOC 2013: 271-280 - [i7]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Efficient Density Estimation via Piecewise Polynomial Approximation. CoRR abs/1305.3207 (2013) - [i6]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The Complexity of Optimal Multidimensional Pricing. CoRR abs/1311.2138 (2013) - [i5]Ryan O'Donnell, Xiaorui Sun, Li-Yang Tan, John Wright, Yu Zhao:
A composition theorem for parity kill number. CoRR abs/1312.2143 (2013) - 2012
- [c8]Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang:
Information dissemination via random walks in d-dimensional space. SODA 2012: 1612-1622 - [i4]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Learning mixtures of structured distributions over discrete domains. CoRR abs/1210.0864 (2012) - 2011
- [c7]Tao Sun, Wei Chen, Zhenming Liu, Yajun Wang, Xiaorui Sun, Ming Zhang, Chin-Yew Lin:
Participation Maximization Based on Social Influence in Online Discussion Forums. ICWSM 2011 - [c6]Wei Chen
, Zhenming Liu, Xiaorui Sun, Yajun Wang:
Community Detection in Social Networks through Community Formation Games. IJCAI 2011: 2576-2581 - [c5]Wei Chen
, Alex Collins, Rachel Cummings, Te Ke, Zhenming Liu, David Rincón
, Xiaorui Sun, Yajun Wang, Wei Wei, Yifei Yuan:
Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate. SDM 2011: 379-390 - [c4]Wei Chen
, Pinyan Lu
, Xiaorui Sun, Bo Tang, Yajun Wang, Zeyuan Allen Zhu:
Optimal Pricing in Social Networks with Incomplete Information. WINE 2011: 49-60 - [i3]Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang:
Information Dissemination via Random Walks in d-Dimensional Space. CoRR abs/1104.5268 (2011) - 2010
- [j1]Wei Chen
, Zhenming Liu, Xiaorui Sun, Yajun Wang:
A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Discov. 21(2): 224-240 (2010) - [c3]Pinyan Lu
, Xiaorui Sun, Yajun Wang, Zeyuan Allen Zhu:
Asymptotically optimal strategy-proof mechanisms for two-facility games. EC 2010: 315-324 - [i2]Wei Chen, Pinyan Lu, Xiaorui Sun, Yajun Wang, Zeyuan Allen Zhu:
Pricing in Social Networks: Equilibrium and Revenue Maximization. CoRR abs/1007.1501 (2010) - [i1]Ming Duan, Xuejia Lai, Mohan Yang, Xiaorui Sun, Bo Zhu:
Distinguishing Properties of Higher Order Derivatives of Boolean Functions. IACR Cryptol. ePrint Arch. 2010: 417 (2010)
2000 – 2009
- 2009
- [c2]Xiaorui Sun, Xuejia Lai:
The Key-Dependent Attack on Block Ciphers. ASIACRYPT 2009: 19-36 - [c1]Xiaorui Sun, Xuejia Lai:
Improved Integral Attacks on MISTY1. Selected Areas in Cryptography 2009: 266-280
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint