BibTeX records: Kaiying Hou

• > Home > Persons > Kaiying Hou

@article{DBLP:journals/corr/abs-2407-03310,
  author       = {Kaiying Hou and
                  David Brandfonbrener and
                  Sham M. Kakade and
                  Samy Jelassi and
                  Eran Malach},
  title        = {Universal Length Generalization with Turing Programs},
  journal      = {CoRR},
  volume       = {abs/2407.03310},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2407.03310},
  doi          = {10.48550/ARXIV.2407.03310},
  eprinttype    = {arXiv},
  eprint       = {2407.03310},
  timestamp    = {Wed, 07 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2407-03310.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2206-11970,
  author       = {Jonathan Z. Lu and
                  Rodrigo A. Bravo and
                  Kaiying Hou and
                  Gebremedhin A. Dagnew and
                  Susanne F. Yelin and
                  Khadijeh Najafi},
  title        = {Learning quantum symmetries with interactive quantum-classical variational
                  algorithms},
  journal      = {CoRR},
  volume       = {abs/2206.11970},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2206.11970},
  doi          = {10.48550/ARXIV.2206.11970},
  eprinttype    = {arXiv},
  eprint       = {2206.11970},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2206-11970.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cccg/HouL18,
  author       = {Kaiying Hou and
                  Jayson Lynch},
  editor       = {Stephane Durocher and
                  Shahin Kamali},
  title        = {The Computational Complexity of Finding Hamiltonian Cycles in Grid
                  Graphs of Semiregular Tessellations},
  booktitle    = {Proceedings of the 30th Canadian Conference on Computational Geometry,
                  {CCCG} 2018, August 8-10, 2018, University of Manitoba, Winnipeg,
                  Manitoba, Canada},
  pages        = {114--128},
  year         = {2018},
  url          = {http://www.cs.umanitoba.ca/\%7Ecccg2018/papers/session3B-p1.pdf},
  timestamp    = {Thu, 12 Mar 2020 11:28:29 +0100},
  biburl       = {https://dblp.org/rec/conf/cccg/HouL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1805-03192,
  author       = {Kaiying Hou and
                  Jayson Lynch},
  title        = {The Computational Complexity of Finding Hamiltonian Cycles in Grid
                  Graphs of Semiregular Tessellations},
  journal      = {CoRR},
  volume       = {abs/1805.03192},
  year         = {2018},
  url          = {http://arxiv.org/abs/1805.03192},
  eprinttype    = {arXiv},
  eprint       = {1805.03192},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-03192.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}