>
Jialin Zhang

Address: Room 841, Institute of Computing Technology, CAS

No.6 Kexueyuan South Road, Zhongguancun

Haidian District, Beijing 100190, China

Email: zhangjialin@ict.ac.cn

Research interests
Submodular maximization, Quantum computing, Approximation algorithm, Algorithmic game theory, Combinatorial optimization, Online algorithm
Education
♦Tsinghua University, Beijing, China. PhD in Applied Mathematics, 2010
♦Tsinghua University, Beijing, China. BS in basic scientific class(Mathematics and Physics), 2006
Employment
♦Postdoctor, University of Southern California, USA, 2010.8 - 2012.8
♦Associate Professor, Institute of Computing Technology, China Academy of Sciences, 2012.9-present.
Publications
♦ Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang; SODA 2020 Accepted.
♦ Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. Xiaohui Bei, Xiaoming Sun, Hao Wu, Jialin Zhang, Zhijie Zhang, Wei Zi; SODA 2020 Accepted.
♦ Revisiting Online Quantum State Learning. Feidiao Yang, Jiaqing Jiang, Xiaoming Sun, Jialin Zhang; AAAI 2020 Accepted.
♦ The One-Round Multi-player Discrete Voronoi Game on Grids and Trees. Xiaoming Sun, Yuan Sun, Zhiyu Xia, Jialin Zhang; The 25th International Computing and Combinatorics Conference (COCOON 2019): 529-540.
♦ The Complexity of Optimization on Grids. Luis Barba, Malte Milatz, Jerri Nummenpalo, Xiaoming Sun, Antonis Thomas, Jialin Zhang, Zhijie Zhang; Algorithmica 81(9): 3494-3518 (2019).
♦ A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization. Zhihuai Chen, Yinan Li, Xiaoming Sun, Pei Yuan, Jialin Zhang; The 28th International Joint Conferences on Artificial Intelligence (IJCAL 2019): 4511-4517.
♦ Querying a Matrix Through Matrix-Vector Products. Xiaoming Sun, David P. Woodruff, Guang Yang, Jialin Zhang; The 46th International Colloquium on Automata, Languages and Programming (ICALP 2019): 94:1-94:16.
♦ Cumulative Activation in Social Networks. Xiaohan Shan, Wei Chen, Qiang Li, Xiaoming Sun, Jialin Zhang; Science China Information Sciences 62(5): 52103:1-52103:21 (2019).
♦ Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems. Feidiao Yang, Tiancheng Jin, Tie-Yan Liu, Xiaoming Sun, Jialin Zhang; the 10th Asian Conference on Machine Learning (ACML 2018): 726-739. (Best student paper award).
♦ Coreness of Cooperative Games with Truncated Submodular Profit Functions. Wei Chen, Xiaohan Shan, Xiaoming Sun, Jialin Zhang; The 11th International Symposium on Algorithmic Game Theory (SAGT 2018): 56-68.
♦ Local unitary classification for sets of generalized Bell states. Bujiao Wu, Jiaqing Jiang, Jialin Zhang, Guojing Tian, Xiaoming Sun; Physical Review A (Phys. Rev. A) 98, 022304 (2018).
♦ Quantum-to-quantum Bernoulli factory problem, Jiaqing Jiang, Jialin Zhang, Xiaoming Sun; Physical Review A (Phys. Rev. A) 97, 032303 (2018).
♦ Influence Maximization with $\varepsilon$-Almost Submodular Threshold Function. Qiang Li, Wei Chen, Xiaoming Sun, Jialin Zhang; the 31st Annual Conference on Neural Information Processing Systems (NIPS 2017): 3804-3814.
♦ Partial Sorting Problem on Evolving Data. Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang; Algorithmica 79(3): 960-983 (2017).
Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. Jia Zhang, Zheng Wang, Qian Li, Jialin Zhang, Yanyan Lan, Qiang Li, Xiaoming Sun; The 31st AAAI Conference on Artificial Intelligence (AAAI 2017): 252-258.
♦ Near Optimal Algorithms for Online Weighted Bipartite Matching in Adversary Model. Xiaoming Sun, Jia Zhang, Jialin Zhang; Journal of Combinatorial Optimization October 2017, Volume 34, Issue 3, pp 689–705.
♦ Communities in Preference Networks: Refined Axioms and Beyond. Gang Zeng, Yuyi Wang, Juhua Pu, Xingwu Liu, Xiaoming Sun, Jialin Zhang; IEEE International Conference on Data Mining (ICDM 2016): 599-608.
♦ On the Optimality of Tape Merge of Two Lists with Similar Size. Qian Li, Xiaoming Sun, Jialin Zhang; The 27th International Symposium on Algorithms and Computation (ISAAC 2016): 51:1-51:17.
♦ The Routing of Complex Contagion in Kleinberg's Small-World Networks. Wei Chen, Qiang Li, Xiaoming Sun, Jialin Zhang; The 22nd International Computing and Combinatorics Conference (COCOON 2016): 307-318.
♦ Shortest Paths on Evolving Graphs. ; Yiming Zou, Gang Zeng, Yuyi Wang, Xingwu Liu, Xiaoming Sun, Jialin Zhang, Qiang Li; The 5th International Conference on Computational Social Networks (CSoNet 2016): 1-13.
♦ Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games. Qizhi Fang, Bo Li, Xiaoming Sun, Jia Zhang, Jialin Zhang; Theoretical Computer Science 609: 500-510 (2016).
♦ How to Select the Top $k$ Elements from Evolving Data? Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang; The 26th International Symposium on Algorithms and Computation (ISAAC 2015): 60-70.
♦ Truthful Cake Cutting Mechanisms with Externalities: Do Not Make Them Care for Others Too Much! Minming Li, Jialin Zhang, Qiang Zhang; The 24th International Joint Conference on Artificial Intelligence (IJCAL 2015): 589-595.
♦ Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network. Peng Zhang, Wei Chen, Xiaoming Sun, Yajun Wang, Jialin Zhang; The 20th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2014): 1306-1315
♦ Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol. Xiaoming Sun, Jia Zhang and Jialin Zhang; The 25th International Symposium on Algorithms and Computation (ISAAC 2014): 661-673
♦ Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games. Qizhi Fang, Bo Li, Xiaoming Sun, Jia Zhang and Jialin Zhang; The 10th Conference on Web and Internet Economics (WINE 2014): 474-479
♦ On the power of breakable objects. Wei Chen, Guangda Hu, Jialin Zhang: Theoretical Computer Science. 503: 89-108 (2013)
♦ Influence Maximization in Dynamic Social Networks. Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang, Xiaoming Sun; IEEE International Conference on Data Mining (ICDM 2013): 1313-1318
♦ Bounded budget betweenness centrality game for strategic network formations. Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu: Theoretical Compute Science. 412(52): 7147-7168 (2011)
♦ Implementing Uniform Reliable Broadcast with Binary Consensus in Systems with Fair-Lossy links. Jialin Zhang, Wei Chen; Information Processing Letters. 110(1): 13-19 (2009)
♦ Bounded cost algorithms for multivalued consensus using binary consensus instances. Jialin Zhang, Wei Chen; Information Processing Letters. 109(17): 1005-1009 (2009)
♦ Bounded Budget Betweenness Centrality Game for Strategic Network Formations. Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu; The 17th Annual European Symposium on Algorithms (ESA 2009): 227-238
♦ Weakening Failure Detectors for k-Set Agreement via the Partition. Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu; The 21st International Symposium on Distributed Computing (DISC 2007): 123-138
♦ Partition Approach to Failure Detectors for k-set Agreement (Brief Announcement). Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu; The 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2007): 306-307
♦ Failure Detectors and Extended Paxos for k-Set Agreement. Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu; 13th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2007): 69-76
♦ Simulating algorithms for undirected st-connectivity on JAGs and NNJAGs. Pinyan Lu, Jialin Zhang, Jin-Yi Cai, Chung Keung Poon; The 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005): 767-776