The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations. - Kaiying Hou; Jayson Lynch (CCCG, 2018)

Learning quantum symmetries with interactive quantum-classical variational algorithms. - Jonathan Z. Lu; Rodrigo A. Bravo; Kaiying Hou; Gebremedhin A. Dagnew; Susanne F. Yelin; Khadijeh Najafi (CoRR, 2022)

Universal Length Generalization with Turing Programs. - Kaiying Hou; David Brandfonbrener; Sham M. Kakade; Samy Jelassi; Eran Malach (CoRR, 2024)