Theory of Computing Systems

Article	Citations
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance	13
Observation and Distinction: Representing Information in Infinite Games	11
Strategic Candidacy Equilibria for Common Voting Rules	8
The Parameterized Complexity of s-Club with Triangle and Seed Constraints	8
Complexity Limitations on One-turn Quantum Refereed Games	7
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs	6
Beyond the Existential Theory of the Reals	6
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete	4
New Results on the Remote Set Problem and Its Applications in Complexity Study	4
On the Transformation of LL(k)-linear to LL(1)-linear Grammars	4
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings	4
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020	3
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)	3
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams	3
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees	3
Label Ranking Through Nonparametric Regression	2
A Local Search Algorithm for the Radius-Constrained k-Median Problem	2
Space-Efficient B Trees via Load-Balancing	2
Rudin-Shapiro Sums Via Automata Theory and Logic	2
Submodular Functions and Rooted Trees	2
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity	2
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes	2
Non-Existence of Stable Social Groups in Information-Driven Networks	2
Control Structures in Computable Numberings and the Completion Operator	2
Correction to: How to Play Old Maid with Virtual Players	1

International Colloquium on Automata, Languages and Programming (ICALP 2020)	1
Ergodic Theorems and Converses for PSPACE Functions	1
How to Play Old Maid with Virtual Players	1
Preface of STACS 2021 Special Issue	1
On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers	1
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning	1
One-Sided Markets with Externalities	1
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus	1
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms	1
Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs	1
String Attractors of Some Simple-Parry Automatic Sequences	1
The Power Word Problem in Graph Products	1
Jumping Automata over Infinite Words	1
The Complexity of Unavoidable Word Patterns	1
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022	1
On the Solution Sets of Three-Variable Word Equations	1
Approximation Algorithms for the MAXSPACE Advertisement Problem	1
CNF Encodings of Symmetric Functions	1
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line	1
Placing Green Bridges Optimally, with a Multivariate Analysis	1
Correction to: Farkas Bounds on Horn Constraint Systems	1
Decision Problems Concerning L Systems	1
Approximation algorithms for node and element connectivity augmentation problems	1
Gathering on Rings for Myopic Asynchronous Robots with Lights	1
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions	1
Longest Common Subsequence with Gap Constraints	1
Maximum Stable Matching with One-Sided Ties of Bounded Length	1
Cluster Editing for Multi-Layer and Temporal Graphs	1
Greedy Minimum-Energy Scheduling	1
Quantum Algorithm for Lexicographically Minimal String Rotation	1
Preface of STACS 2020 Special Issue	1
Improved Methods to Solve Nonlinear Invariants with Low Algebraic Degree for Linear Transformation	1
Online Matching with Delays and Stochastic Arrival Times	1
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems	1
The Complexity of the Distributed Constraint Satisfaction Problem	1
b-Coloring Parameterized by Clique-Width	1
Unit Read-once Refutations for Systems of Difference Constraints	0
Online Unbounded Knapsack	0
Dimension and the Structure of Complexity Classes	0
Implicit Representation of Relations	0
The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs	0
Well-Covered Graphs With Constraints On $$\Delta $$ And $$\delta $$	0
Equation Satisfiability in Solvable Groups	0
Digraph Coloring and Distance to Acyclicity	0
Imperative Process Algebra and Models of Parallel Computation	0
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization	0
A One Pass Streaming Algorithm for Finding Euler Tours	0
Pumping Lemmas Can be “Harmful”	0
Target Set Selection Parameterized by Vertex Cover and More	0
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model	0

Computing a Partition Function of a Generalized Pattern-Based Energy over a Semiring	0
Automatic Abelian Complexities of Parikh-Collinear Fixed Points	0
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences	0
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality	0
Bit Catastrophes for the Burrows-Wheeler Transform	0
Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs	0
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective	0
Risk-Free Bidding in Complement-Free Combinatorial Auctions	0
Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D	0
On the Parameterized Complexity of the Expected Coverage Problem	0
Maximizing Rides Served for Dial-a-Ride on the Uniform Metric	0
Performing Regular Operations with 1-Limited Automata	0
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection	0
Random Access in Persistent Strings and Segment Selection	0
Special issue on algorithmic game theory (SAGT 2019)	0
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion	0
Near-Optimal Auctions on Independence Systems	0
Non-Constructive Upper Bounds for Repetition Thresholds	0
On learning down-sets in quasi-orders, and ideals in Boolean algebras	0
Obvious Strategyproofness, Bounded Rationality and Approximation	0
Effective Guessing Has Unlikely Consequences	0
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs	0
What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs	0
Subgroup Membership in GL(2,Z)	0
Stability and Welfare in (Dichotomous) Hedonic Diversity Games	0
Disentangling the Computational Complexity of Network Untangling	0
A Unifying Approximate Potential for Weighted Congestion Games	0
A Framework for Memory Efficient Context-Sensitive Program Analysis	0
(Worst-case) Optimal Adaptive Dynamic Bitvectors	0
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP	0
Improved Bounds for Matching in Random-Order Streams	0
Elastic-Degenerate String Matching with 1 Error or Mismatch	0
Subclasses of Ptime Interpreted by Programming Languages	0
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs	0
A Closer Look at the Expressive Power of Logics Based on Word Equations	0
On the Hierarchy of Swarm-automaton for the Number of Agents	0
Characterizations and Directed Path-Width of Sequence Digraphs	0
Lossy Kernelization of Same-Size Clustering	0
2-Balanced Sequences Coding Rectangle Exchange Transformation	0
Multistage Vertex Cover	0
Routing and Wavelength Assignment Algorithm for Mesh-based Multiple Multicasts in Optical Network-on-chip	0
Expansivity and Periodicity in Algebraic Subshifts	0
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions	0
An Automaton Group with PSPACE-Complete Word Problem	0
Mechanism Design for Perturbation Stable Combinatorial Auctions	0
An Optimal and Practical Algorithm for the Planar 2-center Problem	0
Factorizing Strings into Repetitions	0
Exact and Approximate Digraph Bandwidth	0
Revisiting the Distortion of Distributed Voting	0
Minimum Cut in $$O(m\log ^2 n)$$ Time	0
How to Hide a Clique?	0
Prediction and MDL for infinite sequences	0
Total Completion Time Scheduling Under Scenarios	0
The Reflection Complexity of Sequences Over Finite Alphabets	0
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters	0
Upper Bounds on Communication in Terms of Approximate Rank	0
Scheduling with Speed Predictions	0
High Multiplicity Strip Packing with Three Rectangle Types	0
Visit-Bounded Stack Automata	0
On the Decision Tree Complexity of Threshold Functions	0
Impartial Selection with Additive Approximation Guarantees	0
Correction to: Submodular Functions and Rooted Trees	0
Correction to: On the Transformation of LL(k)-linear to LL(1)-linear Grammars	0
On Non-principal Arithmetical Numberings and Families	0
On Forced Periodicity of Perfect Colorings	0
Holographic Algorithms on Domains of General Size	0
Can Local Optimality Be Used for Efficient Data Reduction?	0
Graph Square Roots of Small Distance from Degree One Graphs	0
Computing Colourful Simplicial Depth and Median in ℝ2	0
Non-Linear Ski Rental	0
Languages Generated by Conjunctive Query Fragments of FC[REG]	0
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams	0
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs	0
2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs	0
The Space Complexity of Sum Labelling	0
Note on Constrained Long Choice with Multiple Beginning Elements	0
Foreword: a Commemorative Issue for Alan L. Selman	0
Weighted Tree Automata with Constraints	0
On Embeddability of Unit Disk Graphs Onto Straight Lines	0
Farkas Bounds on Horn Constraint Systems	0

Obstructions to Return Preservation for Episturmian Morphisms	0
Polynomially Ambiguous Unary Weighted Automata over Fields	0
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words	0
Lower Bounds on the Amortized Time Complexity of Shared Objects	0
The Complexity of Grid Coloring	0
Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs	0
Second-Order Finite Automata	0
Reordered Computable Numbers	0
On the Decidability of Infix Inclusion Problem	0
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model	0
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria	0
Nonuniform Reductions and NP-Completeness	0
Optimizing Over Serial Dictatorships	0
Toward Online Mobile Facility Location on General Metrics	0
Normality, Relativization, and Randomness	0