| 2012 |
|---|
| 72 | Constructing high order elements through subspace polynomials. Qi Cheng, Shuhong Gao, Daqing Wan. SODA 2012, 1457-1463. Web SearchBibTeXDownload |
| 2011 |
|---|
| 71 | An efficient feature selection method for distributed cyber attack detection and classification. Hoa Dinh Nguyen, Qi Cheng. CISS 2011, 1-6. Web SearchBibTeXDownload |
| 70 | Counting Value Sets: Algorithm and Complexity. Qi Cheng, Joshua E. Hill, Daqing Wan. CoRR (abs/1111.1224) (2011). Web SearchBibTeXDownload |
| 69 | Effects of User Habituation in Keystroke Dynamics on Password Security Policy. Zahid Syed, Sean Banerjee, Qi Cheng, Bojan Cukic. HASE 2011, 352-359. Web SearchBibTeXDownload |
| 68 | Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices. Jingguo Bi, Qi Cheng. IACR Cryptology ePrint Archive (2011): 153 (2011). Web SearchBibTeXDownload |
| 67 | An ideal multi-secret sharing scheme based on MSP. Ching-Fang Hsu, Qi Cheng, Xueming Tang, Bing Zeng. Inf. Sci. (181): 1403-1409 (2011). Web SearchBibTeXDownload |
| 66 | A novel linear multi-secret sharing scheme for group communication in wireless mesh networks. Ching-Fang Hsu, Guo-Hua Cui, Qi Cheng, Jing Chen. J. Network and Computer Applications (34): 464-468 (2011). Web SearchBibTeXDownload |
| 65 | On the minimum gap between sums of square roots of small integers. Qi Cheng, Yu-Hsin Li. Theor. Comput. Sci. (412): 5458-5465 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 64 | Efficient distributed estimators in wireless sensor networks. Tao Wu, Qi Cheng. CISS 2010, 1-6. Web SearchBibTeXDownload |
| 63 | On Representable Matroids and Ideal Secret Sharing. Ching-Fang Hsu, Qi Cheng. IACR Cryptology ePrint Archive (2010): 232 (2010). Web SearchBibTeXDownload |
| 62 | Correct Expression of Carrier Frequency Offset Estimate in Fully-Loaded OFDM Systems [Jun 09 1634-1637]. Qi Cheng. IEEE Transactions on Communications (58): 3039 (2010). Web SearchBibTeXDownload |
| 61 | Complexity of decoding positive-rate primitive Reed-Solomon codes. Qi Cheng, Daqing Wan. IEEE Transactions on Information Theory (56): 5217-5222 (2010). Web SearchBibTeXDownload |
| 60 | Finding the Smallest Gap between Sums of Square Roots. Qi Cheng, Yu-Hsin Li. LATIN 2010, 446-455. Web SearchBibTeXDownload |
| 59 | Bounding the sum of square roots via lattice reduction. Qi Cheng, Xianmeng Meng, Celi Sun, Jiazhe Chen. Math. Comput. (79): 1109-1122 (2010). Web SearchBibTeXDownload |
| 58 | Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing. Qi Cheng, Sergey P. Tarasov, Mikhail N. Vyalyi. Theory Comput. Syst. (46): 120-142 (2010). Web SearchBibTeXDownload |
| 57 | One-Bit Quantizer Design for Distributed Estimation under the Minimax Criterion. Tao Wu, Qi Cheng. VTC Spring 2010, 1-5. Web SearchBibTeXDownload |
| 56 | Adaptive Pricing for Efficient Spectrum Sharing in MIMO Systems. Bhargav Kollimarla, Qi Cheng. VTC Spring 2010, 1-5. Web SearchBibTeXDownload |
| 55 | Exploitation of known short and long symbols for carrier frequency offset estimation in OFDM wireless LAN systems. Qi Cheng. WCNIS 2010, 150-153. Web SearchBibTeXDownload |
| 2009 |
|---|
| 54 | Joint channel and power allocation based on user satisfaction for cognitive radio. Qi Cheng, Bhargav Kollimarla. CISS 2009, 579-584. Web SearchBibTeXDownload |
| 53 | Bounding the Sum of Square Roots via Lattice Reduction. Qi Cheng, Xianmeng Meng, Celi Sun, Jiazhe Chen. CoRR (abs/0905.4487) (2009). Web SearchBibTeXDownload |
| 52 | Distributed estimation over fading channels using one-bit quantization. Tao Wu, Qi Cheng. IEEE Transactions on Wireless Communications (8): 5779-5784 (2009). Web SearchBibTeXDownload |
| 51 | On Non-representable Secret Sharing Matroids. Qi Cheng, Yong Yin, Kun Xiao, Ching-Fang Hsu. ISPEC 2009, 124-135. Web SearchBibTeXDownload |
| 50 | Comments on "A linear prediction method for parameter estimation of damped sinusoids". Qi Cheng. Signal Processing (89): 669-674 (2009). Web SearchBibTeXDownload |
| 49 | A deterministic reduction for the gap minimum distance problem: [extended abstract]. Qi Cheng, Daqing Wan. STOC 2009, 33-38. Web SearchBibTeXDownload |
| 2008 |
|---|
| 48 | Some rewrite optimizations of DB2 XQuery navigation. Guangjun Xie, Qi Cheng, Jarek Gryz, Calisto Zuzarte. CIKM 2008, 531-540. Web SearchBibTeXDownload |
| 47 | Distributed detection in the presence of frequency offset and phase shift. Tao Wu, Qi Cheng. CISS 2008, 582-587. Web SearchBibTeXDownload |
| 46 | Complexity of Decoding Positive-Rate Reed-Solomon Codes. Qi Cheng, Daqing Wan. ICALP (1) 2008, 283-293. Web SearchBibTeXDownload |
| 45 | A new unscented particle filter. Qi Cheng, Pascal Bondon. ICASSP 2008, 3417-3420. Web SearchBibTeXDownload |
| 44 | A Number Theoretic Memory Bounded Function and Its Applications. Qi Cheng, Yu-Hsin Li. ICYCS 2008, 2021-2025. Web SearchBibTeXDownload |
| 43 | Hard Problems of Algebraic Geometry Codes. Qi Cheng. IEEE Transactions on Information Theory (54): 402-406 (2008). Web SearchBibTeXDownload |
| 42 | Collaborative Event-Region and Boundary-Region Detections in Wireless Sensor Networks. Tsang-Yi Wang, Qi Cheng. IEEE Transactions on Signal Processing (56): 2547-2561 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 41 | Derandomization of Sparse Cyclotomic Integer Zero Testing. Qi Cheng. FOCS 2007, 74-80. Web SearchBibTeXDownload |
| 40 | Primality Proving via One Round in ECPP and One Iteration in AKS. Qi Cheng. J. Cryptology (20): 375-387 (2007). Web SearchBibTeXDownload |
| 39 | On the List and Bounded Distance Decodability of Reed-Solomon Codes. Qi Cheng, Daqing Wan. SIAM J. Comput. (37): 195-209 (2007). Web SearchBibTeXDownload |
| 38 | Constructing Finite Field Extensions with Large Order Elements. Qi Cheng. SIAM J. Discrete Math. (21): 726-730 (2007). Web SearchBibTeXDownload |
| 37 | On Deciding Deep Holes of Reed-Solomon Codes. Qi Cheng, Elizabeth Murray. TAMC 2007, 296-305. Web SearchBibTeXDownload |
| 36 | Distributed Sequential Event-Region Detection in Sensor Networks. Tsang-Yi Wang, Qi Cheng. VTC Fall 2007, 372-376. Web SearchBibTeXDownload |
| 2006 |
|---|
| 35 | Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. Qi Cheng, Ming-Deh A. Huang. Algorithmica (46): 59-68 (2006). Web SearchBibTeXDownload |
| 34 | On comparing sums of square roots of small integers. Qi Cheng. CoRR (abs/cs/0603002) (2006). Web SearchBibTeXDownload |
| 33 | Detection Performance Limits for Distributed Sensor Networks in the Presence of Nonideal Channels. Qi Cheng, Biao Chen, Pramod K. Varshney. IEEE Transactions on Wireless Communications (5): 3034-3038 (2006). Web SearchBibTeXDownload |
| 32 | Distributed detection in a large wireless sensor network. Ruixin Niu, Pramod K. Varshney, Qi Cheng. Information Fusion (7): 380-394 (2006). Web SearchBibTeXDownload |
| 31 | On Comparing Sums of Square Roots of Small Integers. Qi Cheng. MFCS 2006, 250-255. Web SearchBibTeXDownload |
| 2005 |
|---|
| 30 | Optimally weighted ESPRIT using uniform circular arrays. Qi Cheng, Runyu Yang, Huimin Zhang. Computers & Electrical Engineering (31): 272-281 (2005). Web SearchBibTeXDownload |
| 29 | On Deciding Deep Holes of Reed-Solomon Codes. Qi Cheng, Elizabeth Murray. CoRR (abs/cs/0509065) (2005). Web SearchBibTeXDownload |
| 28 | Hard Problems of Algebraic Geometry Codes. Qi Cheng. CoRR (abs/cs/0507026) (2005). Web SearchBibTeXDownload |
| 27 | On the construction of finite field elements of large order. Qi Cheng. Finite Fields and Their Applications (11): 358-366 (2005). Web SearchBibTeXDownload |
| 26 | Bandwidth management in distributed sequential detection. Qi Cheng, Pramod K. Varshney, Kishan G. Mehrotra, Chilukuri K. Mohan. IEEE Transactions on Information Theory (51): 2954-2961 (2005). Web SearchBibTeXDownload |
| 25 | Complexities for Generalized Models of Self-Assembly. Gagan Aggarwal, Qi Cheng, Michael H. Goldwasser, Ming-Yang Kao, Pablo Moisset de Espanés, Robert T. Schweller. SIAM J. Comput. (34): 1493-1515 (2005). Web SearchBibTeXDownload |
| 24 | On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields. Qi Cheng. SIAM J. Comput. (34): 1432-1442 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 23 | On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields. Qi Cheng. CRYPTO 2004, 201-212. Web SearchBibTeXDownload |
| 22 | On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract). Qi Cheng, Daqing Wan. FOCS 2004, 335-341. Web SearchBibTeXDownload |
| 21 | On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. Qi Cheng, Ming-Deh A. Huang. ISAAC 2004, 342-351. Web SearchBibTeXDownload |
| 20 | On counting and generating curves over small finite fields. Qi Cheng, Ming-Deh A. Huang. J. Complexity (20): 284-296 (2004). Web SearchBibTeXDownload |
| 19 | Invadable self-assembly: combining robustness with efficiency. Ho-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés. SODA 2004, 890-899. Web SearchBibTeXDownload |
| 18 | Constructing finite field extensions with large order elements. Qi Cheng. SODA 2004, 1130-1131. Web SearchBibTeXDownload |
| 17 | On the ultimate complexity of factorials. Qi Cheng. Theor. Comput. Sci. (326): 419-429 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 16 | Straight-line programs and torsion points on elliptic curves. Qi Cheng. Computational Complexity (12): 150-161 (2003). Web SearchBibTeXDownload |
| 15 | Primality Proving via One Round in ECPP and One Iteration in AKS. Qi Cheng. CRYPTO 2003, 338-348. Web SearchBibTeXDownload |
| 14 | WinMagic : Subquery Elimination Using Window Aggregation. Calisto Zuzarte, Hamid Pirahesh, Wenbin Ma, Qi Cheng, Linqi Liu, Kwai Wong. SIGMOD Conference 2003, 652-656. Cited by 7Web SearchBibTeXDownload |
| 13 | On the Ultimate Complexity of Factorials. Qi Cheng. STACS 2003, 157-166. Web SearchBibTeXDownload |
| 2002 |
|---|
| 12 | Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture. Qi Cheng, Shigenori Uchiyama. CT-RSA 2002, 290-299. Cited by 4Web SearchBibTeXDownload |
| 11 | A New Class of Unsafe Primes. Qi Cheng. IACR Cryptology ePrint Archive (2002): 109 (2002). Web SearchBibTeXDownload |
| 10 | Kolmogorov random graphs only have trivial stable colorings. Qi Cheng, Fang Fang. Inf. Process. Lett. (81): 133-136 (2002). Web SearchBibTeXDownload |
| 9 | Some Remarks on the L-Conjecture. Qi Cheng. ISAAC 2002, 128-136. Web SearchBibTeXDownload |
| 8 | Combinatorial optimization problems in self-assembly. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund. STOC 2002, 23-32. Web SearchBibTeXDownload |
| 2001 |
|---|
| 7 | Running time and program size for self-assembled squares. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang. STOC 2001, 740-748. Web SearchBibTeXDownload |
| 2000 |
|---|
| 6 | Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments. Qi Cheng, Ming-Deh A. Huang. ANTS 2000, 233-246. Web SearchBibTeXDownload |
| 5 | Computing simple paths among obstacles. Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram. Comput. Geom. (16): 223-233 (2000). Web SearchBibTeXDownload |
| 4 | Asymptotic performance of optimal gain-and-phase estimators of sensor arrays. Qi Cheng, Yingbo Hua, Petre Stoica. IEEE Transactions on Signal Processing (48): 3587-3590 (2000). Web SearchBibTeXDownload |
| 1999 |
|---|
| 3 | Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database. Qi Cheng, Jarek Gryz, Fred Koo, T. Y. Cliff Leung, Linqi Liu, Xiaoyan Qian, K. Bernhard Schiefer. VLDB 1999, 687-698. Web SearchBibTeX |
| 1997 |
|---|
| 2 | MNP: A class of NP optimization problems. Qi Cheng, Hong Zhu. J. Comput. Sci. Technol. (12): 306-313 (1997). Web SearchBibTeXDownload |
| 1995 |
|---|
| 1 | MNP: A Class of NP Optimization Problems (Extended Abstract). Qi Cheng, Hong Zhu. COCOON 1995, 559-565. Web SearchBibTeXDownload |
