default search action
Guangxu Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c3]Guangxu Yang
, Jiapeng Zhang
Communication Lower Bounds for Collision Problems via Density Increment Arguments. STOC 2024: 630-639 - [i9]Mi-Ying (Miryam) Huang, Xinyu Mao, Guangxu Yang, Jiapeng Zhang:
Breaking Square-Root Loss Barriers via Min-Entropy. Electron. Colloquium Comput. Complex. TR24 (2024) - [i8]Xinyu Mao, Guangxu Yang, Jiapeng Zhang:
Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c2]Mi-Ying (Miryam) Huang, Xinyu Mao
Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments. TCC (3) 2023: 185-206 - [i7]Guangxu Yang, Jiapeng Zhang:
Lifting Theorems Meet Information Complexity: Known and New Lower Bounds of Set-disjointness. CoRR abs/2309.13517 (2023) - [i6]Mi-Ying (Miryam) Huang, Xinyu Mao, Guangxu Yang, Jiapeng Zhang:
Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments. Electron. Colloquium Comput. Complex. TR23 (2023) - [i5]Shuo Wang, Guangxu Yang, Jiapeng Zhang:
Communication Complexity of Set-Intersection Problems and Its Applications. Electron. Colloquium Comput. Complex. TR23 (2023) - [i4]Guangxu Yang, Jiapeng Zhang:
Communication Lower Bounds for Collision Problems via Density Increment Arguments. Electron. Colloquium Comput. Complex. TR23 (2023) - [i3]Mi-Ying (Miryam) Huang, Xinyu Mao, Guangxu Yang, Jiapeng Zhang:
Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments. IACR Cryptol. ePrint Arch. 2023: 1349 (2023) - 2022
- [i2]Guangxu Yang, Jiapeng Zhang:
Simulation Methods in Communication Lower Bounds, Revisited. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i1]Weicong Ding, Hanlin Tang, Jingshuo Feng, Lei Yuan, Sen Yang, Guangxu Yang, Jie Zheng, Jing Wang, Qiang Su, Dong Zheng, Xuezhong Qiu, Yongqi Liu, Yuxuan Chen, Yang Liu, Chao Song, Dongying Kong, Kai Ren, Peng Jiang, Qiao Lian, Ji Liu:
PASTO: Strategic Parameter Optimization in Recommendation Systems - Probabilistic is Better than Deterministic. CoRR abs/2108.09076 (2021) - 2020
- [j1]Shizhong Xu, Xiong Wang, Guangxu Yang, Jing Ren, Sheng Wang:
Routing optimization for cloud services in SDN-based Internet of Things with TCAM capacity constraint. J. Commun. Networks 22(2): 145-158 (2020) - [c1]Minhui Xie, Kai Ren, Youyou Lu, Guangxu Yang, Qingxing Xu, Bihai Wu, Jiazhen Lin, Hongbo Ao, Wanhong Xu, Jiwu Shu:
Kraken: memory-efficient continual learning for large-scale real-time recommendations. SC 2020: 21
Coauthor Index
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-10-07 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: