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.

My main research interests lie in Algorithm Design and Fine-Grained Complexity.

I'm very generously supported by a 2017-18 Gordon Y.S. Wu Fellowship. I was also a research intern at Microsoft Research (Redmond) in the winter of 2016-17.


Recent Papers

  1. S. Cliff Liu. The Curse and Blessing of Not-All-Equal in k-Satisfiability.
    Manuscript, 2019.

  2. S. Cliff Liu, Robert E. Tarjan, Peilin Zhong. Connected Components on a PRAM in Time Logarithmic in the Graph Diameter.
    Manuscript, 2019.

  3. S. Cliff Liu, Robert E. Tarjan. Simple Concurrent Labeling Algorithms for Connected Components. [arxiv] [slides]
    Symposium on Simplicity in Algorithms (SOSA 2019).

  4. 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).

[Full Publications by Categories]

Updates


Last update: March 2019

© 2017 S. Cliff Liu