Huacheng Yu
Huacheng Yu
Computer Science, Princeton University
Verified email at cs.princeton.edu
Title
Cited by
Cited by
Year
More applications of the polynomial method to algorithm design
A Abboud, R Williams, H Yu
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
1302014
Matching triangles and basing hardness on an extremely popular conjecture
A Abboud, VV Williams, H Yu
SIAM Journal on Computing 47 (3), 1098-1122, 2018
1092018
Finding orthogonal vectors in discrete structures
R Williams, H Yu
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
572014
Beating brute force for systems of polynomial equations over finite fields
D Lokshtanov, R Paturi, S Tamaki, R Williams, H Yu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
472017
Finding four-node subgraphs in triangle time
VV Williams, JR Wang, R Williams, H Yu
Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete …, 2014
432014
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
KG Larsen, O Weinstein, H Yu
SIAM Journal on Computing 49 (5), STOC18-323-STOC18-367, 2019
332019
An improved combinatorial algorithm for boolean matrix multiplication
H Yu
Information and Computation 261, 240-247, 2018
332018
Optimal lower bounds for distributed and streaming spanning forest computation
J Nelson, H Yu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
222019
Amortized dynamic cell-probe lower bounds from four-party communication
O Weinstein, H Yu
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
182016
Multi-pass graph streaming lower bounds for cycle counting, max-cut, matching size, and other problems
S Assadi, G Kol, RR Saxena, H Yu
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
82020
Decreasekeys are expensive for external memory priority queues
K Eenberg, KG Larsen, H Yu
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
72017
Cell-probe lower bounds for dynamic problems via a new communication model
H Yu
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
62016
A new variation of hat guessing games
T Ma, X Sun, H Yu
International Computing and Combinatorics Conference, 616-626, 2011
42011
Succinct Filters for Sets of Unknown Sizes
M Liu, Y Yin, H Yu
arXiv preprint arXiv:2004.12465, 2020
32020
Fillable arrays with constant time operations and a single bit of redundancy
JTP Loong, J Nelson, H Yu
arXiv preprint arXiv:1709.09574, 2017
32017
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs
L Chen, G Kol, D Paramonov, R Saxena, Z Song, H Yu
arXiv preprint arXiv:2102.11251, 2021
22021
How to store a random walk
E Viola, O Weinstein, H Yu
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
22020
Optimal succinct rank data structure via approximate nonnegative tensor decomposition
H Yu
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
22019
Pruning based Distance Sketches with Provable Guarantees on Random Graphs
H Zhang, H Yu, A Goel
The World Wide Web Conference, 2301-2311, 2019
22019
Lower bound for succinct range minimum query
M Liu, H Yu
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20