Folgen
Huacheng Yu
Huacheng Yu
Computer Science, Princeton University
Bestätigte E-Mail-Adresse bei cs.princeton.edu
Titel
Zitiert von
Zitiert von
Jahr
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
1602014
Matching triangles and basing hardness on an extremely popular conjecture
A Abboud, V Vassilevska Williams, H Yu
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1382015
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
822017
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
692014
Finding orthogonal vectors in discrete structures
R Williams, H Yu
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
662014
An improved combinatorial algorithm for boolean matrix multiplication
H Yu
Information and Computation 261, 240-247, 2018
492018
Crossing the logarithmic barrier for dynamic boolean data structure lower bounds
KG Larsen, O Weinstein, H Yu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
402018
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
382019
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
272020
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
Succinct filters for sets of unknown sizes
M Liu, Y Yin, H Yu
arXiv preprint arXiv:2004.12465, 2020
162020
Optimal bounds for approximate counting
J Nelson, H Yu
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
122022
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
112021
Almost optimal super-constant-pass streaming lower bounds for reachability
L Chen, G Kol, D Paramonov, RR Saxena, Z Song, H Yu
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
102021
A new variation of hat guessing games
T Ma, X Sun, H Yu
International Computing and Combinatorics Conference, 616-626, 2011
82011
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
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries
T Li, J Liang, H Yu, R Zhou
arXiv preprint arXiv:2306.02253, 2023
62023
Lower bound for succinct range minimum query
M Liu, H Yu
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
62020
How to store a random walk
E Viola, O Weinstein, H Yu
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
62020
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
62019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20