Theory of Computing Systems

Papers
(The TQCC of Theory of Computing Systems is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-04-01 to 2025-04-01.)
ArticleCitations
Improved Methods to Solve Nonlinear Invariants with Low Algebraic Degree for Linear Transformation9
On Triangle Estimation Using Tripartite Independent Set Queries8
On the Hierarchy of Swarm-automaton for the Number of Agents7
Obstructions to Return Preservation for Episturmian Morphisms6
Foreword: a Commemorative Issue for Alan L. Selman6
One-Sided Markets with Externalities6
Revisiting the Distortion of Distributed Voting6
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance5
Factorizing Strings into Repetitions4
Preface of the Special Issue Dedicated to Selected Papers from DLT 20224
Observation and Distinction: Representing Information in Infinite Games4
Impartial Selection with Additive Approximation Guarantees4
Restart Strategies in a Continuous Setting3
The Parameterized Complexity of s-Club with Triangle and Seed Constraints3
Maximum Stable Matching with One-Sided Ties of Bounded Length2
Placing Green Bridges Optimally, with a Multivariate Analysis2
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity2
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus2
A One Pass Streaming Algorithm for Finding Euler Tours2
Polynomially Ambiguous Unary Weighted Automata over Fields2
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions2
The Power Word Problem in Graph Products2
Decidability and Periodicity of Low Complexity Tilings1
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning1
Maximizing Rides Served for Dial-a-Ride on the Uniform Metric1
Mechanism Design for Perturbation Stable Combinatorial Auctions1
Exact Multi-Covering Problems with Geometric Sets1
Expansivity and Periodicity in Algebraic Subshifts1
Reachability Problems on Reliable and Lossy Queue Automata1
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words1
Ergodic Theorems and Converses for PSPACE Functions1
Subgroup Membership in GL(2,Z)1
The Complexity of Counting CSPd1
Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs1
Fixed-Parameter Algorithms for Unsplittable Flow Cover1
Risk-Free Bidding in Complement-Free Combinatorial Auctions1
How to Play Old Maid with Virtual Players1
Random Access in Persistent Strings and Segment Selection1
The Complexity of Unavoidable Word Patterns1
Quantum Algorithm for Lexicographically Minimal String Rotation1
How to Hide a Clique?1
Dimension and the Structure of Complexity Classes1
Approximation Algorithms for the MAXSPACE Advertisement Problem1
Exact and Approximate Digraph Bandwidth1
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection1
Complexity Limitations on One-turn Quantum Refereed Games1
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria1
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model1
On Forced Periodicity of Perfect Colorings1
Stable Multi-Level Monotonic Eroders1
On the Decidability of Infix Inclusion Problem1
Equation Satisfiability in Solvable Groups1
0.10958003997803