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 | 122 | 2014 |

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 | 101 | 2018 |

Finding orthogonal vectors in discrete structures R Williams, H Yu Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 55 | 2014 |

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 | 39 | 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 | 36 | 2014 |

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 | 30 | 2019 |

An improved combinatorial algorithm for boolean matrix multiplication H Yu International Colloquium on Automata, Languages, and Programming, 1094-1105, 2015 | 28 | 2015 |

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 | 17 | 2019 |

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 | 16 | 2016 |

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 | 6 | 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 | 5 | 2016 |

A new variation of hat guessing games T Ma, X Sun, H Yu International Computing and Combinatorics Conference, 616-626, 2011 | 4 | 2011 |

Fillable arrays with constant time operations and a single bit of redundancy JTP Loong, J Nelson, H Yu arXiv preprint arXiv:1709.09574, 2017 | 3 | 2017 |

How to store a random walk E Viola, O Weinstein, H Yu Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 2 | 2020 |

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 | 2 | 2019 |

Lower bound for succinct range minimum query M Liu, H Yu Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 1 | 2020 |

Pruning based Distance Sketches with Provable Guarantees on Random Graphs H Zhang, H Yu, A Goel The World Wide Web Conference, 2301-2311, 2019 | 1 | 2019 |

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 | 1 | 2018 |

On a conjecture of Butler and Graham T Ma, X Sun, H Yu Designs, codes and cryptography 69 (3), 265-274, 2013 | 1 | 2013 |

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 | | 2021 |