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

The Number of Crossing Free Configurations on Finite Point Sets in the Plane: Label: en
Approximation Algorithms for 2-Stage Stochastic Optimization Problems: Label: en
Game Semantics for Higher-Order Concurrency: Label: en
Validity Checking for Finite Automata over Linear Arithmetic Constraints: Label: en
Branching Pushdown Tree Automata: Label: en
Safely Freezing LTL: Label: en
On Continuous Timed Automata with Input-Determined Guards: Label: en
Expressivity Properties of Boolean BI Through Relational Models: Label: en
Almost Optimal Strategies in One Clock Priced Timed Games: Label: en
The Meaning of Ordered SOS: Label: en
Distributed Synthesis for Well-Connected Architectures: Label: en
On Reduction Criteria for Probabilistic Reward Models: Label: en
Context-Sensitive Dependency Pairs: Label: en
Tree Automata Make Ordinal Theory Easy: Label: en
A Proof System for the Linear Time μ-Calculus: Label: en
Monitoring of Real-Time Properties: Label: en
On Decidability of LTL Model Checking for Process Rewrite Systems: Label: en
Testing Probabilistic Equivalence Through Reinforcement Learning: Label: en
The Anatomy of Innocence Revisited: Label: en
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games: Label: en
Unbiased Rounding of Rational Matrices: Label: en
Some Results on Average-Case Hardness Within the Polynomial Hierarchy: Label: en
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions: Label: en
Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species: Label: en
Solving Connected Dominating Set Faster Than 2 n: Label: en
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems: Label: en
Zero Error List-Decoding Capacity of the q/(q–1) Channel: Label: en
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance: Label: en
On Obtaining Pseudorandomness from Error-Correcting Codes: Label: en
Computing a Center-Transversal Line: Label: en
Multi-stack Boundary Labeling Problems: Label: en
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs: Label: en
One-Input-Face MPCVP Is Hard for L, But in LogDCFL: Label: en
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time: Label: en
Coresets for Discrete Integration and Clustering: Label: en
Normal and Feature Approximations from Noisy Point Clouds: Label: en