![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Tianqi Yang 0001
Person information
- affiliation: Tsinghua University, Institute for Interdisciplinary Information Sciences, Beijing, China
Other persons with the same name
- Tianqi Yang — disambiguation page
- Tianqi Yang 0002 — Jinan University, Guangzhou, China
- Tianqi Yang 0003 — Beijing University of Posts and Telecommunications, Beijing, China
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c4]Lijie Chen, Ryan Williams, Tianqi Yang:
Black-Box Constructive Proofs Are Unavoidable. ITCS 2023: 35:1-35:24 - 2022
- [c3]Lijie Chen, Jiatu Li, Tianqi Yang:
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. CCC 2022: 23:1-23:37 - [c2]Zhiyuan Fan, Jiatu Li, Tianqi Yang:
The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. STOC 2022: 962-975 - [c1]Jiatu Li, Tianqi Yang:
3.1n - o(n) circuit lower bounds for explicit functions. STOC 2022: 1180-1193 - [i5]Lijie Chen, Jiatu Li, Tianqi Yang:
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i4]Tianqi Yang
:
Tree Path Minimum Query Oracle via Boruvka Trees. CoRR abs/2105.01864 (2021) - [i3]Zhiyuan Fan, Jiatu Li, Tianqi Yang
:
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i2]Jiatu Li, Tianqi Yang
:
3.1n - o(n) Circuit Lower Bounds for Explicit Functions. Electron. Colloquium Comput. Complex. TR21 (2021) - [i1]Zhiyuan Fan, Jiatu Li, Tianqi Yang:
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. IACR Cryptol. ePrint Arch. 2021: 1079 (2021)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint