| On the hyperbolicity of small-world and treelike random graphs W Chen, W Fang, G Hu, MW Mahoney Internet Mathematics 9 (4), 434-491, 2013 | 128 | 2013 |
| Maximally recoverable codes for grid-like topologies P Gopalan, G Hu, S Kopparty, S Saraf, C Wang, S Yekhanin Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 59 | 2017 |
| New constructions of SD and MR codes over small finite fields G Hu, S Yekhanin 2016 IEEE International Symposium on Information Theory (ISIT), 1591-1595, 2016 | 35 | 2016 |
| On the Approximation Ratio of k-Lookahead Auction X Chen, G Hu, P Lu, L Wang International Workshop on Internet and Network Economics, 61-71, 2011 | 21 | 2011 |
| Sylvester–Gallai for arrangements of subspaces Z Dvir, G Hu Discrete & Computational Geometry 56, 940-965, 2016 | 9 | 2016 |
| Matching-vector families and ldcs over large modulo Z Dvir, G Hu International Workshop on Approximation Algorithms for Combinatorial …, 2013 | 9 | 2013 |
| On the power of breakable objects W Chen, G Hu, J Zhang Theoretical Computer Science 503, 89-108, 2013 | 3 | 2013 |
| Lower bounds for error-correcting codes with local recovery G Hu Princeton University, 2017 | 2 | 2017 |
| Lower bounds for approximate LDCs J Briët, Z Dvir, G Hu, S Saraf Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 2 | 2014 |
| A better upper bound on weights of exact threshold functions X Chen, G Hu, X Sun International Conference on Theory and Applications of Models of Computation …, 2011 | 2 | 2011 |
| The complexity of word circuits X Chen, G Hu, X Sun Computing and Combinatorics: 16th Annual International Conference, COCOON …, 2010 | | 2010 |
