The following pages link to Mathematics Subject Classification ID (P226):
Displaying 50 items.
- 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)
- An efficient algorithm for computing least cost paths with turn constraints (Q293389) (← links)
- Comment on ``Efficient Huffman decoding'' and ``An efficient finite-state machine implementation of Huffman decoders'' (Q293392) (← links)
- An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394) (← links)
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- VLSI layouts of complete graphs and star graphs (Q293402) (← links)
- A non-SOS operational semantics for a process algebra (Q293405) (← links)
- Some remarks on the Kronecker product of graphs (Q293407) (← links)
- A linear-time transformation of linear inequalities into conjunctive normal form (Q293409) (← links)
- Efficient algorithms for the temporal precedence problem (Q293412) (← links)
- Parallel dictionaries with local rules on AVL and brother trees (Q293415) (← links)
- A limitation of vector timestamps for reconstructing distributed computations (Q293417) (← links)
- Pseudo-average block sensitivity equals average sensitivity (Q293418) (← links)
- Efficient dynamic range searching using data replication (Q293421) (← links)
- Robust vector space secret sharing schemes (Q293422) (← links)
- On the loopless generation of binary tree sequences (Q293424) (← links)
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) (Q293426) (← links)
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- A complete axiomatization of full acyclic join dependencies (Q293431) (← links)
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs (Q293435) (← links)
- Complexity versus stability for classes of propositional formulas (Q293437) (← links)
