1. On the complexity of CSP-based ideal membership problems;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
2. Lifting Nullstellensatz to monotone span programs over any field;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
3. Graph-Coloring Ideals;Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation;2015-06-24
4. On the complexity of Hilbert refutations for partition;Journal of Symbolic Computation;2015-01
5. Computing infeasibility certificates for combinatorial problems through Hilbert’s Nullstellensatz;Journal of Symbolic Computation;2011-11