I'm now working for the State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, as an assistant researcher. I was adivised by Periklis A. Papakonstantinou as a PhD student in IIIS, Tsinghua University, and just get my degree in 2016. I graduated from computer science department.
I'm interested in complexity and number theory. Recently, my supervisor and me have just make an interesting progress on the depth reduction algorithm for ACC circuits, which will imply strong unconditional ACC circuit lower bounds.
Remark: the author order is alphabetical.
Depth reduction for composites. (with Periklis A. Papakonstantinou) FOCS 2016
Width-Parametrized SAT: Time--Space Tradeoffs. (with Eric Allender, Tiancheng Lou, Periklis A. Papakonstantinou, Bangsheng Tang) Theory of Computing 10 (2014)
Space-bounded communication complexity. (with Joshua Brody, Periklis A. Papakonstantinou, Hao Song, Xiaoming Sun) ITCS 2013
Exponential Lower Bounds for the PPSZ k-SAT Algorithm. (with Dominik Scheder, Bangsheng Tang, Navid Talebanfard) SODA 2013