Jiawei Li

Orcid: 0000-0002-1441-1711

Affiliations:
  • University of Texas at Austin, TX, USA


According to our database1, Jiawei Li authored at least 9 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Total Search Problems in ZPP.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
Quantum Communication Advantage in TFNP.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Metamathematics of Resolution Lower Bounds: A TFNP Perspective.
Electron. Colloquium Comput. Complex., 2024

On Pigeonhole Principles and Ramsey in TFNP.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Pandora Box Problem with Nonobligatory Inspection: Hardness and Improved Approximation Algorithms.
CoRR, 2022

The Query Complexity of Local Search and Brouwer in Rounds.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
On the Approximation of Nash Equilibria in Sparse Win-Lose Multi-player Games.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021


  Loading...