The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Qi Cheng: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (3, 15)][DBLP]
    VLDB, 1999, pp:687-698 [Conf]
  2. Qi Cheng, Ming-Deh A. Huang
    Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments. [Citation Graph (0, 0)][DBLP]
    ANTS, 2000, pp:233-246 [Conf]
  3. Qi Cheng, Hong Zhu
    MNP: A Class of NP Optimization Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:559-565 [Conf]
  4. Qi Cheng
    Primality Proving via One Round in ECPP and One Iteration in AKS. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:338-348 [Conf]
  5. Qi Cheng
    On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:201-212 [Conf]
  6. Qi Cheng, Shigenori Uchiyama
    Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2002, pp:290-299 [Conf]
  7. Qi Cheng, Daqing Wan
    On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:335-341 [Conf]
  8. Qi Cheng
    Some Remarks on the L-Conjecture. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:128-136 [Conf]
  9. Qi Cheng, Ming-Deh A. Huang
    On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:342-351 [Conf]
  10. Qi Cheng
    On Comparing Sums of Square Roots of Small Integers. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:250-255 [Conf]
  11. Calisto Zuzarte, Hamid Pirahesh, Wenbin Ma, Qi Cheng, Linqi Liu, Kwai Wong
    WinMagic : Subquery Elimination Using Window Aggregation. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2003, pp:652-656 [Conf]
  12. Ho-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés
    Invadable self-assembly: combining robustness with efficiency. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:890-899 [Conf]
  13. Qi Cheng
    Constructing finite field extensions with large order elements. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1130-1131 [Conf]
  14. Qi Cheng
    On the Ultimate Complexity of Factorials. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:157-166 [Conf]
  15. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang
    Running time and program size for self-assembled squares. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:740-748 [Conf]
  16. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:23-32 [Conf]
  17. Qi Cheng, Ming-Deh A. Huang
    Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:59-68 [Journal]
  18. Qi Cheng
    Straight-line programs and torsion points on elliptic curves. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:3-4, pp:150-161 [Journal]
  19. Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
    Computing simple paths among obstacles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:223-233 [Journal]
  20. Ruixin Niu, Pramod K. Varshney, Qi Cheng
    Distributed detection in a large wireless sensor network. [Citation Graph (0, 0)][DBLP]
    Information Fusion, 2006, v:7, n:4, pp:380-394 [Journal]
  21. Qi Cheng, Fang Fang
    Kolmogorov random graphs only have trivial stable colorings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:3, pp:133-136 [Journal]
  22. Qi Cheng, Ming-Deh A. Huang
    On counting and generating curves over small finite fields. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:284-296 [Journal]
  23. Qi Cheng, Daqing Wan
    On the List and Bounded Distance Decodability of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:195-209 [Journal]
  24. Qi Cheng
    On the ultimate complexity of factorials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:419-429 [Journal]
  25. Qi Cheng, Pramod K. Varshney, Kishan G. Mehrotra, Chilukuri K. Mohan
    Bandwidth management in distributed sequential detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:8, pp:2954-2961 [Journal]
  26. Qi Cheng, Elizabeth Murray
    On Deciding Deep Holes of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:296-305 [Conf]
  27. Qi Cheng
    On comparing sums of square roots of small integers [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  28. Qi Cheng
    Primality Proving via One Round in ECPP and One Iteration in AKS. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2007, v:20, n:3, pp:375-387 [Journal]
  29. Qi Cheng, Runyu Yang, Huimin Zhang
    Optimally weighted ESPRIT using uniform circular arrays. [Citation Graph (0, 0)][DBLP]
    Computers & Electrical Engineering, 2005, v:31, n:4-5, pp:272-281 [Journal]

  30. Some rewrite optimizations of DB2 XQuery navigation. [Citation Graph (, )][DBLP]


  31. Derandomization of Sparse Cyclotomic Integer Zero Testing. [Citation Graph (, )][DBLP]


  32. Complexity of Decoding Positive-Rate Reed-Solomon Codes. [Citation Graph (, )][DBLP]


  33. On Non-representable Secret Sharing Matroids. [Citation Graph (, )][DBLP]


  34. Finding the Smallest Gap between Sums of Square Roots. [Citation Graph (, )][DBLP]


  35. A deterministic reduction for the gap minimum distance problem: [extended abstract]. [Citation Graph (, )][DBLP]


  36. Distributed Sequential Event-Region Detection in Sensor Networks. [Citation Graph (, )][DBLP]


  37. Adaptive Pricing for Efficient Spectrum Sharing in MIMO Systems. [Citation Graph (, )][DBLP]


  38. One-Bit Quantizer Design for Distributed Estimation under the Minimax Criterion. [Citation Graph (, )][DBLP]


  39. Distributed detection in the presence of frequency offset and phase shift. [Citation Graph (, )][DBLP]


  40. A Number Theoretic Memory Bounded Function and Its Applications. [Citation Graph (, )][DBLP]


  41. A new unscented particle filter. [Citation Graph (, )][DBLP]


  42. Hard Problems of Algebraic Geometry Codes [Citation Graph (, )][DBLP]


  43. On Deciding Deep Holes of Reed-Solomon Codes [Citation Graph (, )][DBLP]


  44. Complexity of Decoding Positive-Rate Reed-Solomon Codes [Citation Graph (, )][DBLP]


  45. Bounding the Sum of Square Roots via Lattice Reduction [Citation Graph (, )][DBLP]


Search in 0.151secs, Finished in 0.152secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002