Qi Cheng
Orcid: 0000-0003-4336-3082Affiliations:
- University of Oklahoma, School of Computer Science, Norman, OK, USA
- University of Southern California, Los Angeles, CA, USA (PhD 2001)
- University of California, Riverside, CA, USA (1996 - 1997)
- Fudan University, Shanghai, China (1995 - 1996)
According to our database1,
Qi Cheng
authored at least 54 papers
between 1995 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
2
1
1
1
2
3
1
2
1
1
3
3
1
3
1
3
2
1
2
1
1
1
1
1
1
1
2
2
1
2
3
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2022
J. Complex., 2022
2021
IACR Cryptol. ePrint Arch., 2021
2019
A faster method to compute primitive elements and discrete logarithms of factor base in Artin-Schreier extensions.
Sci. China Inf. Sci., 2019
2018
Finite Fields Their Appl., 2018
2017
Finite Fields Their Appl., 2017
2016
IEEE Trans. Inf. Theory, 2016
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields.
SIAM J. Comput., 2016
2015
On Generating Coset Representatives of PGL<sub>2</sub>(F<sub>q</sub>) in PGL<sub>2</sub>(F<sub>q<sup>2</sup></sub>).
IACR Cryptol. ePrint Arch., 2015
On Generating Coset Representatives of PGL<sub>2</sub>(F<sub>q</sub>) in PGL<sub>2</sub>(F<sub>q</sub><sup>2</sup>).
Proceedings of the Information Security and Cryptology - 11th International Conference, 2015
2014
Theor. Comput. Sci., 2014
2013
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013
2012
IEEE Trans. Inf. Theory, 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
Theor. Comput. Sci., 2011
Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices.
IACR Cryptol. ePrint Arch., 2011
2010
IEEE Trans. Inf. Theory, 2010
Theory Comput. Syst., 2010
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
2008
Proceedings of the 9th International Conference for Young Computer Scientists, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
SIAM J. Discret. Math., 2007
SIAM J. Comput., 2007
Proceedings of the Theory and Applications of Models of Computation, 2007
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
2006
Algorithmica, 2006
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
2005
SIAM J. Comput., 2005
Finite Fields Their Appl., 2005
2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract).
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
2002
Inf. Process. Lett., 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture.
Proceedings of the Topics in Cryptology, 2002
2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
2000
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000
1997
1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995