Follow
Qi Cheng
Qi Cheng
Verified email at cs.ou.edu - Homepage
Title
Cited by
Cited by
Year
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
2492001
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
2262005
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
1902002
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
742001
On the list and bounded distance decodability of Reed–Solomon codes
Q Cheng, D Wan
SIAM Journal on Computing 37 (1), 195-209, 2007
712007
On deciding deep holes of Reed-Solomon codes
Q Cheng, E Murray
International Conference on Theory and Applications of Models of Computation …, 2007
592007
Invadable self-assembly: combining robustness with efficiency.
HL Chen, Q Cheng, A Goel, MDA Huang, PM de Espanés
SODA, 890-899, 2004
492004
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
452004
Primality proving via one round in ECPP and one iteration in AKS
Q Cheng
Journal of Cryptology 20 (3), 375-387, 2007
43*2007
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
382009
Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
Q Cheng, D Wan
Information Theory, IEEE Transactions on 56 (10), 5217-5222, 2010
36*2010
On the construction of finite field elements of large order
Q Cheng
Finite Fields and Their Applications 11 (3), 358-366, 2005
362005
Hard problems of algebraic geometry codes
Q Cheng
IEEE Transactions on Information Theory 54 (1), 402-406, 2008
332008
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
232012
Resolving two open problems in the self-assembly of squares
Q Cheng, PM de Espanes
Computer science technical report, 03-793, 2003
232003
Sublinear root detection and new hardness results for sparse polynomials over finite fields
J Bi, Q Cheng, JM Rojas
SIAM Journal on Computing 45 (4), 1433-1447, 2016
212016
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
212014
Constructing finite field extensions with large order elements
Q Cheng
SIAM Journal on Discrete Mathematics 21 (3), 726-730, 2007
192007
Straight-line programs and torsion points on elliptic curves
Q Cheng
computational complexity 12 (3), 150-161, 2003
172003
Sparse univariate polynomials with many roots over finite fields
Q Cheng, S Gao, JM Rojas, D Wan
Finite Fields and their Applications 46, 235-246, 2017
162017
The system can't perform the operation now. Try again later.
Articles 1–20