Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Computational Complexity of Smooth Differential Equations: Label: en
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments: Label: en
Probabilistic Automata and Probabilistic Logic: Label: en
On Two Stronger Versions of Dejean’s Conjecture: Label: en
Computing Lempel-Ziv Factorization Online: Label: en
Computational Aspects of Cellular Automata on Countable Sofic Shifts: Label: en
Regularity Problems for Weak Pushdown ω-Automata and Games: Label: en
Constructing Premaximal Ternary Square-Free Words of Any Level: Label: en
A Finite Basis for ‘Almost Future’ Temporal Logic over the Reals: Label: en
Reducing a Target Interval to a Few Exact Queries: Label: en
Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?: Label: en
Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games: Label: en
Taking It to the Limit: Approximate Reasoning for Markov Processes: Label: en
Fine and Wilf’s Theorem and Pseudo-repetitions: Label: en
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs: Label: en
Descriptional Complexity of Deterministic Regular Expressions: Label: en
Weakly-Synchronized Ground Tree Rewriting: Label: en
Equations X + A = B and (X + X) + C = (X − X) + D over Sets of Natural Numbers: Label: en
The Join Levels of the Trotter-Weil Hierarchy Are Decidable: Label: en
The Lower Reaches of Circuit Uniformity: Label: en
Strictness of the Collapsible Pushdown Hierarchy: Label: en
Reversal Hierarchies for Small 2DFAs: Label: en
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection: Label: en
An Improved Approximation Scheme for Variable-Sized Bin Packing: Label: en
Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles: Label: en
Categories of Coalgebraic Games: Label: en
Kernels for Edge Dominating Set: Simpler or Smaller: Label: en
Planarizing Gadgets for Perfect Matching Do Not Exist: Label: en
Light Spanners in Bounded Pathwidth Graphs: Label: en
Obtaining Planarity by Contracting Few Edges: Label: en
Coloring Graphs Characterized by a Forbidden Subgraph: Label: en
Strategy Machines and Their Complexity: Label: en
When Trees Grow Low: Shrubs and Fast MSO1: Label: en
Observe and Remain Silent (Communication-Less Agent Location Discovery): Label: en
Online Sum-Radii Clustering: Label: en
A Characterization of Bispecial Sturmian Words: Label: en
Fast Balanced Partitioning Is Hard Even on Grids and Trees: Label: en
On the Impact of Fair Best Response Dynamics: Label: en
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width: Label: en
Zero-Knowledge Proofs via Polynomial Representations: Label: en
Finite State Transducers for Modular Möbius Number Systems: Label: en
A Dichotomy Theorem for Homomorphism Polynomials: Label: en
Sitting Closer to Friends Than Enemies, Revisited: Label: en
Parameterized Study of the Test Cover Problem: Label: en
Model Checking Stochastic Branching Processes: Label: en
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses: Label: en
Computing with Large Populations Using Interactions: Label: en
The Complexity of Rerouting Shortest Paths: Label: en
Abelian Pattern Avoidance in Partial Words: Label: en
New Advances in Reoptimizing the Minimum Steiner Tree Problem: Label: en