2009 |
45 | EE | Qi Cheng,
Yong Yin,
Kun Xiao,
Ching-Fang Hsu:
On Non-representable Secret Sharing Matroids.
ISPEC 2009: 124-135 |
44 | EE | Qi Cheng:
Comments on "A linear prediction method for parameter estimation of damped sinusoids".
Signal Processing 89(4): 669-674 (2009) |
2008 |
43 | EE | Guangjun Xie,
Qi Cheng,
Jarek Gryz,
Calisto Zuzarte:
Some rewrite optimizations of DB2 XQuery navigation.
CIKM 2008: 531-540 |
42 | EE | Tao Wu,
Qi Cheng:
Distributed detection in the presence of frequency offset and phase shift.
CISS 2008: 582-587 |
41 | EE | Qi Cheng,
Daqing Wan:
Complexity of Decoding Positive-Rate Reed-Solomon Codes.
ICALP (1) 2008: 283-293 |
40 | EE | Qi Cheng,
Yu-Hsin Li:
A Number Theoretic Memory Bounded Function and Its Applications.
ICYCS 2008: 2021-2025 |
39 | EE | Qi Cheng,
Daqing Wan:
Complexity of Decoding Positive-Rate Reed-Solomon Codes
CoRR abs/0802.1220: (2008) |
38 | EE | Qi Cheng:
Hard Problems of Algebraic Geometry Codes.
IEEE Transactions on Information Theory 54(1): 402-406 (2008) |
2007 |
37 | EE | Qi Cheng:
Derandomization of Sparse Cyclotomic Integer Zero Testing.
FOCS 2007: 74-80 |
36 | EE | Qi Cheng,
Elizabeth Murray:
On Deciding Deep Holes of Reed-Solomon Codes.
TAMC 2007: 296-305 |
35 | EE | Tsang-Yi Wang,
Qi Cheng:
Distributed Sequential Event-Region Detection in Sensor Networks.
VTC Fall 2007: 372-376 |
34 | EE | Qi Cheng:
Primality Proving via One Round in ECPP and One Iteration in AKS.
J. Cryptology 20(3): 375-387 (2007) |
33 | EE | Qi Cheng,
Daqing Wan:
On the List and Bounded Distance Decodability of Reed-Solomon Codes.
SIAM J. Comput. 37(1): 195-209 (2007) |
32 | EE | Qi Cheng:
Constructing Finite Field Extensions with Large Order Elements.
SIAM J. Discrete Math. 21(3): 726-730 (2007) |
2006 |
31 | EE | Qi Cheng:
On Comparing Sums of Square Roots of Small Integers.
MFCS 2006: 250-255 |
30 | EE | Qi Cheng,
Ming-Deh A. Huang:
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
Algorithmica 46(1): 59-68 (2006) |
29 | EE | Qi Cheng:
On comparing sums of square roots of small integers
CoRR abs/cs/0603002: (2006) |
28 | EE | Qi Cheng,
Biao Chen,
Pramod K. Varshney:
Detection Performance Limits for Distributed Sensor Networks in the Presence of Nonideal Channels.
IEEE Transactions on Wireless Communications 5(11): 3034-3038 (2006) |
27 | EE | Ruixin Niu,
Pramod K. Varshney,
Qi Cheng:
Distributed detection in a large wireless sensor network.
Information Fusion 7(4): 380-394 (2006) |
2005 |
26 | EE | Qi Cheng:
Hard Problems of Algebraic Geometry Codes
CoRR abs/cs/0507026: (2005) |
25 | EE | Qi Cheng,
Elizabeth Murray:
On Deciding Deep Holes of Reed-Solomon Codes
CoRR abs/cs/0509065: (2005) |
24 | EE | Qi Cheng,
Runyu Yang,
Huimin Zhang:
Optimally weighted ESPRIT using uniform circular arrays.
Computers & Electrical Engineering 31(4-5): 272-281 (2005) |
23 | EE | Qi Cheng,
Pramod K. Varshney,
Kishan G. Mehrotra,
Chilukuri K. Mohan:
Bandwidth management in distributed sequential detection.
IEEE Transactions on Information Theory 51(8): 2954-2961 (2005) |
22 | EE | Qi Cheng:
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields.
SIAM J. Comput. 34(6): 1432-1442 (2005) |
21 | EE | Gagan Aggarwal,
Qi Cheng,
Michael H. Goldwasser,
Ming-Yang Kao,
Pablo Moisset de Espanés,
Robert T. Schweller:
Complexities for Generalized Models of Self-Assembly.
SIAM J. Comput. 34(6): 1493-1515 (2005) |
2004 |
20 | EE | Qi Cheng:
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields.
CRYPTO 2004: 201-212 |
19 | EE | Qi Cheng,
Daqing Wan:
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract).
FOCS 2004: 335-341 |
18 | EE | Qi Cheng,
Ming-Deh A. Huang:
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
ISAAC 2004: 342-351 |
17 | EE | Qi Cheng:
Constructing finite field extensions with large order elements.
SODA 2004: 1130-1131 |
16 | EE | 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 |
15 | EE | Qi Cheng,
Ming-Deh A. Huang:
On counting and generating curves over small finite fields.
J. Complexity 20(2-3): 284-296 (2004) |
14 | EE | Qi Cheng:
On the ultimate complexity of factorials.
Theor. Comput. Sci. 326(1-3): 419-429 (2004) |
2003 |
13 | EE | Qi Cheng:
Primality Proving via One Round in ECPP and One Iteration in AKS.
CRYPTO 2003: 338-348 |
12 | EE | Calisto Zuzarte,
Hamid Pirahesh,
Wenbin Ma,
Qi Cheng,
Linqi Liu,
Kwai Wong:
WinMagic : Subquery Elimination Using Window Aggregation.
SIGMOD Conference 2003: 652-656 |
11 | EE | Qi Cheng:
On the Ultimate Complexity of Factorials.
STACS 2003: 157-166 |
10 | EE | Qi Cheng:
Straight-line programs and torsion points on elliptic curves.
Computational Complexity 12(3-4): 150-161 (2003) |
2002 |
9 | EE | Qi Cheng,
Shigenori Uchiyama:
Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture.
CT-RSA 2002: 290-299 |
8 | EE | Qi Cheng:
Some Remarks on the L-Conjecture.
ISAAC 2002: 128-136 |
7 | EE | 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 |
6 | EE | Qi Cheng,
Fang Fang:
Kolmogorov random graphs only have trivial stable colorings.
Inf. Process. Lett. 81(3): 133-136 (2002) |
2001 |
5 | EE | Leonard M. Adleman,
Qi Cheng,
Ashish Goel,
Ming-Deh A. Huang:
Running time and program size for self-assembled squares.
STOC 2001: 740-748 |
2000 |
4 | | Qi Cheng,
Ming-Deh A. Huang:
Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments.
ANTS 2000: 233-246 |
3 | | Qi Cheng,
Marek Chrobak,
Gopalakrishnan Sundaram:
Computing simple paths among obstacles.
Comput. Geom. 16(4): 223-233 (2000) |
1999 |
2 | EE | 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 |
1995 |
1 | | Qi Cheng,
Hong Zhu:
MNP: A Class of NP Optimization Problems (Extended Abstract).
COCOON 1995: 559-565 |