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 45 results in range #1 to #45.

Near-optimal search time in \(\delta \)-optimal space: Label: en
Space-efficient data structure for next/previous larger/smaller value queries: Label: en
Weighted connected matchings: Label: en
Median and hybrid median \(K\)-dimensional trees: Label: en
Elastic-degenerate string matching with 1 error: Label: en
Cutting a tree with subgraph complementation is hard, except for some small trees: Label: en
On the complexity of half-guarding monotone polygons: Label: en
On vertex guarding staircase polygons: Label: en
On \(r\)-guarding SCOTs -- a new family of orthogonal polygons: Label: en
Local routing algorithms on Euclidean spanners with small diameter: Label: en
Piercing pairwise intersecting convex shapes in the plane: Label: en
Improved parallel algorithms for generalized Baumslag groups: Label: en
Bounds on oblivious multiparty quantum communication complexity: Label: en
MCSP is hard for read-once nondeterministic branching programs: Label: en
On the closures of monotone algebraic classes and variants of the determinant: Label: en
List homomorphism: beyond the known boundaries: Label: en
A general approach to Ammann bars for aperiodic tilings: Label: en
Tree 3-spanners on generalized prisms of graphs: Label: en
Patterns in ordered (random) matchings: Label: en
On the zombie number of various graph classes: Label: en
Min orderings and list homomorphism dichotomies for signed and unsigned graphs: Label: en
A combinatorial link between labelled graphs and increasingly labelled Schröder trees: Label: en
Percolation and epidemic processes in one-dimensional small-world networks (extended abstract): Label: en
On \(\chi \)-diperfect digraphs with stability number two: Label: en
On the zero-sum Ramsey problem over \(\mathbb{Z}_2^d\): Label: en
String attractors and infinite words: Label: en
How many times do you need to go back to the future in unary temporal logic?: Label: en
Embedding arbitrary Boolean circuits into fungal automata: Label: en
The net automaton of a rational expression: Label: en
Conelikes and ranker comparisons: Label: en
Binary completely reachable automata: Label: en
Estimating the clustering coefficient using sample complexity analysis: Label: en
Almost optimal proper learning and testing polynomials: Label: en
Exact learning of multitrees and almost-trees using path queries: Label: en
Multidimensional Manhattan preferences: Label: en
On the subfield codes of a subclass of optimal cyclic codes and their covering structures: Label: en
On APN functions whose graphs are maximal Sidon sets: Label: en
Obtaining approximately optimal and diverse solutions via dispersion: Label: en
Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints: Label: en
Approximations for the Steiner multicycle problem: Label: en
Pathlength of outerplanar graphs: Label: en
Theoretical analysis of git bisect: Label: en
A parameterized approximation algorithm for the multiple allocation \(k\)-hub center: Label: en
Klee's measure problem made oblivious: Label: en
Computing and listing avoidable vertices and paths: Label: en