Youming Qiao

Cited by

	All	Since 2017
Citations	720	520
h-index	17	13
i10-index	22	20

140

105

20102011201220132014201520162017201820192020202120227 15 18 33 28 34 43 59 69 81 108 139 62

Public access

View all

30 articles

1 article

available

not available

Based on funding mandates

Co-authors

Gabor IvanyosSZTAKI - Institute for Computer Science and ControlVerified email at sztaki.hu
Joshua A. GrochowUniversity of Colorado BoulderVerified email at colorado.edu
K Venkata SubrahmanyamChennai Mathematical InstituteVerified email at cmi.ac.in
Yinan LiNagoya UniversityVerified email at math.nagoya-u.ac.jp
Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT SingaporeVerified email at liafa.univ-paris-diderot.fr
Laszlo BabaiUniversity of ChicagoVerified email at cs.uchicago.edu
Xiaoming SunInstitute of Computing Technology, Chinese Academy of SciencesVerified email at ict.ac.cn
Paolo CodenottiGoogle Inc.Verified email at google.com
Xiaohui BeiNanyang Technological UniversityVerified email at ntu.edu.sg
Marek KarpinskiProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de
Raghav KulkarniCentre for Quantum Technologies, SingaporeVerified email at cs.uchicago.edu
Jayalal SarmaIndian Institute of Technology Madras, Chennai, IndiaVerified email at cse.iitm.ac.in
Bangsheng TangFacebookVerified email at fb.com
Nengkun YuUniversity of Technology SydneyVerified email at uts.edu.au
Peter BrooksbankBucknell UniversityVerified email at bucknell.edu
James B. WilsonColorado State UniversityVerified email at math.colostate.edu
Shengyu Zhang（张胜誉）TencentVerified email at cse.cuhk.edu.hk
Ji GuanInstitute of Software, Chinese Academy of SciencesVerified email at ios.ac.cn
Shiteng ChenInstitute of Software, Chinese Academy of SciencesVerified email at ios.ac.cn
Aleksandrs Belovsassistant professor, University of LatviaVerified email at inbox.lv

Youming Qiao

University of Technology Sydney

Verified email at uts.edu.au - Homepage

computational complexity theory quantum computation and information UTS:QSI


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Constructive noncommutative rank computation is in deterministic polynomial time G Ivanyos, Y Qiao, KV Subrahmanyam Computational Complexity 27 (4), 561-593, 2018	71*	2018
On the security of Goldreich’s one-way function A Bogdanov, Y Qiao computational complexity 21 (1), 83-127, 2012	64	2012
Non-commutative Edmonds’ problem and matrix semi-invariants G Ivanyos, Y Qiao, KV Subrahmanyam computational complexity 26 (3), 717-763, 2017	63	2017
Code equivalence and group isomorphism L Babai, P Codenotti, JA Grochow, Y Qiao Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011	54	2011
Generalized Wong sequences and their applications to Edmonds' problems G Ivanyos, M Karpinski, Y Qiao, M Santha Journal of Computer and System Sciences 81 (7), 1373-1386, 2015	35	2015
Polynomial-time isomorphism test for groups with abelian Sylow towers L Babai, Y Qiao 29th International Symposium on Theoretical Aspects of Computer Science …, 2012	32	2012
Networked Fairness in Cake Cutting X Bei, Y Qiao, S Zhang The Twenty-Sixth International Joint Conference on Artificial Intelligence …, 2017	31	2017
Polynomial-Time Isomorphism Test for Groups with no Abelian Normal Subgroups (Extended Abstract⋆) L Babai, P Codenotti, Y Qiao International Colloquium on Automata, Languages, and Programming (ICALP) 2012, 2012	29*	2012
Algorithms for group isomorphism via group extensions and cohomology JA Grochow, Y Qiao SIAM Journal on Computing 46 (4), 1153-1216, 2017	28	2017
Boundaries of VP and VNP JA Grochow, KD Mulmuley, Y Qiao 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016	28	2016
On isomorphism testing of groups with normal Hall subgroups YM Qiao, JS Mn, BS Tang Journal of Computer Science and Technology 27 (4), 687-701, 2012	27	2012
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing G Ivanyos, Y Qiao SIAM Journal on Computing 48 (3), 926-963, 2019	25	2019
Deterministic Black-Box Identity Testing -Ordered Algebraic Branching Programs M Jansen, Y Qiao, J Sarma arXiv preprint arXiv:1002.1496, 2010	25	2010
Linear algebraic analogues of the graph isomorphism problem and the Erdős-Rényi model Y Li, Y Qiao 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	23	2017
Deterministic identity testing of read-once algebraic branching programs M Jansen, Y Qiao, J Sarma arXiv preprint arXiv:0912.2565, 2009	18	2009
On the polynomial parity argument complexity of the combinatorial nullstellensatz A Belovs, G Ivanyos, Y Qiao, M Santha, S Yang Computational Complexity Conference 2017, 30:1-30:24, 2017	17	2017
Random arithmetic formulas can be reconstructed efficiently A Gupta, N Kayal, Y Qiao computational complexity 23 (2), 207-303, 2014	17	2014
Incorporating Weisfeiler-Leman into algorithms for group isomorphism PA Brooksbank, JA Grochow, Y Li, Y Qiao, JB Wilson arXiv preprint arXiv:1905.02518, 2019	11	2019
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness JA Grochow, Y Qiao 12th Innovations in Theoretical Computer Science Conference (ITCS 2021) 185, 31, 2021	10	2021
General linear group action on tensors: a candidate for post-quantum cryptography Z Ji, Y Qiao, F Song, A Yun Theory of Cryptography Conference, 251-281, 2019	10	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors