| Running time and program size for self-assembled squares L Adleman, Q Cheng, A Goel, MD Huang Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 269 | 2001 |
| Complexities for generalized models of self-assembly G Aggarwal, Q Cheng, MH Goldwasser, MY Kao, PM De Espanes, ... SIAM Journal on Computing 34 (6), 1493-1515, 2005 | 241 | 2005 |
| Combinatorial optimization problems in self-assembly L Adleman, Q Cheng, A Goel, MD Huang, D Kempe, PM De Espanes, ... Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 199 | 2002 |
| On the list and bounded distance decodability of Reed–Solomon codes Q Cheng, D Wan SIAM Journal on Computing 37 (1), 195-209, 2007 | 81 | 2007 |
| Linear self-assemblies: Equilibria, entropy, and convergence rates L Adleman, Q Cheng, A Goel, MD Huang, H Wasserman Sixth international conference on difference equations and applications …, 2001 | 75 | 2001 |
| On deciding deep holes of Reed-Solomon codes Q Cheng, E Murray Theory and Applications of Models of Computation: 4th International …, 2007 | 61 | 2007 |
| Invadable self-assembly: combining robustness with efficiency. HL Chen, Q Cheng, A Goel, MDA Huang, PM de Espanés SODA, 890-899, 2004 | 53 | 2004 |
| Primality proving via one round in ECPP and one iteration in AKS Q Cheng Journal of Cryptology 20 (3), 375-387, 2007 | 44* | 2007 |
| Optimal self-assembly of counters at temperature two Q Cheng, A Goel, P Moisset Proceedings of the first conference on Foundations of nanoscience: self …, 2004 | 44 | 2004 |
| A deterministic reduction for the gap minimum distance problem Q Cheng, D Wan Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 42 | 2009 |
| Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes Q Cheng, D Wan Information Theory, IEEE Transactions on 56 (10), 5217-5222, 2010 | 37* | 2010 |
| Hard problems of algebraic geometry codes Q Cheng IEEE Transactions on Information Theory 54 (1), 402-406, 2008 | 37 | 2008 |
| On the construction of finite field elements of large order Q Cheng Finite fields and their applications 11 (3), 358-366, 2005 | 37 | 2005 |
| Constructing high order elements through subspace polynomials Q Cheng, S Gao, D Wan Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012 | 29 | 2012 |
| Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields J Bi, Q Cheng, JM Rojas Proceedings of the 38th International Symposium on Symbolic and Algebraic …, 2013 | 27 | 2013 |
| Resolving two open problems in the self-assembly of squares Q Cheng, PM de Espanes Computer science technical report, 03-793, 2003 | 26 | 2003 |
| Traps to the BGJT-algorithm for discrete logarithms Q Cheng, D Wan, J Zhuang LMS Journal of Computation and Mathematics 17 (A), 218-229, 2014 | 23 | 2014 |
| Constructing finite field extensions with large order elements Q Cheng SIAM Journal on Discrete Mathematics 21 (3), 726-730, 2007 | 23 | 2007 |
| Straight-line programs and torsion points on elliptic curves Q Cheng computational complexity 12, 150-161, 2003 | 19 | 2003 |
| Computing simple paths among obstacles Q Cheng, M Chrobak, G Sundaram Computational Geometry 16 (4), 223-233, 2000 | 19 | 2000 |
