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

Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages: Label: en
Shortest Unique Substrings Queries in Optimal Time: Label: en
A New Plane-Sweep Algorithm for the K-Closest-Pairs Query: Label: en
Unary NFAs with Limited Nondeterminism: Label: en
Ordered Restarting Automata for Picture Languages: Label: en
Parameterized Prefix Distance between Regular Languages: Label: en
An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent Agents: Label: en
Probabilistic Admissible Encoding on Elliptic Curves - Towards PACE with Generalized Integrated Mapping: Label: en
Deterministic Verification of Integer Matrix Multiplication in Quadratic Time: Label: en
Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints: Label: en
A Stronger Square Conjecture on Binary Words: Label: en
A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing: Label: en
Finding Disjoint Paths in Split Graphs: Label: en
Attack against a Pairing Based Anonymous Authentication Protocol: Label: en
Bidimensionality of Geometric Intersection Graphs: Label: en
Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes: Label: en
Efficient Error-Correcting Codes for Sliding Windows: Label: en
Active Learning of Recursive Functions by Ultrametric Algorithms: Label: en
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms: Label: en
Graph Clustering with Surprise: Complexity and Exact Solutions: Label: en
Exact Algorithms to Clique-Colour Graphs: Label: en
Error-Pruning in Interface Automata: Label: en
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs: Label: en
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem: Label: en
Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem: Label: en
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth: Label: en
Fitting Planar Graphs on Planar Maps: Label: en
Matching of Images of Non-planar Objects with View Synthesis: Label: en
Advice Complexity: Quantitative Approach to A-Priori Information: Label: en
Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems: Label: en