default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShiguang Feng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2016
[b1]Shiguang Feng:
The expressive power, satisfiability and path checking problems of MTL and TPTL over non-monotonic data words. Leipzig University, Germany, 2016, pp. 1-127
Journal Articles
- 2023
- [j13]Wei Jin
, Shuo Zhang, Jian Li, Mengqiang Feng, Shiguang Feng, Yuping Lu:
A Novel Differential Protection Scheme for Distribution Lines Under Weak Synchronization Conditions Considering DG Characteristics. IEEE Access 11: 86561-86574 (2023) - [j12]Xiaofeng Gao, Zhijin Guan, Shiguang Feng, Yibo Jiang:
Quantum Circuit Template Matching Optimization Method for Constrained Connectivity. Axioms 12(7): 687 (2023) - [j11]Yang Qian, Zhijin Guan, Shenggen Zheng, Shiguang Feng:
A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation. Entropy 25(3): 465 (2023) - [j10]Zhijin Guan, Renjie Liu, Xueyun Cheng, Shiguang Feng, Pengcheng Zhu:
Suppression of Crosstalk in Quantum Circuit Based on Instruction Exchange Rules and Duration. Entropy 25(6): 855 (2023) - [j9]Kexu Wang, Shiguang Feng, Xishun Zhao:
Capturing the polynomial hierarchy by second-order revised Krom logic. Log. Methods Comput. Sci. 19(3) (2023) - [j8]Xueyun Cheng, Xinyu Chen, Kexin Cao, Pengcheng Zhu, Shiguang Feng, Zhijin Guan:
Optimization of the transmission cost of distributed quantum circuits based on merged transfer. Quantum Inf. Process. 22(5): 187 (2023) - [j7]Pengcheng Zhu, Weiping Ding, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng:
A Variation-Aware Quantum Circuit Mapping Approach Based on Multi-Agent Cooperation. IEEE Trans. Computers 72(8): 2237-2249 (2023) - 2022
- [j6]Pengcheng Zhu, Shenggen Zheng, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng:
The complexity of quantum circuit mapping with fixed parameters. Quantum Inf. Process. 21(1) (2022) - [j5]Pengcheng Zhu, Shiguang Feng, Zhijin Guan:
An Iterated Local Search Methodology for the Qubit Mapping Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(8): 2587-2597 (2022) - 2020
- [j4]Shiguang Feng, Claudia Carapelle, Oliver Fernández Gil, Karin Quaas:
MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability. ACM Trans. Comput. Log. 21(2): 12:1-12:34 (2020) - 2017
- [j3]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path Checking for MTL and TPTL over Data Words. Log. Methods Comput. Sci. 13(3) (2017) - [j2]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL∗ with Local Tree Constraints. Theory Comput. Syst. 61(2): 689-720 (2017) - 2013
- [j1]Shiguang Feng, Xishun Zhao:
Complexity and expressive power of second-order extended Horn logic. Math. Log. Q. 59(1-2): 4-11 (2013)
Conference and Workshop Papers
- 2023
- [c6]Shiguang Feng:
The Expressive Power of Revised Datalog on Problems with Closure Properties. LORI 2023: 109-125 - 2015
- [c5]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL* with Tree Constraints. CSR 2015: 94-108 - [c4]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path Checking for MTL and TPTL over Data Words. DLT 2015: 326-339 - 2014
- [c3]Shiguang Feng:
Weighted Temporal Logic. Joint Workshop of the German Research Training Groups in Computer Science 2014: 143 - [c2]Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas:
Satisfiability for MTL and TPTL over Non-monotonic Data Words. LATA 2014: 248-259 - [c1]Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas:
Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words. AFL 2014: 174-187
Informal and Other Publications
- 2023
- [i7]Xiaowei Huang, Shiguang Feng, Lvzhou Li:
Quantum and classical query complexities for determining connectedness of matroids. CoRR abs/2306.12103 (2023) - 2022
- [i6]Pengcheng Zhu, Shenggen Zheng, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng:
The Complexity of Quantum Circuit Mapping with Fixed Parameters. CoRR abs/2207.08438 (2022) - [i5]Shiguang Feng, Kexu Wang, Xishun Zhao, Yuping Shen:
Capturing the polynomial hierarchy by second-order revised Krom logic. CoRR abs/2207.09226 (2022) - [i4]Shiguang Feng, Xishun Zhao:
The Complexity and Expressive Power of Second-Order Extended Logic. CoRR abs/2209.04837 (2022) - 2014
- [i3]Shiguang Feng, Xishun Zhao:
More on Descriptive Complexity of Second-Order HORN Logics. CoRR abs/1403.6611 (2014) - [i2]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL* with tree constraints. CoRR abs/1412.2905 (2014) - [i1]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path-Checking for MTL and TPTL over Data Words. CoRR abs/1412.3644 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
