.. Tianqi Yang personal page master file, created by sphinx-quickstart on Sun May 30 13:12:24 2021. You can adapt this file completely to your liking, but it should at least contain the root `toctree` directive. Tianqi Yang ======================================= .. toctree:: :maxdepth: 2 :caption: Contents: .. image:: _static/portrait :width: 400 :alt: Myself I am a first-year Ph.D. at Columbia University, co-advised by Prof. Josh Alman, Xi Chen, Tal Malkin, Toniann Pitassi, Rocco Servedio, and Henry Yuen. My research interests lie broadly in circuit complexity, pseudorandomness, cryptography, and proof complexity. Email: [my first name] dot [my last name] at columbia dot edu Publications --------------------------------------- 2023 *************************************** - Black-box Constructive Proofs are Unavoidable, *ITCS 2023* [`ITCS version `_] Joint work with Lijie Chen and Ryan Williams 2022 *************************************** - Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs, *CCC 2022* [`ECCC `_] [`CCC version `_] Joint work with Lijie Chen and Jiatu Li - The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs, *STOC 2022*, **Best Student Paper Award** [`ECCC `_] [`IACR Eprint `_] [`STOC version `_] [`Slide at STOC <_static/slide_prf_stoc.pptx>`_] Joint work with Zhiyuan Fan and Jiatu Li - :math:`3.1n − o(n)` Circuit Lower Bounds for Explicit Functions, *STOC 2022* [`ECCC `_] [`STOC version `_] [`Slide at STOC <_static/slide_3_1n_stoc.pptx>`_] Joint work with Jiatu Li 2021 *************************************** - Tree Path Minimum Query Oracle via Boruvka Trees [`arXiv `_] .. comment * :ref:`genindex` * :ref:`modindex` * :ref:`search`