>
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
Social network, Online algorithm, Approximation algorithm, Algorithmic game theory, combinatorial optimization
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
♦ Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. Jia Zhang, Zheng Wang, Qian Li, Jialin Zhang, Yanyan Lan, Qiang Li and Xiaoming Sun; The 31st AAAI Conference on Artificial Intelligence (AAAI 2017)
♦ Near Optimal Algorithms for Online Weighted Bipartite Matching in Adversary Model. Xiaoming Sun, Jia Zhang and Jialin Zhang; Journal of Combinatorial Optimization (accepted)
♦ Gang Zeng, Yuyi Wang, Juhua Pu, Xingwu Liu, Xiaoming Sun, Jialin Zhang: Communities in Preference Networks: Refined Axioms and Beyond. IEEE International Conference on Data Mining (ICDM 2016).
♦ On the Optimality of Tape Merge of Two Lists with Similar Size. Qian Li, Xiaoming Sun and Jialin Zhang; The 27th International Symposium on Algorithms and Computation (ISAAC 2016)
♦ 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, and 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 and 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