Theory of Computing Systems
| 短名 | Theory Comput Syst |
| Journal Impact | 0.58 |
| 国际分区 | MATHEMATICS(Q3) |
| 期刊索引 | SCI Q4中科院 4 区 |
| ISSN | 1432-4350, 1433-0490 |
| h-index | 48 |
| 国内分区 | 计算机科学(4区)计算机科学计算机理论方法(4区)计算机科学数学(4区) |
| 涉及主题 | 计算机科学数学组合数学离散数学算法程序设计语言数学分析理论计算机科学哲学物理工程类人工智能操作系统几何学经济数学优化 |
| 出版信息 | 出版商: Springer New York，出版周期: Bimonthly，期刊类型: journal |
| 基本数据 | 创刊年份: 1996，原创研究文献占比: 100.00%，自引率:0.00%， Gold OA占比: 40.00% |
| 平均审稿周期 | 网友分享经验：较慢,6-12周 |
| 平均录用比例 | 网友分享经验：容易 |
期刊引文格式
这些示例是对学术期刊文章的引用，以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章，因此这些字段是可选的。有些电子期刊不提供页面范围，而是列出文章标识符。在这种情况下，使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用，以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
String Attractors of Some Simple-Parry Automatic Sequences
2024-9-10
Jumping Automata over Infinite Words
2024-9-10
On the Solution Sets of Three-Variable Word Equations
2024-8-20
Near-Optimal Auctions on Independence Systems
2024-8-17
2-Balanced Sequences Coding Rectangle Exchange Transformation
2024-8-10
Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs
2024-8-10
Non-Constructive Upper Bounds for Repetition Thresholds
2024-8-1
Obstructions to Return Preservation for Episturmian Morphisms
2024-8-1
International Colloquium on Automata, Languages and Programming (ICALP 2020)
2024-7-16
Lower Bounds on the Amortized Time Complexity of Shared Objects
2024-7-12
Cluster Editing for Multi-Layer and Temporal Graphs
2024-7-3
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity
2024-6-27
Minimum Cut in $$O(m\log ^2 n)$$ Time
2024-6-12
What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs
2024-6-5
Routing and Wavelength Assignment Algorithm for Mesh-based Multiple Multicasts in Optical Network-on-chip
2024-5-23
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022
2024-5-21
Prediction and MDL for infinite sequences
2024-5-20
Preface of STACS 2021 Special Issue
2024-5-10
The Power Word Problem in Graph Products
2024-5-7
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words
2024-4-11
How to Hide a Clique?
2024-4-5
Pumping Lemmas Can be “Harmful”
2024-4-5
Revisiting the Distortion of Distributed Voting
2024-4-5
Placing Green Bridges Optimally, with a Multivariate Analysis
2024-4-1
CNF Encodings of Symmetric Functions
2024-3-26
Approximation Algorithms for the MAXSPACE Advertisement Problem
2024-3-25
Performing Regular Operations with 1-Limited Automata
2024-3-14
Imperative Process Algebra and Models of Parallel Computation
2024-3-14
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance
2024-3-6
New Results on the Remote Set Problem and Its Applications in Complexity Study
2024-3-5
On Non-principal Arithmetical Numberings and Families
2024-2-23
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
2024-2-23
On the Decidability of Infix Inclusion Problem
2024-1-13
Farkas Bounds on Horn Constraint Systems
2024-1-6
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees
2023-12-20
Upper Bounds on Communication in Terms of Approximate Rank
2023-12-12
Beyond the Existential Theory of the Reals
2023-12-12
Improved Bounds for Matching in Random-Order Streams
2023-12-12
A Closer Look at the Expressive Power of Logics Based on Word Equations
2023-12-11
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs
2023-12-4
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
2023-12-1
Disentangling the Computational Complexity of Network Untangling
2023-11-14
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes
2023-11-7
Quantum Algorithm for Lexicographically Minimal String Rotation
2023-10-24
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams
2023-10-19
Toward Online Mobile Facility Location on General Metrics
2023-10-6
Weighted Tree Automata with Constraints
2023-10-3
b-Coloring Parameterized by Clique-Width
2023-9-23
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
2023-9-20
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings
2023-8-29
帮你贴心管理全部的文献
研飞ivySCI，高效的论文管理
投稿经验分享
分享我的经验，帮你走得更远