Beauty is the first test: there is no permanent place in the world for ugly mathematics - G. H. Hardy.

Sixue (Cliff) Liu

Ph.D. Candidate in Computer Science
Princeton University

Email: Firstname + L at princeton dot edu
Office: 194 Nassau Street 307



Hi! I'm a second-year PhD student in the Theory Group of Computer Science Department at Princeton University, where I'm extremely fortunate to be advised by Robert Tarjan.

Previously, I obtained my M.S. degree from Institute for Interdisciplinary Information Sciences, Tsinghua University. I was also a research intern at Microsoft Research (Redmond).

I'm broadly interested in Algorithms, Data Structures, Combinatorics, and Computational Complexity.


Publications

Selected

  1. Sixue Liu, Robert E. Tarjan. Simple Concurrent Labeling Algorithms for Connected Components.
    To appear in the 2nd Symposium on Simplicity in Algorithms (SOSA 2019).

  2. Sixue Liu. Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT. [arxiv] [slides]
    In the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018).

Others

  1. Sixue Liu. Lower Bounds for Small Ramsey Numbers on Hypergraph. [slides]
    Submitted to a slow-reviewing journal in combinatorics, 2017.

  2. Sixue Liu, Gerard de Melo. Should Algorithms for Random SAT and MaxSAT be Different? [arxiv] [slides]
    In the 31st AAAI Conference on Artificial Intelligence (AAAI 2017).

  3. Sixue Liu, Periklis A. Papakonstantinou. Local Search for Hard SAT Formulas: the Strength of the Polynomial Law. [pdf]
    In the 30th AAAI Conference on Artificial Intelligence (AAAI 2016).

  4. Sixue Liu. An Efficient Implementation for WalkSAT. [arxiv] [code]
    In SAT Competition 2016.


Updates



Last update: October 2018

© 2017 Sixue Liu