| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Qi Cheng Qi Cheng: Constructing finite field extensions with large order elements. SODA 2004 : 1130-1131 Ho-Lin Chen , Qi Cheng, Ashish Goel , Ming-Deh A. Huang , Pablo Moisset de Espanés : Invadable self-assembly: combining robustness with efficiency. SODA 2004 : 890-899 Qi Cheng: Primality Proving via One Round in ECPP and One Iteration in AKS. CRYPTO 2003 : 338-348 Calisto Zuzarte , Hamid Pirahesh , Wenbin Ma , Qi Cheng, Linqi Liu , Kwai Wong : WinMagic : Subquery Elimination Using Window Aggregation. SIGMOD Conference 2003 : 652-656 Qi Cheng: On the Ultimate Complexity of Factorials. STACS 2003 : 157-166 Qi Cheng, Shigenori Uchiyama : Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture. CT-RSA 2002 : 290-299 Qi Cheng: Some Remarks on the L-Conjecture. ISAAC 2002 : 128-136 Leonard M. Adleman , Qi Cheng, Ashish Goel , Ming-Deh A. Huang , David Kempe , Pablo Moisset de Espanés , Paul W. K. Rothemund : Combinatorial optimization problems in self-assembly. STOC 2002 : 23-32 Qi Cheng, Fang Fang : Kolmogorov random graphs only have trivial stable colorings. Inf. Process. Lett. 81 (3): 133-136 (2002) Leonard M. Adleman , Qi Cheng, Ashish Goel , Ming-Deh A. Huang : Running time and program size for self-assembled squares. STOC 2001 : 740-748 Qi Cheng, Ming-Deh A. Huang : Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments. ANTS 2000 : 233-246 Qi Cheng, Marek Chrobak , Gopalakrishnan Sundaram : Computing simple paths among obstacles. Comput. Geom. 16 (4): 223-233 (2000) Qi Cheng, Jarek Gryz , Fred Koo , T. Y. Cliff Leung , Linqi Liu , Xiaoyan Qian , K. Bernhard Schiefer : Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database. VLDB 1999 : 687-698 Qi Cheng, Hong Zhu : MNP: A Class of NP Optimization Problems (Extended Abstract). COCOON 1995 : 559-565 1 [ 5 ] [ 7 ] 2 [ 13 ] 3 [ 3 ] 4 [ 7 ] [ 13 ] 5 [ 6 ] 6 [ 5 ] [ 7 ] [ 13 ] 7 [ 2 ] 8 [ 4 ] [ 5 ] [ 7 ] [ 13 ] 9 [ 7 ] 10 [ 2 ] 11 [ 2 ] 12 [ 2 ] [ 11 ] 13 [ 11 ] 14 [ 11 ] 15 [ 2 ] 16 [ 7 ] 17 [ 2 ] 18 [ 3 ] 19 [ 9 ] 20 [ 11 ] 21 [ 1 ] 22 [ 11 ]  ©2004 Association for Computing Machinery |
