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.

Linear programming — Randomization and abstract frameworks: Label: en
Optimal schedules for d-D grid graphs with communication delays: Label: en
Some bounds on multiparty communication complexity of pointer jumping: Label: en
Upper bounds on multiparty communication complexity of shifts: Label: en
The “log rank” conjecture for modular communication complexity: Label: en
Hypothesis testing in perfect phylogeny for a bounded number of characters: Label: en
On competitive on-line paging with lookahead: Label: en
Ranking and unranking trees using regular reductions: Label: en
Universal hashing and k-wise independent random variables via integer arithmetic without primes: Label: en
Minimal forbidden words and symbolic dynamics: Label: en
On the successor function in non-classical numeration systems: Label: en
Lower bounds for compact routing: Label: en
Flip-flop nets: Label: en
“Optimal” collecting semantics for analysis in a hierarchy of logic program semantics: Label: en
Read-once projections and formal circuit verification with binary decision diagrams: Label: en
On the expressivity of the modal mu-calculus: Label: en
A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume: Label: en
Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width: Label: en
A combinatorial design approach to MAXCUT: Label: en
The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs: Label: en
On bijections vs. unary functions: Label: en
Monadic second order logic on tree-like structures: Label: en
A unified and generalized treatment of authentication theory: Label: en
The action of a few random permutations on r-tuples and an application to cryptography: Label: en
Optimal tree-based one-time digital signature schemes: Label: en
Compositional specification of timed systems: Label: en
Fine separation of average time complexity classes: Label: en
Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness: Label: en
On the existence of hard sparse sets under weak reductions: Label: en
On the complexity of worst case and expected time in a circuit: Label: en
A decision procedure for well-formed linear quantum cellular automata: Label: en
Trace rewriting: Computing normal forms in time O(n log n): Label: en
On the power of non-observable actions in timed automata: Label: en
General inductive inference types based on linearly-ordered sets: Label: en
PAC learning with simple examples: Label: en
Extracting best consensus motifs from positive and negative examples: Label: en
Learning with confidence: Label: en
On word-level parallelism in fault-tolerant computing: Label: en
Fault-tolerant shared memory simulations: Label: en
Parallel comparability graph recognition and modular decomposition: Label: en
Embedding graphs with bounded treewidth into optimal hypercubes: Label: en
Lyndon factorization of infinite words: Label: en
An aperiodic set of Wang cubes: Label: en
Star-height of an N-rational series: Label: en
Languages recognized by finite aperiodic groupoids: Label: en
Solvable black-box group problems are low for PP: Label: en
Observations on measure and lowness for Δ 2 P: Label: en
The complexity of generating and checking proofs of membership: Label: en
Resource-bounded balanced genericity, stochasticity and weak randomness: Label: en
Cyclic languages and strongly cyclic languages: Label: en