Jingcheng Liu

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Approximate counting, phase transitions and geometry of polynomials.

[BibT_eX]

[DOI]

PhD thesis, 2019

Uniform Sampling Through the Lovász Local Lemma.

[BibT_eX]

[DOI]

Heng Guo

Mark Jerrum

J. ACM, 2019

A deterministic algorithm for counting colorings with 2Δ colors.

[BibT_eX]

[DOI]

CoRR, 2019

Private selection from private candidates.

[BibT_eX]

[DOI]

Kunal Talwar

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Fisher Zeros and Correlation Decay in the Ising Model.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

A Deterministic Algorithm for Counting Colorings with 2-Delta Colors.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017

The Ising Partition Function: Zeros and Deterministic Approximation.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Decentralized Anonymous Micropayments.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

2015

FPTAS for #BIS with Degree Bounds on One Side.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

FPTAS for Counting Monotone CNF.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

FPTAS for #BIS with One Side Degree Bound.

[BibT_eX]

[DOI]

CoRR, 2014

A Simple FPTAS for Counting Edge Covers.

[BibT_eX]

[DOI]

Chengyu Lin

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

FPTAS for Counting Weighted Edge Covers.

[BibT_eX]

[DOI]

Chihao Zhang

Proceedings of the Algorithms - ESA 2014, 2014

The Complexity of Ferromagnetic Two-spin Systems with External Fields.

[BibT_eX]

[DOI]