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.

On the number of partially abelian square-free words on a three-letter alphabet: Label: en
Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation: Label: en
Networks of Watson-Crick D0L systems with communication by substrings: Label: en
Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience: Label: en
Beyond windability: approximability of the four-vertex model: Label: en
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence: Label: en
\(\mathrm{GF}(2)\)-operations on basic families of formal languages: Label: en
Recognizing geometric intersection graphs stabbed by a line: Label: en
Hardness of (M)LWE with semi-uniform seeds: Label: en
A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes: Label: en
The synchronized ambient calculus: Label: en
Simon's congruence pattern matching: Label: en
Puzzle and dragons is hard: Label: en
Two-stage BP maximization under \(p\)-matroid constraint: Label: en
Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint: Label: en
Preface: special issue on theoretical aspects of computing: Label: en
Efficient code-based fully dynamic group signature scheme: Label: en
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth: Label: en
Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time: Label: en
Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs: Label: en
Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms: Label: en
Offensive alliances in graphs: Label: en
New support 5-designs from lifted linear codes: Label: en
Generalized sweeping line spanners: Label: en
Refined computational complexities of hospitals/residents problem with regional caps: Label: en
The existence and efficiency of PMMS allocations: Label: en
Self-stabilizing indulgent zero-degrading binary consensus: Label: en
Minor embedding in broken chimera and derived graphs is NP-complete: Label: en
Energy complexity of regular languages: Label: en
Convex grid drawings of planar graphs with constant edge-vertex resolution: Label: en
Popular critical matchings in the many-to-many setting: Label: en
A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity: Label: en
The energy complexity of diameter and minimum cut computation in bounded-genus networks: Label: en
Distributed half-integral matching and beyond: Label: en
From multivalued to Boolean functions: preservation of soft nested canalization: Label: en
Selfish bin packing with punishment: Label: en
Filling crosswords is very hard: Label: en
Bipartite instances of INFLUENCE: Label: en
On ordering of \(\beta\)-description trees: Label: en
Almost disjoint paths and separating by forbidden pairs: Label: en
Revisiting maximum satisfiability and related problems in data streams: Label: en
Algorithms and hardness results for edge total domination problem in graphs: Label: en
Elastic founder graphs improved and enhanced: Label: en
Gradient complexity and non-stationary views of differentially private empirical risk minimization: Label: en
Relating \(g\)-good-neighbor connectivity and \(g\)-good-neighbor diagnosability of strong digraph network: Label: en
Designing aperture \(2^{2k}\) hexagonal grids and their indexing as factor rings of Eisenstein integers: Label: en
The computational complexity of Holant problems on 3-regular graphs: Label: en
Space efficient algorithm for solving reachability using tree decomposition and separators: Label: en
Quantum algorithms for learning hidden strings with applications to matroid problems: Label: en
Reconstructing parameterized strings from parameterized suffix and LCP arrays: Label: en