The following pages link to Recommender Run (P1660):
Displaying 50 items.
- The latency-of-data-access model for analyzing parallel computation (Q293286) (← links)
- An inheritance flow model for class hierarchy analysis (Q293289) (← links)
- A homophonic DES (Q293290) (← links)
- Strongly sequential and inductively sequential term rewriting systems (Q293294) (← links)
- Uniform multipaging reduces to paging (Q293296) (← links)
- Successful visual human-computer interaction is undecidable (Q293299) (← links)
- A data-parallel algorithm for minimum-width tree layout (Q293301) (← links)
- A variation on the zero-one law (Q293304) (← links)
- The homogeneous set sandwich problem (Q293307) (← links)
- Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← links)
- Extending reduction orderings to ACU-compatible reduction orderings (Q293311) (← links)
- Finding the detour-critical edge of a shortest path between two nodes (Q293313) (← links)
- Improved algorithms for group testing with inhibitors (Q293316) (← links)
- On fixed priority scheduling, offsets and co-prime task periods (Q293317) (← links)
- Coloring random graphs (Q293318) (← links)
- Learning nearly monotone \(k\)-term DNF (Q293322) (← links)
- On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330) (← links)
- Automata and forbidden words (Q293331) (← links)
- An approximation algorithm for the maximum traveling salesman problem (Q293334) (← links)
- Randomized group testing for mutually obscuring defectives (Q293335) (← links)
- Optimal alphabetic trees for binary search (Q293336) (← links)
- An optimal parallel algorithm for sorting multisets (Q293338) (← links)
- Weakest preconditions for pure Prolog programs (Q293340) (← links)
- On the time complexity of minimum and maximum global snapshot problems (Q293343) (← links)
- Finding shortest paths in distributed loop networks (Q293346) (← links)
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Pair algebras and Galois connections. (Q293350) (← links)
- Self-organizing maps for drawing large graphs (Q293353) (← links)
- An improvement of algorithms for solving interface equations (Q293354) (← links)
- A quorum based \(k\)-mutual exclusion by weighted \(k\)-quorum systems (Q293356) (← links)
- Embeddings and the trace of finite sets (Q293357) (← links)
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- On the complexity of Boolean unification (Q293360) (← links)
- On syntactic nuclei of rational languages (Q293361) (← links)
- Breaking symmetry in complete graphs by orienting edges: asymptotic bounds (Q293364) (← links)
- On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
- A note on minimizing submodular functions (Q293366) (← links)
- Root-neededness and approximations of neededness (Q293367) (← links)
- An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs (Q293369) (← links)
- An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
- Improved approximation algorithms for embedding hyperedges in a cycle (Q293373) (← links)
- A special arrangement with minimal number of triangles (Q293374) (← links)
- An extension of the wreath product principle for finite Mazurkiewicz traces (Q293379) (← links)
- An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380) (← links)
- Online channel allocation in FDMA networks with reuse constraints (Q293383) (← links)
- Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (Q293385) (← links)
- Random permutations on distributed, external and hierarchical memory (Q293386) (← links)
