Beauty is the first test: there is no permanent place in the world for ugly mathematics - G. H. Hardy.
Sixue Liu (刘思学)
Ph.D. Student in Computer Science
Office: 194 Nassau Street 307
Hi! I'm a second year PhD student in Department of Computer Science 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'm broadly interested in algorithms, data structures, combinatorics and computational complexity.
- 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).
- Sixue Liu, Gerard de Melo. Should Algorithms for Random SAT and MaxSAT be Different? [pdf] [slides]
In the 31st AAAI Conference on Artificial Intelligence (AAAI 2017).
- 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).
- Sixue Liu. An Efficient Implementation for WalkSAT. [arXiv] [code]
Technical report, 2015.
- I'm in Prague, Czech Republic from July 9th to 13th, 2018. Check out my conference talk here.
- I receive Gordon Y.S. Wu Fellowship in 2017.
- I start an internship in Microsoft Research, Redmond in November 2016.
- In SAT Competition 2016, my solver PolyPower places 4th in random track.
Last update: Jul 2018
© 2018 Sixue Liu