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

A new approach for routing in arrangement graphs and its performance evaluation: Label: en
A temporal logic for real-time partial-ordering with named transactions: Label: en
Simulations between cellular automata on cayley graphs: Label: en
A rewrite approach for constraint logic programming: Label: en
On using learning automata for fast graph partitioning: Label: en
On monotonous oracle machines: Label: en
Lower bounds for the modular communication complexity of various graph accessibility problems: Label: en
Multiple alignment of biological sequences with gap flexibility: Label: en
Cyclic automata networks on finite graphs: Label: en
Non-erasing turing machines: A new frontier between a decidable halting problem and universality: Label: en
Multihead two-way probabilistic finite automata: Label: en
Pushdown automata with bounded nondeterminism and bounded ambiguity: Label: en
State complexity of SBTA languages: Label: en
On the complexity of computing the greatest common divisor of several univariate polynomials: Label: en
Unbounded search and recursive graph problems: Label: en
On the approximability of some maximum spanning tree problems: Label: en
On edge-colouring indifference graphs: Label: en
Paging more than one page: Label: en
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs: Label: en
Nearest neighbour graph realizability is NP-hard: Label: en
Reversible cellular automaton able to simulate any other reversible one using partitioning automata: Label: en
On linear-time alphabet-independent 2-dimensional pattern matching: Label: en
(Probabilistic) recurrence relations revisited: Label: en
Logic of plotkin continuous domain: Label: en
On weak growing context-sensitive grammars: Label: en
Recognizable sets of numbers in nonstandard bases: Label: en
Off-line electronic cash based on secret-key certificates: Label: en
Lower bounds for the matrix chain ordering problem: Label: en
Free shuffle algebras in language varieties extended abstract: Label: en
On dynamical properties of generalized toggle automata: Label: en
On the relation between BDDs and FDDs: Label: en
Lower bounds for modular counting by circuits with modular gates: Label: en
Tight bounds for finding degrees from the adjacency matrix: Label: en
Space filling curves and their use in the design of geometric data structures: Label: en
Random generation of colored trees: Label: en
Visibility graphs of 2-spiral polygons (Extended abstract): Label: en
Solution of a problem of yekutieli and mandelbrot: Label: en