- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-CompletenessSICOMP, 52(2):568-617, April 2023. [doi]
- On the orbit closure intersection problems for matrix tuples under conjugation and left-right actionssoda 2023: 4115-4126 [doi]
- On linear-algebraic notions of expansioneccc, TR23, 2023. [doi]

- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix SpacesSICOMP, 50(3):924-971, 2021. [doi]
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completenessinnovations 2021: [doi]
- Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear FormsSTACS 2021: [doi]
- On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensorscoco 2021: [doi]
- On the Baer-Lovász-Tutte construction of groups from graphs: Isomorphism types and homomorphism notionsejc, 98:103404, 2021. [doi]
- Enumerating alternating matrix spaces over finite fields with explicit coordinatesDM, 344(11):112580, 2021. [doi]

- On the complexity of trial and error for constraint satisfaction problemsjcss, 92:48-64, 2018. [doi]
- Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testingsoda 2018: 2357-2376 [doi]
- Constructive non-commutative rank computation is in deterministic polynomial timecc, 27(4):561-593, 2018. [doi]

- Algorithms for Group Isomorphism via Group Extensions and CohomologySICOMP, 46(4):1153-1216, 2017. [doi]
- Non-commutative Edmonds' problem and matrix semi-invariantscc, 26(3):717-763, 2017. [doi]
- Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Timeinnovations 2017: [doi]
- Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Modelfocs 2017: 463-474 [doi]
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomialscc, 26(4):881-909, 2017. [doi]

- Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract)isaac 2015: 578-589 [doi]
- Generalized Wong sequences and their applications to Edmonds' problemsjcss, 81(7):1373-1386, 2015. [doi]
- Any monotone property of 3-uniform hypergraphs is weakly evasiveTCS, 588:16-23, 2015. [doi]