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.

Solving polynomial fixed point equations: Label: en
E-complete sets do not have optimal polynomial time approximations: Label: en
On NC-real complexity classes for additive circuits and their relations with NC: Label: en
Models, languages, and compiler technology for high performance computers: Label: en
The finest homophonic partition and related code concepts: Label: en
Full abstraction for the second order subset of an ALGOL-like language: Label: en
Shorter queues for permutation routing on meshes: Label: en
Complexity of EOL structural equivalence: Label: en
Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable: Label: en
Read-write causality: Label: en
Critical pairs in term graph rewriting: Label: en
How a rainbow coloring function can simulate wait-free handshaking: Label: en
A completeness theorem for nondeterministic Kleene algebras: Label: en
Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach: Label: en
On the complexity of constructing optimal ordered binary decision diagrams: Label: en
On the minimization problem for ω-automata: Label: en
Empty alternation: Label: en
A comparison of finite and cellular automata: Label: en
The relationship between gossiping in vertex-disjoint paths mode and bisection width: Label: en
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems: Label: en
On a sublinear time parallel construction of optimal binary search trees: Label: en
On the size of independent systems of equations in semigroups: Label: en
Rational rewriting: Label: en
Two lower bounds on distributive generation of languages: Label: en
MSO definable text languages: Label: en
Degrees and reducibilities of easy tally sets: Label: en
Combinatorial results on the complexity of teaching and learning: Label: en
Passive and active rules in deductive databases: Label: en
A fully abstract semantics for termination in Petri nets: Label: en
The combinatorial complexity of a finite string: Label: en
Processes and hyperuniverses: Label: en
A π-calculus with explicit substitutions: The late semantics: Label: en
Efficient solving of the word equations in one variable: Label: en
A comparison of two lower bound methods for communication complexity: Label: en
On parallel complexity of maximum f-matching and the degree sequence problem: Label: en
Reliable minimum finding comparator networks: Label: en
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams: Label: en
Decision problems for edge grammars: Label: en
Inductive counting below logspace: Label: en
Embedding complete binary trees into star networks: Label: en
A proof system for asynchronously communicating deterministic processes: Label: en
On languages accepted with simultaneous complexity bounds and their ranking problem: Label: en
Analysis of bounded disorder: Label: en
Genericity and measure for exponential time: Label: en
May and must convergency in concurrent λ-calculus: Label: en
A Competitive analysis of the list update problem with lookahead: Label: en
Stable bistructure models of PCF: Label: en
On-line scheduling of parallel jobs: Label: en
Longest common subsequences: Label: en
Algebraic methods in the compositional analysis of logic programs: Label: en