Xiaorui Sun

Zihao Wang

Aslib J. Inf. Manag., 2022

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ<sub>1</sub>-Oblivious Routing.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing.

[BibT_eX]

[DOI]

CoRR, 2021

String Matching with Wildcards in the Massively Parallel Computation Model.

[BibT_eX]

[DOI]

Hamed Saleh

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Minor Sparsifiers and the Distributed Laplacian Paradigm.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract).

[BibT_eX]

[DOI]

Wenyu Jin

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Fully Dynamic c-Edge Connectivity in Subpolynomial Time.

[BibT_eX]

[DOI]

Wenyu Jin

CoRR, 2020

Local discontinuous Galerkin methods for the time tempered fractional diffusion equation.

[BibT_eX]

[DOI]

Can Li

Fengqun Zhao

Appl. Math. Comput., 2020

On the Hardness of Massively Parallel Computation.

[BibT_eX]

[DOI]

Kai-Min Chung

Kuan-Yi Ho

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Fast Noise Removal for k-Means Clustering.

[BibT_eX]

[DOI]

Sungjin Im

Mahshid Montazer Qaem

Benjamin Moseley

Rudy Zhou

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Massively Parallel Algorithms for String Matching with Wildcards.

[BibT_eX]

[DOI]

Hamed Saleh

CoRR, 2019

Approximating LCS in Linear Time: Beating the √n Barrier.

[BibT_eX]

[DOI]

Masoud Seddighin

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs.

[BibT_eX]

[DOI]

Sepehr Assadi

Omri Weinstein

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Approximation Algorithms for LCS and LIS with Truly Improved Running Times.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

The complexity of optimal multidimensional pricing for a unit-demand buyer.

[BibT_eX]

[DOI]

Games Econ. Behav., 2018

The query complexity of graph isomorphism: bypassing distribution testing lower bounds.

[BibT_eX]

[DOI]

Krzysztof Onak

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Probability-Revealing Samples.

[BibT_eX]

[DOI]

Krzysztof Onak

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

Efficient massively parallel methods for dynamic programming.

[BibT_eX]

[DOI]

Sungjin Im

Benjamin Moseley

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Linear regression without correspondence.

[BibT_eX]

[DOI]

Daniel J. Hsu

Kevin Shi

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Correspondence retrieval.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

2016

On the isomorphism testing of graphs.

[BibT_eX]

[DOI]

PhD thesis, 2016

2015

Structure and automorphisms of primitive coherent configurations.

[BibT_eX]

[DOI]

John Wilmes

CoRR, 2015

Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract.

[BibT_eX]

[DOI]

John Wilmes

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Distinguishing properties and applications of higher order derivatives of Boolean functions.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Efficient density estimation via piecewise polynomial approximation.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

The Complexity of Optimal Multidimensional Pricing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

A Composition Theorem for Parity Kill Number.

[BibT_eX]

[DOI]

Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013

Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems.

[BibT_eX]

[DOI]

Xi Chen

Shang-Hua Teng

Proceedings of the Symposium on Theory of Computing Conference, 2013

Learning mixtures of structured distributions over discrete domains.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Faster Canonical Forms for Strongly Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Information dissemination via random walks in <i>d</i>-dimensional space.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Information Dissemination via Random Walks in d-Dimensional Space

[BibT_eX]

[DOI]

CoRR, 2011

Optimal Pricing in Social Networks with Incomplete Information.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate.

[BibT_eX]

[DOI]

Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

Community Detection in Social Networks through Community Formation Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Participation Maximization Based on Social Influence in Online Discussion Forums.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Weblogs and Social Media, 2011

2010

Distinguishing Properties of Higher Order Derivatives of Boolean Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

A game-theoretic framework to identify overlapping communities in social networks.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2010

Pricing in Social Networks: Equilibrium and Revenue Maximization

[BibT_eX]

[DOI]

CoRR, 2010

Asymptotically optimal strategy-proof mechanisms for two-facility games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

2009

Improved Integral Attacks on MISTY1.

[BibT_eX]

[DOI]

Xuejia Lai

Proceedings of the Selected Areas in Cryptography, 16th Annual International Workshop, 2009

The Key-Dependent Attack on Block Ciphers.

[BibT_eX]

[DOI]