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.

Simple chain automaton random number generator for IoT devices: Label: en
Constrained polynomial zonotopes: Label: en
On the undecidability and descriptional complexity of synchronized regular expressions: Label: en
Toward a theory of program repair: Label: en
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications: Label: en
\(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes: Label: en
Balancing \(m\)-ary search trees with compressions on the fringe: Label: en
A decision procedure for string constraints with string/integer conversion and flat regular constraints: Label: en
Discovering workflow nets of concurrent iterative processes: Label: en
The second step in characterizing a three-word code: Label: en
On first-order runtime enforcement of branching-time properties: Label: en
Testing membership for timed automata: Label: en
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms: Label: en
On partial information retrieval: the unconstrained 100 prisoner problem: Label: en
Decentralized runtime verification of message sequences in message-based systems: Label: en
Pushdown automata and constant height: decidability and bounds: Label: en
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times: Label: en
Preface: Label: en
Evaluation des performances d'un algorithme de contrôle de la cohérence d'une base de données répartie. (Performance evaluation of a concurrency control for a distributed database): Label: en
Files d'attente exponentielles ayant des paramètres non stationnaires dans le temps (Exponential queues having non-stationary parameters in time): Label: en
Strategy synthesis for multi-dimensional quantitative objectives: Label: en
An efficient simulation algorithm on Kripke structures: Label: en
Negotiation as concurrency primitive: Label: en
Alternating complexity of counting first-order logic for the subword order: Label: en
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs: Label: en
Reactive bisimulation semantics for a process algebra with timeouts: Label: en
Minimum status of trees with a given degree sequence: Label: en
Correction to: ``Reactive synthesis without regret: Label: en
Improved complement for two-way alternating automata: Label: en
Index appearance record with preorders: Label: en
A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model: Label: en
Interface automata for shared memory: Label: en
Recursive descent parsing for Boolean grammars: Label: en
The syntactic monoid of hairpin-free languages: Label: en
Well-structured languages: Label: en
On the equivalence between FDs in XML and FDs in relations: Label: en
Improved matrix pair undecidability results: Label: en
A new explanation of the glitch phenomenon: Label: en
Concurrent bisimulations in Petri nets: Label: en
Sufficient-completeness, ground-reducibility and their complexity: Label: en
A general framework for types in graph rewriting: Label: en
Type-based information flow analysis for the \(\pi\)-calculus: Label: en
safeDpi: a language for controlling mobile code: Label: en
Subtyping for session types in the pi calculus: Label: en
MOMI: a calculus for mobile mixins: Label: en
Genericity and the \(\pi\)-calculus: Label: en
Exponentially decreasing number of operations in balanced trees: Label: en
\(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets: Label: en
Enhanced prefetching and caching strategies for single- and multi-disk systems: Label: en
On-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs: Label: en