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.

Note on constrained long choice with multiple beginning elements: Label: en
On learning down-sets in quasi-orders, and ideals in Boolean algebras: Label: en
Reordered computable numbers: Label: en
Languages generated by conjunctive query fragments of FC[REG]: Label: en
Automatic abelian complexities of Parikh-collinear fixed points: Label: en
String attractors of some simple-parry automatic sequences: Label: en
Jumping automata over infinite words: Label: en
On the solution sets of three-variable word equations: Label: en
2-balanced sequences coding rectangle exchange transformation: Label: en
Obstructions to return preservation for episturmian morphisms: Label: en
Non-constructive upper bounds for repetition thresholds: Label: en
Approximation algorithms for node and element connectivity augmentation problems: Label: en
Elastic-degenerate string matching with 1 error or mismatch: Label: en
Max-plus algebraic description of evolutions of weighted timed event graphs: Label: en
Lower bounds on the amortized time complexity of shared objects: Label: en
Routing and wavelength assignment algorithm for mesh-based multiple multicasts in optical network-on-chip: Label: en
Pumping lemmas can be ``harmful: Label: en
Placing green bridges optimally, with a multivariate analysis: Label: en
CNF encodings of symmetric functions: Label: en
Cluster editing for multi-layer and temporal graphs: Label: en
What goes around comes around: covering tours and cycle covers with turn costs: Label: en
Optimizing over serial dictatorships: Label: en
Near-optimal auctions on independence systems: Label: en
Revisiting the distortion of distributed voting: Label: en
Prediction and MDL for infinite sequences: Label: en
Upper bounds on communication in terms of approximate rank: Label: en
Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\): Label: en
\(b\)-coloring parameterized by clique-width: Label: en
Good \(r\)-divisions imply optimal amortized decremental biconnectivity: Label: en
Digraph coloring and distance to acyclicity: Label: en
Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete: Label: en
One-tape Turing machine and branching program lower bounds for MCSP: Label: en
The complexity of the distributed constraint satisfaction problem: Label: en
Preface of STACS 2021 special issue: Label: en
Minimum cut in \(O(m \log^2 n)\) time: Label: en
How to hide a clique?: Label: en
Improved bounds for matching in random-order streams: Label: en
Equation satisfiability in solvable groups: Label: en
On the structure of solution-sets to regular word equations: Label: en
Finite sequentiality of finitely ambiguous max-plus tree automata: Label: en
On polynomial recursive sequences: Label: en
International colloquium on automata, languages and programming (ICALP 2020): Label: en
Approximation algorithms for the MAXSPACE advertisement problem: Label: en
Imperative process algebra and models of parallel computation: Label: en
Linear codes correcting repeated bursts equipped with homogeneous distance: Label: en
Rational index of languages defined by grammars with bounded dimension of parse trees: Label: en
Performing regular operations with 1-limited automata: Label: en
The power word problem in graph products: Label: en
Characterization of ordered semigroups generating well quasi-orders of words: Label: en
A closer look at the expressive power of logics based on word equations: Label: en