Huacheng Yu
Huacheng Yu
Computer Science, Princeton University
Dirección de correo verificada de cs.princeton.edu
TítuloCitado porAño
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
1002014
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
762018
Finding orthogonal vectors in discrete structures
R Williams, H Yu
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
472014
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
312017
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
302014
An improved combinatorial algorithm for boolean matrix multiplication
H Yu
International Colloquium on Automata, Languages, and Programming, 1094-1105, 2015
252015
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
KG Larsen, O Weinstein, H Yu
2018 Information Theory and Applications Workshop (ITA), 1-40, 2018
192018
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
122016
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
92019
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
62017
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
52016
A new variation of hat guessing games
T Ma, X Sun, H Yu
International Computing and Combinatorics Conference, 616-626, 2011
42011
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
How to store a random walk
E Viola, O Weinstein, H Yu
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
22020
Cell-probe lower bounds from online communication complexity
J Alman, JR Wang, H Yu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
12018
On a conjecture of Butler and Graham
T Ma, X Sun, H Yu
Designs, codes and cryptography 69 (3), 265-274, 2013
12013
Faster Update Time for Turnstile Streaming Algorithms
J Alman, H Yu
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
2020
Nearly Optimal Static Las Vegas Succinct Dictionary
H Yu
arXiv preprint arXiv:1911.01348, 2019
2019
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
2019
Pruning based Distance Sketches with Provable Guarantees on Random Graphs
H Zhang, H Yu, A Goel
The World Wide Web Conference, 2301-2311, 2019
2019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20