1. Formula Size-Depth Tradeoffs for Iterated Sub-permutation Matrix Multiplication;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Quantum and Classical Query Complexities of Functions of Matrices;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. KRW Composition Theorems via Lifting;computational complexity;2024-04-29
4. Improving $$3N$$ Circuit Complexity Lower Bounds;computational complexity;2023-12
5. Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06