| 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 | 169 | 2014 |
| 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 | 146 | 2015 |
| 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 | 85 | 2017 |
| 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 | 77 | 2014 |
| Finding orthogonal vectors in discrete structures R Williams, H Yu Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 68 | 2014 |
| An improved combinatorial algorithm for boolean matrix multiplication H Yu Information and Computation 261, 240-247, 2018 | 56 | 2018 |
| 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 | 43 | 2018 |
| 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 | 42 | 2019 |
| 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 | 39 | 2020 |
| 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 | 21 | 2021 |
| Succinct filters for sets of unknown sizes M Liu, Y Yin, H Yu arXiv preprint arXiv:2004.12465, 2020 | 20 | 2020 |
| 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 | 20 | 2016 |
| Optimal bounds for approximate counting J Nelson, H Yu Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022 | 19 | 2022 |
| 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 | 18 | 2021 |
| Tight cell-probe lower bounds for dynamic succinct dictionaries T Li, J Liang, H Yu, R Zhou 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 9 | 2023 |
| A new variation of hat guessing games T Ma, X Sun, H Yu International Computing and Combinatorics Conference, 616-626, 2011 | 9 | 2011 |
| Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut L Chen, G Kol, D Paramonov, RR Saxena, Z Song, H Yu Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 8 | 2023 |
| 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 | 8 | 2017 |
| 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 | 8 | 2016 |
| Nearly optimal static Las Vegas succinct dictionary H Yu Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 7 | 2020 |
Richard Ryan WilliamsMIT確認したメール アドレス: mit.edu
