Chihao Zhang's Homepage

Chihao Zhang 张驰豪

I am an Assistant Professor in John Hopcroft Center for Computer Science at Shanghai Jiao Tong University.

I obtained a PhD degree from Department of Computer Science and Engineering, Shanghai Jiao Tong University in 2016, under the supervision of Prof. Yuxi Fu and Prof. Pinyan Lu. I stayed in Institute of Theoretical Computer Science and Communications, The Chinese University of Hong Kong as a postdoctoral fellow from 2016 to 2018.

Contact

Postal Address

Department of Computer Science and Engineering
Shanghai Jiao Tong University
800 Dongchuan Rd, Shanghai, China

Office

Room 1402-2, School of Software

Email

firstname.lastname AT gmail.com

Research Interests

I am interested in theoretical computer science. Currently, I mainly work on counting and sampling algorithms.

Papers

Counting hypergraph colorings in the local lemma regime

with Heng Guo, Chao Liao and Pinyan Lu.

In Proceedings of the 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC'18), pp. 926-938, 2018

FPTAS for counting proper colorings on cubic graphs

with Pinyan Lu, Kuan Yang and Minshen Zhu.

In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'17), pp.1798-1817, 2017.

Sampling in Potts model on sparse random graphs

with Yitong Yin.

In Proceedings of the 20th International Workshop on Randomization and Computation (RANDOM'16), 47:1-47:22, 2016.

FPTAS for hardcore and Ising models on hypergraphs

with Pinyan Lu and Kuan Yang.

In Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS'16), 51:1-51:14, 2016.

Assignment and pricing in roommate market

with Pak Hay Chan, Xin Huang, Zhengyang Liu and Shengyu Zhang.

In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI'16), pp.446-452, 2016.

Canonical paths for MCMC: from art to science

with Lingxiao Huang and Pinyan Lu.

In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'16), pp.514-527, 2016.

Counting problems in parameterized complexity

with Yijia Chen.

Tsinghua Science and Technology, 19(04), 410-420, 2014.

FPTAS for counting weighted edge covers

with Jingcheng Liu and Pinyan Lu.

In Proceedings of the 22nd European Symposium on Algorithms (ESA'14), pp.654-665, 2014.

The complexity of ferromagnetic two-spin systems with external fields

with Jingcheng Liu and Pinyan Lu.

A slightly older version can be found on arxiv.

In Proceedings of the 18th International Workshop on Randomization and Computation (RANDOM'14), pp.843-856, 2014.

FPTAS for weighted Fibonacci gates and its applications

with Pinyan Lu and Menghui Wang.

In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP'14), pp.787-799, 2014.

Multi-multiway cut problem on graphs of bounded branch width

with Xiaojie Deng and Bingkai Lin.

In Proceedings of the 6th International Frontiers of Algorithmics Workshop and the 8th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM'13), pp. 315-324, 2013.

Approximate counting via correlation decay on planar graphs

with Yitong Yin.

In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13), pp.47-66, 2013.

Radiation hybrid map construction problem parameterized

with Binhai Zhu and Haitao Jiang.

Journal of Combinatorial Optimization, 27(1), 3-13, 2014.

Conference version appeared in Proceedings of the 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA'12), pp.127-137, 2012.

Fixed-parameter tractability of almost CSP problem with decisive relations

with Hongyang Zhang.

In Proceedings of the 6th International Frontiers of Algorithmics Workshop and the 8th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM'12), pp. 224-234, 2012.

Last modified: Fri. Aug. 10, 2018