Ivan Hu PhD Student

List of Publications

• I. Hu, D. van Melkebeek. Lifting Polynomial Complexity Measures Using Error-Correcting Codes To appear in Proceedings of the 30th International Conference on Randomization and Computation (RANDOM), 2026.
• I. Hu, D. van Melkebeek, and A. Morgan. Polynomial Identity Testing via Evaluation of Rational Functions In Theory of Computing, 20(1): 1-70, 2024.
• I. Hu, D. van Melkebeek, and A. Morgan. Query Complexity of Inversion Minimization on Trees. In Theory of Computing, 20(7): 1-62, 2024.
• Also appeared in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2836-2866, 2023.

Undergraduate Honors Thesis

• A Bound on the Maximum Coefficient of Gaussian Polynomials. Advised by Dieter van Melkebeek at the University of Wisconsin-Madison.