| Network motif discovery using subgraph enumeration and symmetry-breaking JA Grochow, M Kellis Annual International Conference on Research in Computational Molecular …, 2007 | 393 | 2007 |
| Genomic analysis reveals a tight link between transcription factor dynamics and regulatory network architecture R Jothi, S Balaji, A Wuster, JA Grochow, J Gsponer, TM Przytycka, ... Molecular systems biology 5 (1), 294, 2009 | 182 | 2009 |
| On cap sets and the group-theoretic approach to matrix multiplication Discrete Anal. 2017 Paper No. 3 27 pp J Blasiak, T Church, H Cohn, JA Grochow, E Naslund, WF Sawin, ... Discrete Analysis, 2017 | 123* | 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 | 68 | 2011 |
| Circuit complexity, proof complexity, and polynomial identity testing: The ideal proof system JA Grochow, T Pitassi Journal of the ACM (JACM) 65 (6), 37, 2018 | 63* | 2018 |
| Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition L Hébert-Dufresne, JA Grochow, A Allard Scientific Reports 6, 31708, 2015 | 55 | 2015 |
| Ecogeographical rules and the macroecology of food webs B Baiser, D Gravel, AR Cirtwill, JA Dunne, AK Fahimipour, LJ Gilarranz, ... Global Ecology and Biogeography 28 (9), 1204-1218, 2019 | 52 | 2019 |
| Minimum circuit size, graph isomorphism, and related problems E Allender, JA Grochow, D van Melkebeek, C Moore, A Morgan SIAM Journal on Computing 47 (4), 1339-1372, 2018 | 38 | 2018 |
| On the complexity of isomorphism problems for tensors, groups, and polynomials I: tensor isomorphism-completeness J Grochow, Y Qiao SIAM Journal on Computing 52 (2), 568-617, 2023 | 36 | 2023 |
| Towards an algebraic natural proofs barrier via polynomial identity testing JA Grochow, M Kumar, M Saks, S Saraf arXiv preprint arXiv:1701.01717, 2017 | 34 | 2017 |
| Algorithms for group isomorphism via group extensions and cohomology JA Grochow, Y Qiao SIAM Journal on Computing 46 (4), 1153-1216, 2017 | 33 | 2017 |
| Boundaries of VP and VNP JA Grochow, KD Mulmuley, Y Qiao arXiv preprint arXiv:1605.02815; preliminary report in ICALP 2016, 2016 | 33 | 2016 |
| Unifying Known Lower Bounds via Geometric Complexity Theory JA Grochow computational complexity 24 (2), 393-476, 2015 | 31 | 2015 |
| Rotor-routing and spanning trees on planar graphs M Chan, T Church, JA Grochow International Mathematics Research Notices 2015 (11), 3225-3244, 2015 | 30 | 2015 |
| Comparing Information-Theoretic Measures of Complexity in Boltzmann Machines MS Kanwal, JA Grochow, N Ay Entropy 19 (7), 310, 2017 | 26 | 2017 |
| Matrix isomorphism of matrix Lie algebras J Grochow Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on, 203-213, 2012 | 26* | 2012 |
| Wildness for tensors V Futorny, JA Grochow, VV Sergeichuk Linear Algebra and its Applications 566, 212-244, 2019 | 25 | 2019 |
| Complexity classes of equivalence problems revisited L Fortnow, JA Grochow Information and Computation 209 (4), 748-763, 2011 | 25 | 2011 |
| Symmetry and equivalence relations in classical and geometric complexity theory JA Grochow University of Chicago, 2012 | 23 | 2012 |
| Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions JA Grochow, Y Qiao arXiv preprint arXiv:1907.00309, 2019 | 22 | 2019 |
Youming QiaoUniversity of Technology Sydney在 uts.edu.au 的电子邮件经过验证
