Jingcheng Liu

Orcid: 0009-0006-1992-1776

Affiliations:
  • Nanjing University, Nanjing, Jiangsu, China
  • University of California, Berkeley, USA (Ph.D.)


According to our database1, Jingcheng Liu authored at least 24 papers between 2014 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances.
CoRR, April, 2025

Phase Transitions via Complex Extensions of Markov Chains.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Optimal quantum sampling on distributed databases.
Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025

Optimality of Matrix Mechanism on ℓpp-metric.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Almost linear time differentially private release of synthetic graphs.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2024
Optimality of Matrix Mechanism on ℓ<sub>p</sub><sup>p</sup>-metric.
CoRR, 2024

Optimal Bounds on Private Graph Approximation.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Uniqueness and Rapid Mixing in the Bipartite Hardcore Model.
CoRR, 2023

Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract).
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2020
Zeros of ferromagnetic 2-spin systems.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Approximate counting, phase transitions and geometry of polynomials.
PhD thesis, 2019

Uniform Sampling Through the Lovász Local Lemma.
J. ACM, 2019

A deterministic algorithm for counting colorings with 2Δ colors.
CoRR, 2019

Private selection from private candidates.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Fisher Zeros and Correlation Decay in the Ising Model.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

A Deterministic Algorithm for Counting Colorings with 2-Delta Colors.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017
The Ising Partition Function: Zeros and Deterministic Approximation.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Decentralized Anonymous Micropayments.
IACR Cryptol. ePrint Arch., 2016

2015
FPTAS for #BIS with Degree Bounds on One Side.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

FPTAS for Counting Monotone CNF.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
FPTAS for #BIS with One Side Degree Bound.
CoRR, 2014

A Simple FPTAS for Counting Edge Covers.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 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


  Loading...