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-02-01 to 2025-02-01.)
ArticleCitations
A One Pass Streaming Algorithm for Finding Euler Tours11
Observation and Distinction: Representing Information in Infinite Games8
Maximum Stable Matching with One-Sided Ties of Bounded Length7
Restart Strategies in a Continuous Setting6
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions6
Foreword: a Commemorative Issue for Alan L. Selman6
On the Hierarchy of Swarm-automaton for the Number of Agents6
Factorizing Strings into Repetitions5
On Triangle Estimation Using Tripartite Independent Set Queries5
The Parameterized Complexity of s-Club with Triangle and Seed Constraints4
The Power Word Problem in Graph Products4
Revisiting the Distortion of Distributed Voting4
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus4
Placing Green Bridges Optimally, with a Multivariate Analysis4
Polynomially Ambiguous Unary Weighted Automata over Fields4
Obstructions to Return Preservation for Episturmian Morphisms3
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance3
Impartial Selection with Additive Approximation Guarantees3
Typical Sequences Revisited — Computing Width Parameters of Graphs2
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria2
Exact Multi-Covering Problems with Geometric Sets2
One-Sided Markets with Externalities2
How to Hide a Clique?2
Reachability Problems on Reliable and Lossy Queue Automata2
Preface of the Special Issue Dedicated to Selected Papers from DLT 20222
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity2
Decidability and Periodicity of Low Complexity Tilings2
The Complexity of Counting CSPd1
On the Decidability of Infix Inclusion Problem1
Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs1
In Memoriam - Alan Selman (1941 - 2021)1
Approximation Algorithms for the MAXSPACE Advertisement Problem1
Expansivity and Periodicity in Algebraic Subshifts1
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection1
Equation Satisfiability in Solvable Groups1
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters1
The Complexity of Unavoidable Word Patterns1
Dimension and the Structure of Complexity Classes1
Random Access in Persistent Strings and Segment Selection1
Ergodic Theorems and Converses for PSPACE Functions1
On Forced Periodicity of Perfect Colorings1
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words1
Complexity Limitations on One-turn Quantum Refereed Games1
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms1
Obvious Strategyproofness, Bounded Rationality and Approximation1
Exact and Approximate Digraph Bandwidth1
Quantum Algorithm for Lexicographically Minimal String Rotation1
Stable Multi-Level Monotonic Eroders1
Maximizing Rides Served for Dial-a-Ride on the Uniform Metric1
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning1
Mechanism Design for Perturbation Stable Combinatorial Auctions1
Fixed-Parameter Algorithms for Unsplittable Flow Cover1
Risk-Free Bidding in Complement-Free Combinatorial Auctions1
Subgroup Membership in GL(2,Z)1
Radio k-chromatic Number of Full m-ary Trees1
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model1
0.22805190086365