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

Speeding up two string-matching algorithms: Label: en
In-place linear probing sort: Label: en
A combinatorial bound for linear programming and related problems: Label: en
Conditional semi-Thue systems for presenting monoids: Label: en
On the factorization conjecture: Label: en
Iterative devices generating infinite words: Label: en
Compression and entropy: Label: en
Synthesis for testability: Binary Decision Diagrams: Label: en
Performance driven k-layer wiring: Label: en
Enclosing many boxes by an optimal pair of boxes: Label: en
Four results on randomized incremental constructions: Label: en
Communication efficient Zero-knowledge Proofs of knowledge: Label: en
Secure commitment against a powerful adversary: Label: en
On locally optimal alignments in genetic sequences: Label: en
A simple linear time algorithm for triangulating three-colored graphs: Label: en
Graph isomorphism is low for PP: Label: en
The complexity of colouring circle graphs: Label: en
On the approximability of the maximum common subgraph problem: Label: en
Interval approximations of message causality in distributed executions: Label: en
Broadcasting in butterfly and debruijn networks: Label: en
Unconditional Byzantine agreement for any number of faulty processors: Label: en
New time hierarchy results for deterministic TMS: Label: en
On complexity classes and algorithmically random languages: Label: en
Characterizations of some complexity classes between Θ2p and Δ2p: Label: en
A nonlinear lower bound on the practical combinational complexity: Label: en
Separating counting communication complexity classes: Label: en
The log-star revolution: Label: en
Language learning without overgeneralization: Label: en
Linear approximation of simple objects: Label: en
A plane-sweep algorithm for finding a closest pair among convex planar objects: Label: en
The theory of the polynomial many-one degrees of recursive sets is undecidable: Label: en
Locally definable acceptance types for polynomial time machines: Label: en
The extended low hierarchy is an infinite hierarchy: Label: en
Deterministic regular languages: Label: en
Equality and disequality constraints on direct subterms in tree automata: Label: en
A competitive analysis of nearest neighbor based algorithms for searching unknown scenes: Label: en
A simplified technique for hidden-line elimination in terrains: Label: en
Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition: Label: en
Efficient algorithms for solving systems of linear equations and path problems: Label: en
On the performance of networks with multiple busses: Label: en
Joining k- and l-recognizable sets of natural numbers: Label: en
Axiomatizations of backtracking: Label: en
Suitability of the propositional temporal logic to express properties of real-time systems: Label: en
Fast and optimal simulations between CRCW PRAMs: Label: en
A theory of strict P-completeness: Label: en
The parallel complexity of tree embedding problems (extended abstract): Label: en
Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives: Label: en