Our knowledge can only be finite, while our ignorance must necessarily be infinite.
- Karl Popper
My research interest is theoretical computer science (TCS), and in particular, computational complexity. I am enthralled by problems in circuit complexity, algebraic computation, and quantum computation. In addition, I am also interested in pseudorandomness, cryptography, coding theory, and the interaction of TCS with other fields.
Tracking the $\ell_2$ Norm with Constant Update Time
with Zhixian Lei, Preetum Nakkiran
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019).
- [arxiv] [conference version] [slides]
On the Algorithmic Power of Spiking Neural Networks
with Kai-Min Chung, Chi-Jen Lu
Innovations in Theoretical Computer Science (ITCS 2019).
- [arxiv] [conference version] [slides] [poster]
Personalized Difficulty Adjustment for Countering the Double-Spending Attack in Proof-of-Work Consensus Protocols
with Yu-Jing Lin, Ren Chen, Hsiu-Yao Chang, I-Ping Tu, Shih-wei Liao
IEEE International Conference on Blockchain (Blockchain 2018).
- [arxiv] [conference version]
ODE-Inspired Analysis for the Biological Version of Oja’s Rule in Solving Streaming PCA with For-All-Time Guarantee
with Mien Brabeeba Wang, in submission.