Youming Qiao
Orcid: 0000-0003-4334-1449
According to our database1,
Youming Qiao
authored at least 56 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
On <i>p</i>-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors.
ACM Trans. Comput. Theory, March, 2024
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants.
IACR Cryptol. ePrint Arch., 2024
Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness.
SIAM J. Comput., April, 2023
Electron. Colloquium Comput. Complex., 2023
On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications.
CoRR, 2023
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms.
IACR Cryptol. ePrint Arch., 2022
On digital signatures based on isomorphism problems: QROM security and ring signatures.
IACR Cryptol. ePrint Arch., 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the Computer Science - Theory and Applications, 2022
2021
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces.
SIAM J. Comput., 2021
On the Baer-Lovász-Tutte construction of groups from graphs: Isomorphism types and homomorphism notions.
Eur. J. Comb., 2021
Discret. Math., 2021
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors.
Proceedings of the 36th Computational Complexity Conference, 2021
2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
2019
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing.
SIAM J. Comput., 2019
IACR Cryptol. ePrint Arch., 2019
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions.
CoRR, 2019
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions.
CoRR, 2019
2018
J. Comput. Syst. Sci., 2018
Comput. Complex., 2018
2017
SIAM J. Comput., 2017
Comput. Complex., 2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
Proceedings of the 32nd Computational Complexity Conference, 2017
2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Theor. Comput. Sci., 2015
J. Comput. Syst. Sci., 2015
Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics.
CoRR, 2015
Proceedings of the Theory and Applications of Models of Computation, 2015
Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract).
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
2014
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
2013
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
2012
J. Comput. Sci. Technol., 2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
2008
Proceedings of the Cryptology and Network Security, 7th International Conference, 2008