Guangxu Yang - Google Scholar

Get my own profile

Cited by

	All	Since 2020
Citations	5	5
h-index	1	1
i10-index	0	0

0

4

2

202320242 3

Public access

2 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Jiapeng ZhangUniversity of Southern CaliforniaVerified email at usc.edu
Xinyu MaoUniversity of Southern CaliforniaVerified email at usc.edu
Mi-Ying (Miryam) HuangUniversity of Southern CaliforniaVerified email at usc.edu

Guangxu Yang

Guangxu Yang

University of Southern California.

Verified email at usc.edu - Homepage

Communication Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Communication Lower Bounds for Collision Problems via Density Increment Arguments G Yang, J Zhang Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC …, 2024	3	2024
Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments MYM Huang, X Mao, G Yang, J Zhang Proceedings of the 21st Theory of Cryptography Conference (TCC), 2023	1	2023
Simulation Methods in Communication Lower Bounds, Revisited. G Yang, J Zhang Electron. Colloquium Comput. Complex., 2022	1	2022
Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing X Mao, G Yang, J Zhang Proceedings of the 16th Innovations in Theoretical Computer Science (ITCS), 2024		2024

The system can't perform the operation now. Try again later.

Articles 1–4