Chihao Zhang

Orcid: 0000-0001-9003-5706

Affiliations:
  • Shanghai Jiao Tong University, China


According to our database1, Chihao Zhang authored at least 27 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
FPTAS for Holant Problems with Log-Concave Signatures.
CoRR, 2024

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits.
CoRR, 2024

Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

On Interpolating Experts and Multi-Armed Bandits.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Improved algorithms for bandit with graph feedback via regret decomposition.
Theor. Comput. Sci., November, 2023

Approximability of the complementarily symmetric Holant problems on cubic graphs.
Theor. Comput. Sci., October, 2023

2022
Rapid Mixing from Spectral Independence beyond the Boolean Domain.
ACM Trans. Algorithms, 2022

A Perfect Sampler for Hypergraph Independent Sets.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Zeros of Holant Problems: Locations and Algorithms.
ACM Trans. Algorithms, 2021

Fast Sampling and Counting <i>k</i>-SAT Solutions in the Local Lemma Regime.
J. ACM, 2021

Understanding Bandits with Graph Feedback.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Fast sampling and counting k-SAT solutions in the local lemma regime.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Counting Hypergraph Colorings in the Local Lemma Regime.
SIAM J. Comput., 2019

2018
Counting hypergraph colourings in the local lemma regime.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
FPTAS for Hardcore and Ising Models on Hypergraphs.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Canonical Paths for MCMC: from Art to Science.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Sampling in Potts Model on Sparse Random Graphs.
Proceedings of the Approximation, 2016

Assignment and Pricing in Roommate Market.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Spatial mixing and approximate counting for Potts model on graphs with bounded average degree.
CoRR, 2015

2014
Radiation hybrid map construction problem parameterized.
J. Comb. Optim., 2014

FPTAS for Weighted Fibonacci Gates and Its Applications.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

FPTAS for Counting Weighted Edge Covers.
Proceedings of the Algorithms - ESA 2014, 2014

The Complexity of Ferromagnetic Two-spin Systems with External Fields.
Proceedings of the Approximation, 2014

2013
Approximate Counting via Correlation Decay on Planar Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Multi-Multiway Cut Problem on Graphs of Bounded Branch Width.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012


  Loading...