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.

Free products of semigroups and monoids with a deterministic context-free word problem: Label: en
Covering segments on a line with drones: Label: en
An improved uniform convergence bound with fat-shattering dimension: Label: en
Airports and railways with unsplittable demand: Label: en
Reducing the space used by the sieve of Eratosthenes when factoring: Label: en
An improved spectral lower bound of treewidth: Label: en
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method: Label: en
Effective data reduction for strongly stable matching in very sparse graphs: Label: en
Counter abstraction for regular open teams: Label: en
A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths: Label: en
Luby's MIS algorithms made self-stabilizing: Label: en
Algorithms for subgraph complementation to some classes of graphs: Label: en
4/3 rectangle tiling lower bound: Label: en
Robust probabilistic temporal logics: Label: en
On conflict-free cuts: algorithms and complexity: Label: en
Improved lower bound for differentially private facility location: Label: en
Lower and upper bounds on graph communicabilities: Label: en
Is this network proper forest-based?: Label: en
Top-down complementation of automata on finite trees: Label: en
Dispersion problem on a convex polygon: Label: en
Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations: Label: en
Algorithmic aspects of \(\{P_k\}\)-isolation in graphs and extremal graphs for a \(\{P_3\}\)-isolation bound: Label: en
Defying gravity and gadget numerosity: the complexity of the Hanano puzzle and beyond: Label: en
Weighted fair division of indivisible items: a review: Label: en
Hamiltonian cycles of balanced hypercube with disjoint faulty edges: Label: en
Improving compressed matrix multiplication using control variate method: Label: en
Leveraging parameterized Chernoff bounds for simplified algorithm analyses: Label: en
A note on the \(k\)-restriction problem: Label: en
Reduced meet over labelling-based semantics in abstract argumentation: Label: en
Spanners under the Hausdorff and Fréchet distances: Label: en
Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees: Label: en
Correcting matrix products over the ring of integers: Label: en
A linear-time algorithm for the center problem in weighted cycle graphs: Label: en
The autocorrelation of a class of quaternary sequences of length \(pq\) with high complexity: Label: en
Smaller kernels for two vertex deletion problems: Label: en
Branching bisimulation semantics for quantum processes: Label: en
Long directed detours: reduction to 2-disjoint paths: Label: en
Sparsifying count sketch: Label: en
Regular resolution effectively simulates resolution: Label: en
Prenex universal first-order safety properties: Label: en
Learning-augmented maximum flow: Label: en
Tight inapproximability of Nash equilibria in public goods games: Label: en
Red blue set cover problem on axis-parallel hyperplanes and other objects: Label: en
The group factorization problem in finite groups of Lie type: Label: en
Recognizing LBFS trees of bipartite graphs: Label: en
On size-independent sample complexity of ReLU networks: Label: en
Skolem and positivity completeness of ergodic Markov chains: Label: en
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities: Label: en
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine: Label: en
Splitting NP-complete sets infinitely: Label: en