Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs. - Pinyan Lu; Jialin Zhang 001; Chung Keung Poon; Jin-yi Cai (ISAAC, 2005)

Partition approach to failure detectors for k-set agreement. - Wei Chen 013; Jialin Zhang 001; Yu Chen; Xuezheng Liu (PODC, 2007)

Failure Detectors and Extended Paxos for k-Set Agreement. - Wei Chen 013; Jialin Zhang 001; Yu Chen; Xuezheng Liu (PRDC, 2007)

Weakening Failure Detectors for k -Set Agreement Via the Partition Approach. - Wei Chen 013; Jialin Zhang 001; Yu Chen; Xuezheng Liu (DISC, 2007)

Bounded cost algorithms for multivalued consensus using binary consensus instances. - Jialin Zhang 001; Wei Chen 013 (Inf. Process. Lett., 2009)

Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links. - Jialin Zhang 001; Wei Chen 013 (Inf. Process. Lett., 2009)

Bounded budget betweenness centrality game for strategic network formations. - Xiaohui Bei; Wei Chen 013; Shang-Hua Teng; Jialin Zhang 001; Jiajie Zhu (Theor. Comput. Sci., 2011)

Distributed Consensus Resilient to Both Crash Failures and Strategic Manipulations - Xiaohui Bei; Wei Chen 013; Jialin Zhang 001 (CoRR, 2012)

Influence Maximization in Dynamic Social Networks. - Honglei Zhuang; Yihan Sun 001; Jie Tang 001; Jialin Zhang 001; Xiaoming Sun 001 (ICDM, 2013)

On the power of breakable objects. - Wei Chen 013; Guangda Hu; Jialin Zhang 001 (Theor. Comput. Sci., 2013)

Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol. - Xiaoming Sun 001; Jia Zhang 004; Jialin Zhang 001 (ISAAC, 2014)

Minimizing seed set selection with probabilistic coverage guarantee in a social network. - Peng Zhang 052; Wei Chen 013; Xiaoming Sun 001; Yajun Wang 001; Jialin Zhang 001 (KDD, 2014)

How to select the largest k elements from evolving data? - Qin Huang; Xingwu Liu; Xiaoming Sun 001; Jialin Zhang 001 (CoRR, 2014)

Deterministic Protocol for Shared $Q$-queue $J$-choice $K$-best Secretary Problem. - Xiaoming Sun 001; Jia Zhang 004; Jialin Zhang 001 (CoRR, 2014)

Truthful Cake Cutting Mechanisms with Externalities: Do Not Make Them Care for Others Too Much! - Minming Li; Jialin Zhang 001; Qiang Zhang (IJCAI, 2015)

How to Select the Top k Elements from Evolving Data? - Qin Huang; Xingwu Liu; Xiaoming Sun 001; Jialin Zhang 001 (ISAAC, 2015)

The Routing of Complex Contagion in Kleinberg's Small-World Networks. - Wei Chen 013; Qiang Li 043; Xiaoming Sun 001; Jialin Zhang 001 (COCOON, 2016)

Shortest Paths on Evolving Graphs. - Yiming Zou; Gang Zeng; Yuyi Wang 001; Xingwu Liu; Xiaoming Sun 001; Jialin Zhang 001; Qiang Li 043 (CSoNet, 2016)

Communities in Preference Networks: Refined Axioms and Beyond. - Gang Zeng; Yuyi Wang 001; Juhua Pu; Xingwu Liu; Xiaoming Sun 001; Jialin Zhang 001 (ICDM, 2016)

Community Detection: a Refined Axiomization and Beyond. - Gang Zeng; Yuyi Wang 001; Xingwu Liu; Xiaoming Sun 001; Jialin Zhang 001 (CoRR, 2016)

Computing the least-core and nucleolus for threshold cardinality matching games. - Qizhi Fang; Bo Li 037; Xiaoming Sun 001; Jia Zhang 004; Jialin Zhang 001 (Theor. Comput. Sci., 2016)

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. - Jia Zhang 004; Zheng Wang; Qian Li 012; Jialin Zhang 001; Yanyan Lan; Qiang Li 043; Xiaoming Sun 001 (AAAI, 2017)

Influence Maximization with ε-Almost Submodular Threshold Functions. - Qiang Li 043; Wei Chen 013; Xiaoming Sun 001; Jialin Zhang 001 (NIPS, 2017)

Partial Sorting Problem on Evolving Data. - Qin Huang; Xingwu Liu; Xiaoming Sun 001; Jialin Zhang 001 (Algorithmica, 2017)

A Linear Algorithm for Finding the Sink of Unique Sink Orientations on Grids. - Xiaoming Sun 001; Jialin Zhang 001; Zhijie Zhang 003 (CoRR, 2017)

Near optimal algorithms for online weighted bipartite matching in adversary model. - Xiaoming Sun 001; Jia Zhang 004; Jialin Zhang 001 (J. Comb. Optim., 2017)

Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems. - Feidiao Yang; Tiancheng Jin; Tie-Yan Liu; Xiaoming Sun 001; Jialin Zhang 001 (ACML, 2018)

A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization. - Zhihuai Chen; Yinan Li; Xiaoming Sun 001; Pei Yuan; Jialin Zhang 001 (IJCAI, 2019)

The Complexity of Optimization on Grids. - Luis Barba; Malte Milatz; Jerri Nummenpalo; Xiaoming Sun 001; Antonis Thomas; Jialin Zhang 001; Zhijie Zhang 003 (Algorithmica, 2019)

Cumulative activation in social networks. - Xiaohan Shan; Wei Chen 013; Qiang Li 043; Xiaoming Sun 001; Jialin Zhang 001 (Sci. China Inf. Sci., 2019)

Revisiting Online Quantum State Learning. - Feidiao Yang; Jiaqing Jiang; Jialin Zhang 001; Xiaoming Sun 001 (AAAI, 2020)

Better Upper Bounds for Searching on a Line with Byzantine Robots. - Xiaoming Sun 001; Yuan Sun 007; Jialin Zhang 001 (Complexity and Approximation, 2020)

Approximate Single-Peakedness in Large Elections. - Zhihuai Chen; Qian Li 012; Xiaoming Sun 001; Lirong Xia; Jialin Zhang 001 (ICKG, 2020)

Decentralized Mining Pool Games in Blockchain. - Zhihuai Chen; Xiaoming Sun 001; Xiaohan Shan; Jialin Zhang 001 (ICKG, 2020)

Optimization from Structured Samples for Coverage Functions. - Wei Chen 013; Xiaoming Sun 001; Jialin Zhang 001; Zhijie Zhang 003 (ICML, 2020)

Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio. - Minming Li; Pinyan Lu; Yuhao Yao; Jialin Zhang 001 (IJCAI, 2020)

Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. - Xiaohui Bei; Xiaoming Sun 001; Hao Wu; Jialin Zhang 001; Zhijie Zhang 003; Wei Zi (SODA, 2020)

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. - Jiaqing Jiang; Xiaoming Sun 001; Shang-Hua Teng; Bujiao Wu; Kewen Wu 001; Jialin Zhang 001 (SODA, 2020)

On the Optimality of Tape Merge of Two Lists with Similar Size. - Qian Li 012; Xiaoming Sun 001; Jialin Zhang 001 (Algorithmica, 2020)

Tight Algorithms for the Submodular Multiple Knapsack Problem. - Xiaoming Sun 001; Jialin Zhang 001; Zhijie Zhang 003 (CoRR, 2020)

Online Convex Optimization with Classical and Quantum Evaluation Oracles. - Jianhao He; Feidiao Yang; Jialin Zhang 001; Lvzhou Li (CoRR, 2020)

Discouraging Pool Block Withholding Attacks in Bitcoins. - Zhihuai Chen; Bo Li 037; Xiaohan Shan; Xiaoming Sun 001; Jialin Zhang 001 (CoRR, 2020)

Coreness of cooperative games with truncated submodular profit functions. - Wei Chen 013; Xiaohan Shan; Xiaoming Sun 001; Jialin Zhang 001 (Theor. Comput. Sci., 2020)

The one-round multi-player discrete Voronoi game on grids and trees. - Xiaoming Sun 001; Yuan Sun 007; Zhiyu Xia; Jialin Zhang 001 (Theor. Comput. Sci., 2020)

Network Inference and Influence Maximization from Samples. - Wei Chen 013; Xiaoming Sun 001; Jialin Zhang 001; Zhijie Zhang 003 (ICML, 2021)

Follow the perturbed approximate leader for solving semi-bandit combinatorial optimization. - Feidiao Yang; Wei Chen 013; Jialin Zhang 001; Xiaoming Sun 001 (Frontiers Comput. Sci., 2021)

Querying a Matrix through Matrix-Vector Products. - Xiaoming Sun 001; David P. Woodruff; Guang Yang 020; Jialin Zhang 001 (ACM Trans. Algorithms, 2021)

Special Issue on the International Conference on Algorithmic Aspects in Information and Management 2019 (AAIM'19). - Xiaoming Sun 001; Jialin Zhang 001 (Theor. Comput. Sci., 2021)

Online Influence Maximization with Node-Level Feedback Using Standard Offline Oracles. - Zhijie Zhang 003; Wei Chen 013; Xiaoming Sun 001; Jialin Zhang 001 (AAAI, 2022)

Bounded Memory Adversarial Bandits with Composite Anonymous Delayed Feedback. - Zongqi Wan; Xiaoming Sun 001; Jialin Zhang 001 (IJCAI, 2022)

Higher order monotonicity and submodularity of influence in social networks: From local to global. - Wei Chen 013; Qiang Li 043; Xiaohan Shan; Xiaoming Sun 001; Jialin Zhang 001 (Inf. Comput., 2022)

Discouraging pool block withholding attacks in Bitcoin. - Zhihuai Chen; Bo Li 037; Xiaohan Shan; Xiaoming Sun 001; Jialin Zhang 001 (J. Comb. Optim., 2022)

Online scheduling of time-critical tasks to minimize the number of calibrations. - Zuzhi Chen; Jialin Zhang 001 (Theor. Comput. Sci., 2022)

Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets. - Zongqi Wan; Zhijie Zhang 003; Tongyang Li; Jialin Zhang 001; Xiaoming Sun 001 (AAAI, 2023)

Simple Deterministic Approximation for Submodular Multiple Knapsack Problem. - Xiaoming Sun 001; Jialin Zhang 001; Zhijie Zhang 003 (ESA, 2023)

Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits. - Zongqi Wan; Jialin Zhang 001; Wei Chen 013; Xiaoming Sun 001; Zhijie Zhang 003 (ICML, 2023)

Improved Deterministic Streaming Algorithms for Non-monotone Submodular Maximization. - Xiaoming Sun 001; Jialin Zhang 001; Shuo Zhang (CoRR, 2023)

Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. - Pinyan Lu; Zihan Luo 004; Jialin Zhang 001 (COCOON (1), 2024)

Competitive Auctions with Imperfect Predictions. - Pinyan Lu; Zongqi Wan; Jialin Zhang 001 (EC, 2024)

Quantum search with prior knowledge. - Xiaoyu He; Xiaoming Sun 001; Jialin Zhang 001 (Sci. China Inf. Sci., 2024)

Boosting Gradient Ascent for Continuous DR-submodular Maximization. - Qixin Zhang 001; Zongqi Wan; Zengde Deng; Zaiyi Chen; Xiaoming Sun 001; Jialin Zhang 001; Yu Yang 001 (CoRR, 2024)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions. - Zongqi Wan; Jialin Zhang 001; Xiaoming Sun 001; Zhijie Zhang 003 (CoRR, 2024)

Improved deterministic algorithms for non-monotone submodular maximization. - Xiaoming Sun 001; Jialin Zhang 001; Shuo Zhang; Zhijie Zhang 003 (Theor. Comput. Sci., 2024)

Efficient Quantum Circuit Synthesis for SAT-Oracle With Limited Ancillary Qubit. - Shuai Yang; Wei Zi; Bujiao Wu; Cheng Guo; Jialin Zhang 001; Xiaoming Sun 001 (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2024)

Erratum to: Quantum search with prior knowledge. - Xiaoyu He; Xiaoming Sun; Jialin Zhang 001 (Sci. China Inf. Sci., 2025)

Deterministic streaming algorithms for non-monotone submodular maximization. - Xiaoming Sun; Jialin Zhang 001; Shuo Zhang (Frontiers Comput. Sci., 2025)