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.

Representing the integer factorization problem using ordered binary decision diagrams: Label: en
Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams: Label: en
Arithmetical hierarchy of the Besicovitch-stability of noisy tilings: Label: en
Well-covered graphs with constraints on \(\Delta\) and \(\delta\): Label: en
Implicit representation of relations: Label: en
Stability and welfare in (dichotomous) hedonic diversity games: Label: en
Unit read-once refutations for systems of difference constraints: Label: en
Dynamic multiple-message broadcast: bounding throughput in the affectance model: Label: en
Lossy kernelization of same-size clustering: Label: en
Computing a partition function of a generalized pattern-based energy over a semiring: Label: en
On forced periodicity of perfect colorings: Label: en
On the hierarchy of swarm-automaton for the number of agents: Label: en
Random access in persistent strings and segment selection: Label: en
A one pass streaming algorithm for finding Euler tours: Label: en
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs: Label: en
On the partial vertex cover problem in bipartite graphs -- a parameterized perspective: Label: en
Disentangling the computational complexity of network untangling: Label: en
Stability, vertex stability, and unfrozenness for special graph classes: Label: en
Quantum algorithm for lexicographically minimal string rotation: Label: en
Weighted tree automata with constraints: Label: en
Polynomial-time axioms of choice and polynomial-time cardinality: Label: en
Arithmetic circuits, structured matrices and (not so) deep learning: Label: en
Synchronous Boolean finite dynamical systems on directed graphs over XOR functions: Label: en
Effective guessing has unlikely consequences: Label: en
The complexity of grid coloring: Label: en
Ergodic theorems and converses for PSPACE functions: Label: en
Dimension and the structure of complexity classes: Label: en
Subclasses of \textsc{Ptime} interpreted by programming languages: Label: en
Holographic algorithms on domains of general size: Label: en
Foreword: a commemorative issue for Alan L. Selman: Label: en
In memoriam: Alan L. Selman (1941--2021): Label: en
Non-linear ski rental: Label: en
Expansivity and periodicity in algebraic subshifts: Label: en
Correction to: ``Dynamic multiple-message broadcast: bounding throughput in the affectance model: Label: en
Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D: Label: en
The parameterized complexity of \(s\)-club with triangle and seed constraints: Label: en
The space complexity of sum labelling: Label: en
Visit-bounded stack automata: Label: en
The solvability of consensus in iterated models extended with safe-consensus: Label: en
Complexity limitations on one-turn quantum refereed games: Label: en
Local deal-agreement algorithms for load balancing in dynamic general graphs: Label: en
Characterizations and directed path-width of sequence digraphs: Label: en
Polynomially ambiguous unary weighted automata over fields: Label: en
Correction to: ``Submodular functions and rooted trees: Label: en
On embeddability of unit disk graphs onto straight lines: Label: en
On the transformation of LL\((k)\)-linear to LL(1)-linear grammars: Label: en
Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs: Label: en
Preface of the special issue dedicated to selected papers from CSR 2020: Label: en
Special issue on approximation and online algorithms: Label: en
Prediction of infinite words with automata: Label: en