Shiguang Feng

Orcid: 0000-0002-5110-3881

According to our database1, Shiguang Feng authored at least 26 papers between 2013 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Revisiting fixed-point quantum search: proof of the quasi-Chebyshev lemma.
Frontiers Comput. Sci., October, 2026

Quantum and classical query complexities for determining connectedness of matroids.
J. Comput. Syst. Sci., 2026

2025
A Line-Mode Current Slope-Based Protection Scheme for Pole-to-Pole Short-Circuit Faults in DC Distribution Networks.
Symmetry, 2025

The logics for the complexity classes with limited non-determinism.
J. Log. Comput., 2025

2023
A Variation-Aware Quantum Circuit Mapping Approach Based on Multi-Agent Cooperation.
IEEE Trans. Computers, August, 2023

Quantum Circuit Template Matching Optimization Method for Constrained Connectivity.
Axioms, July, 2023

Suppression of Crosstalk in Quantum Circuit Based on Instruction Exchange Rules and Duration.
Entropy, June, 2023

Optimization of the transmission cost of distributed quantum circuits based on merged transfer.
Quantum Inf. Process., May, 2023

A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation.
Entropy, March, 2023

Capturing the polynomial hierarchy by second-order revised Krom logic.
Log. Methods Comput. Sci., 2023

A Novel Differential Protection Scheme for Distribution Lines Under Weak Synchronization Conditions Considering DG Characteristics.
IEEE Access, 2023

The Expressive Power of Revised Datalog on Problems with Closure Properties.
Proceedings of the Logic, Rationality, and Interaction - 9th International Workshop, 2023

2022
An Iterated Local Search Methodology for the Qubit Mapping Problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022

The complexity of quantum circuit mapping with fixed parameters.
Quantum Inf. Process., 2022

The Complexity and Expressive Power of Second-Order Extended Logic.
CoRR, 2022

Capturing the polynomial hierarchy by second-order revised Krom logic.
CoRR, 2022

2020
MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability.
ACM Trans. Comput. Log., 2020

2017
Satisfiability of ECTL∗ with Local Tree Constraints.
Theory Comput. Syst., 2017

2016
The expressive power, satisfiability and path checking problems of MTL and TPTL over non-monotonic data words.
PhD thesis, 2016

2015
Path Checking for MTL and TPTL over Data Words.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Satisfiability of ECTL* with Tree Constraints.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
More on Descriptive Complexity of Second-Order HORN Logics.
CoRR, 2014

Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Satisfiability for MTL and TPTL over Non-monotonic Data Words.
Proceedings of the Language and Automata Theory and Applications, 2014

Weighted Temporal Logic.
Proceedings of the 8th Joint Workshop of the German Research Training Groups in Computer Science, 2014

2013
Complexity and expressive power of second-order extended Horn logic.
Math. Log. Q., 2013


  Loading...