Counting Method for Multi-party Computation over Non-abelian Groups. - Youming Qiao; Christophe Tartary (CANS, 2008)

Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. - Maurice J. Jansen; Youming Qiao; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2010)

Deterministic Identity Testing of Read-Once Algebraic Branching Programs. - Maurice J. Jansen; Youming Qiao; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2010)

Code Equivalence and Group Isomorphism. - László Babai; Paolo Codenotti; Joshua A. Grochow; Youming Qiao (SODA, 2011)

Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract). - László Babai; Paolo Codenotti; Youming Qiao (ICALP (1), 2012)

Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. - László Babai; Youming Qiao (STACS, 2012)

On the security of Goldreich's one-way function. - Andrej Bogdanov; Youming Qiao (Comput. Complex., 2012)

On Isomorphism Testing of Groups with Normal Hall Subgroups. - Youming Qiao; Jayalal Sarma; Bangsheng Tang (J. Comput. Sci. Technol., 2012)

Determinantal Complexities and Field Extensions. - Youming Qiao; Xiaoming Sun 001; Nengkun Yu (ISAAC, 2013)

An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. - Thomas Decker 002; Gábor Ivanyos; Raghav Kulkarni; Youming Qiao; Miklos Santha (MFCS (2), 2014)

Random arithmetic formulas can be reconstructed efficiently. - Ankit Gupta 001; Neeraj Kayal; Youming Qiao (Comput. Complex., 2014)

Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract). - Joshua A. Grochow; Youming Qiao (ISAAC, 2015)

On the Power of Parity Queries in Boolean Decision Trees. - Raghav Kulkarni; Youming Qiao; Xiaoming Sun 001 (TAMC, 2015)

Polynomial-time isomorphism test of groups that are tame extensions. - Joshua A. Grochow; Youming Qiao (CoRR, 2015)

On generating the ring of matrix semi-invariants. - Gábor Ivanyos; Youming Qiao; K. V. Subrahmanyam 001 (CoRR, 2015)

Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. - Gábor Ivanyos; Youming Qiao; K. V. Subrahmanyam 001 (CoRR, 2015)

Generalized Wong sequences and their applications to Edmonds' problems. - Gábor Ivanyos; Marek Karpinski; Youming Qiao; Miklos Santha (J. Comput. Syst. Sci., 2015)

Any monotone property of 3-uniform hypergraphs is weakly evasive. - Raghav Kulkarni; Youming Qiao; Xiaoming Sun 001 (Theor. Comput. Sci., 2015)

Boundaries of VP and VNP. - Joshua A. Grochow; Ketan D. Mulmuley; Youming Qiao (ICALP, 2016)

On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. - Aleksandrs Belovs; Gábor Ivanyos; Youming Qiao; Miklos Santha; Siyi Yang (CCC, 2017)

Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model. - Yinan Li; Youming Qiao (FOCS, 2017)

Networked Fairness in Cake Cutting. - Xiaohui Bei; Youming Qiao; Shengyu Zhang 002 (IJCAI, 2017)

Non-commutative Edmonds' problem and matrix semi-invariants. - Gábor Ivanyos; Youming Qiao; K. V. Subrahmanyam 001 (Comput. Complex., 2017)

Sparse multivariate polynomial interpolation on the basis of Schubert polynomials. - Priyanka Mukhopadhyay; Youming Qiao (Comput. Complex., 2017)

Algorithms for Group Isomorphism via Group Extensions and Cohomology. - Joshua A. Grochow; Youming Qiao (SIAM J. Comput., 2017)

Constructive non-commutative rank computation is in deterministic polynomial time. - Gábor Ivanyos; Youming Qiao; K. V. Subrahmanyam 001 (Comput. Complex., 2018)

On the complexity of trial and error for constraint satisfaction problems. - Gábor Ivanyos; Raghav Kulkarni; Youming Qiao; Miklos Santha; Aarthi Sundaram (J. Comput. Syst. Sci., 2018)

From independent sets and vertex colorings to isotropic spaces and isotropic decompositions. - Xiaohui Bei; Shiteng Chen; Ji Guan 001; Youming Qiao; Xiaoming Sun 001 (CoRR, 2019)

Incorporating Weisfeiler-Leman into algorithms for group isomorphism. - Peter A. Brooksbank; Joshua A. Grochow; Yinan Li; Youming Qiao; James B. Wilson (CoRR, 2019)

Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions. - Joshua A. Grochow; Youming Qiao (CoRR, 2019)

General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography. - Zhengfeng Ji; Youming Qiao; Fang Song 001; Aaram Yun (IACR Cryptol. ePrint Arch., 2019)

Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing. - Gábor Ivanyos; Youming Qiao (SIAM J. Comput., 2019)

Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice. - Peter A. Brooksbank; Yinan Li; Youming Qiao; James B. Wilson (ESA, 2020)

Local Equivalence of Multipartite Entanglement. - Youming Qiao; Xiaoming Sun 001; Nengkun Yu (IEEE J. Sel. Areas Commun., 2020)

On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors. - Joshua A. Grochow; Youming Qiao (CCC, 2021)

Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. - Joshua A. Grochow; Youming Qiao; Gang Tang (STACS, 2021)

The isomorphism problem for plain groups is in Σ3P. - Heiko Dietrich; Murray Elder; Adam Piggott; Youming Qiao; Armin Weiß (CoRR, 2021)

Enumerating alternating matrix spaces over finite fields with explicit coordinates. - Youming Qiao (Discret. Math., 2021)

On the Baer-Lovász-Tutte construction of groups from graphs: Isomorphism types and homomorphism notions. - Xiaoyu He; Youming Qiao (Eur. J. Comb., 2021)

From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces. - Xiaohui Bei; Shiteng Chen; Ji Guan 001; Youming Qiao; Xiaoming Sun 001 (SIAM J. Comput., 2021)

Heterogeneous Multi-commodity Network Flows over Time. - Yifen Li; Xiaohui Bei; Youming Qiao; Dacheng Tao; Zhiya Chen (CSR, 2022)

Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras. - Gábor Ivanyos; Tushant Mittal; Youming Qiao (ITCS, 2022)

The Isomorphism Problem for Plain Groups Is in Σ₃𝖯. - Heiko Dietrich; Murray Elder; Adam Piggott; Youming Qiao; Armin Weiß (STACS, 2022)

Connections between graphs and matrix spaces. - Yinan Li; Youming Qiao; Avi Wigderson; Yuval Wigderson; Chuanqi Zhang (CoRR, 2022)

On digital signatures based on isomorphism problems: QROM security and ring signatures. - Zhili Chen; Dung Hoang Duong; Tuong Ngoc Nguyen; Youming Qiao; Willy Susilo; Gang Tang (IACR Cryptol. ePrint Arch., 2022)

Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms. - Gang Tang; Dung Hoang Duong; Antoine Joux; Thomas Plantard; Youming Qiao; Willy Susilo (IACR Cryptol. ePrint Arch., 2022)

On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions. - Gábor Ivanyos; Youming Qiao (SODA, 2023)

On linear-algebraic notions of expansion. - Yinan Li; Youming Qiao; Avi Wigderson; Yuval Wigderson; Chuanqi Zhang (Electron. Colloquium Comput. Complex., 2023)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness. - Joshua A. Grochow; Youming Qiao (SIAM J. Comput., 2023)

Faster Isomorphism Testing of p-Groups of Frattini Class 2. - Gábor Ivanyos; Euan J. Mendoza; Youming Qiao; Xiaorui Sun; Chuanqi Zhang (FOCS, 2024)

Canonical Forms for Matrix Tuples in Polynomial Time. - Youming Qiao; Xiaorui Sun (FOCS, 2024)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups. - Zhili Chen; Joshua A. Grochow; Youming Qiao; Gang Tang; Chuanqi Zhang (ITCS, 2024)

On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures. - Markus Bläser; Zhili Chen; Dung Hoang Duong; Antoine Joux; Tuong Ngoc Nguyen; Thomas Plantard; Youming Qiao; Willy Susilo; Gang Tang (PQCrypto (1), 2024)

Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. - Anand Kumar Narayanan; Youming Qiao; Gang Tang (IACR Cryptol. ePrint Arch., 2024)

On p-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors. - Joshua A. Grochow; Youming Qiao (ACM Trans. Comput. Theory, 2024)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials IV: Linear-Length Reductions and Their Applications. - Joshua A. Grochow; Youming Qiao (STOC, 2025)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials V: Over Commutative Rings. - Joshua A. Grochow; Youming Qiao; Katherine E. Stange; Xiaorui Sun (STOC, 2025)

Blind Signatures from Cryptographic Group Actions. - Dung Hoang Duong; Thanh Xuan Khuc; Youming Qiao; Willy Susilo; Chuanqi Zhang (IACR Cryptol. ePrint Arch., 2025)