Academic Journal
Q3Theory of Computing Systems
About Theory of Computing Systems
Theory of Computing Systems is a scholarly journal published by Springer New York. SCImago 2025 lists it in Q3, with an SJR of 0.295 and H-index of 52.
Coverage: 1996-2026. Research categories: Computational Theory and Mathematics (Q3); Theoretical Computer Science (Q4).
Verified field sources
- Journal Impact Factor: 0.6 — Official source; checked 2026-10-03. Journal metric year and editorial leadership as listed on the Springer Nature journal homepage.
- Impact Factor year: 2025 — Official source; checked 2026-10-03. Journal metric year and editorial leadership as listed on the Springer Nature journal homepage.
- Editor(s): Mitsunori Ogihara (Editor-in-Chief) — Official source; checked 2026-10-03. Journal metric year and editorial leadership as listed on the Springer Nature journal homepage.
Source-backed journal facts
Topics in published research
semigroups and automata theory; Complexity and Algorithms in Graphs; Computability, Logic, AI Algorithms; Advanced Graph Theory Research; Algorithms and Data Compression; Optimization and Search Problems.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Reported open-access list prices
3,190.00 USD; 2,590.00 EUR; 2,290.00 GBP
APC list prices reported by OpenAlex, which obtains this information from DOAJ. Confirm current charges, taxes, waivers and eligibility with the publisher; this is not a fee quotation.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
Real $$\tau $$-Conjecture for Sum-of-squares: A Unified Approach to Lower Bound and Derandomization
Pranjal Dutta
2026-12 · DOI: 10.1007/s00224-026-10294-7Fast Algorithms for a Large-Scale File Aggregation Problem
Lifeng Guo, Changhong Lu, Qingjie Ye
2026-09 · DOI: 10.1007/s00224-026-10293-8Suffixient Arrays: A New Efficient Suffix Array Compression Technique
Davide Cenzato, Lore Depuydt, Travis Gagie, Sung-Hwan Kim et al.
2026-09 · DOI: 10.1007/s00224-026-10287-6Efficient Algorithms to Compute Closed Substrings
Samkith K Jain, Neerja Mhaskar
2026-09 · DOI: 10.1007/s00224-026-10290-xConstrained Nonnegative Gram Feasibility is $$\exists \mathbb {R}$$-Complete
Angshul Majumdar
2026-09 · DOI: 10.1007/s00224-026-10292-9Searching in Euclidean Spaces with Predictions
Sergio Cabello, Panos Giannopoulos
2026-09 · DOI: 10.1007/s00224-026-10291-wSynchronization of Parikh Automata
Stefan Hoffmann
2026-09 · DOI: 10.1007/s00224-025-10225-yComplexity Classes for Online Problems with and without Predictions
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen et al.
2026-09 · DOI: 10.1007/s00224-026-10285-8Search Versus Search for Collapsing Electoral Control Types
Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez et al.
2026-09 · DOI: 10.1007/s00224-026-10289-4Parameterized Complexity of Generalizations of Edge Dominating Set
Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh et al.
2026-09 · DOI: 10.1007/s00224-026-10288-5Bijective BWT Based Compression Schemes
Golnaz Badkobeh, Hideo Bannai, Tomohiro I, Dominik Köppl et al.
2026-09 · DOI: 10.1007/s00224-025-10235-wMultiplication of 0-1 Matrices via Clustering
Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson et al.
2026-09 · DOI: 10.1007/s00224-026-10286-7Accelerating Stage 2 in ECM Using Elliptic Divisibility Sequences
Ziwen Liao, Fangguo Zhang
2026-09 · DOI: 10.1007/s00224-026-10284-9Erdős–Selfridge Theorem for Nonmonotone CNFs
Md Lutfar Rahman, Thomas Watson
2026-06 · DOI: 10.1007/s00224-026-10281-yCutoff Theorems for the Model Checking of Crash-Tolerant Causal Broadcast
Leila NamvariTazehkand, Saeid Pashazadeh, Ali Ebnenasir
2026-06 · DOI: 10.1007/s00224-026-10283-wA Formalization of Financial Transactions in Secure Computation: How to Handle Coins with Various Colors
Takeshi Nakai
2026-06 · DOI: 10.1007/s00224-026-10280-zEffective Weak Convergence and Tightness of Measures in Computable Polish Spaces
Diego A. Rojas
2026-06 · DOI: 10.1007/s00224-026-10282-xReflection on the Reflection Complexity
Lubomíra Dvořáková, Edita Pelantová
2026-06 · DOI: 10.1007/s00224-026-10278-7An Algorithmic Analysis of MAXNAESAT Variants
Sangram K. Jena, K. Subramani
2026-06 · DOI: 10.1007/s00224-026-10276-9Stability in Graphs with Matroid Constraints
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh et al.
2026-06 · DOI: 10.1007/s00224-026-10277-8Reviews
Community Reviews
Version History
October 4, 2026 at 9:30 pm
October 2, 2026