Shenggen Zheng
Orcid: 0000-0001-7325-2506
According to our database1,
Shenggen Zheng
authored at least 41 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Problems of a quantum secure direct communication scheme based on intermediate-basis.
Quantum Inf. Process., June, 2024
J. Comput. Syst. Sci., May, 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Discussion on the initial states of controlled bidirectional quantum secure direct communication.
Quantum Inf. Process., December, 2023
Two intercept-and-resend attacks on a bidirectional quantum secure direct communication and its improvement.
Quantum Inf. Process., September, 2023
A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation.
Entropy, March, 2023
Quantum Inf. Process., 2023
Proceedings of the IEEE/ACM International Conference on Computer Aided Design, 2023
Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2023
2022
Quantum Inf. Process., 2022
2021
Proceedings of the IEEE/ACM International Conference On Computer Aided Design, 2021
2020
QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution.
Quantum Inf. Process., 2020
Inf. Sci., 2020
RNA-2QCFA: Evolving Two-way Quantum Finite Automata with Classical States for RNA Secondary Structures.
CoRR, 2020
QPSO-CD: Quantum-behaved Particle Swarm Optimization Algorithm with Cauchy Distribution.
CoRR, 2020
Proceedings of the Neural Information Processing - 27th International Conference, 2020
2019
Quantum Inf. Process., 2019
Efficient Multiparty Quantum Key Agreement With a Single $d$ -Level Quantum System Secure Against Collusive Attack.
IEEE Access, 2019
2017
Theor. Comput. Sci., 2017
Quantum Inf. Process., 2017
Math. Struct. Comput. Sci., 2017
Inf. Process. Lett., 2017
Proceedings of the Theory and Practice of Natural Computing - 6th International Conference, 2017
2016
Characterizations of symmetrically partial Boolean functions with exact quantum query complexity.
CoRR, 2016
2015
Quantum Inf. Comput., 2015
Int. J. Found. Comput. Sci., 2015
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata.
Inf. Comput., 2015
2014
RAIRO Theor. Informatics Appl., 2014
Recognizability versus solvability of promise problems in finite, classical and quantum automata, framework.
CoRR, 2014
Proceedings of the Computing with New Resources, 2014
2013
Theor. Comput. Sci., 2013
Communication complexity of promise problems and their applications to finite automata.
CoRR, 2013
2012
Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States.
Int. J. Found. Comput. Sci., 2012
Proceedings of the Quantitative Logic and Soft Computing, 2012
Proceedings of the Languages Alive, 2012