[Back to Homepage]
- S. Cliff Liu, Robert E. Tarjan, Peilin Zhong. Connected Components on a PRAM in Time Logarithmic in the Graph Diameter.
- S. Cliff Liu, Robert E. Tarjan. Simple Concurrent Labeling Algorithms for Connected Components. [arxiv] [slides]
Symposium on Simplicity in Algorithms (SOSA 2019)
- S. Cliff Liu. A Simple Partial Derandomization of PPSZ.
- S. Cliff Liu. The Curse and Blessing of Not-All-Equal in k-Satisfiability.
- S. Cliff Liu. Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT. [arxiv] [slides]
International Colloquium on Automata, Languages, and Programming (ICALP 2018)
- S. Liu, Gerard de Melo. Should Algorithms for Random SAT and MaxSAT be Different? [arxiv] [slides]
AAAI Conference on Artificial Intelligence (AAAI 2017)
- S. Liu, Periklis A. Papakonstantinou. Local Search for Hard SAT Formulas: the Strength of the Polynomial Law. [pdf]
AAAI Conference on Artificial Intelligence (AAAI 2016)
- S. Liu. An Efficient Implementation for WalkSAT. [arxiv] [code]
SAT Competition 2016
- S. Cliff Liu. Lower Bounds for Small Ramsey Numbers on Hypergraphs. [arxiv] [slides]
International Computing and Combinatorics Conference (COCOON 2019)
Last update: May 2019
© 2017 S. Cliff Liu