The following pages link to (Q4195901):
Displaying 41 items.
- Computing Hough transforms on hypercube multicomputers (Q547488) (← links)
- On the complexity of partitioning sparse matrix representations (Q786530) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube (Q917300) (← links)
- Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search (Q921925) (← links)
- On the entropy production of time series with unidirectional linearity (Q963315) (← links)
- Dynamic cycle detection (Q1055194) (← links)
- On the average internal path length of m-ary search trees (Q1060015) (← links)
- An applicative random-access stack (Q1062446) (← links)
- On growing random binary trees (Q1076401) (← links)
- Implementation techniques for the vehicle routing problem (Q1086140) (← links)
- A general backtrack algorithm for the isomorphism problem of combinatorial objects (Q1087556) (← links)
- Eliminating the flag in threaded binary search trees (Q1092666) (← links)
- Effect of data organization in a system of interleaved memories on the performance of parallel search (Q1092668) (← links)
- The location of central structures in trees (Q1097827) (← links)
- Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree (Q1099627) (← links)
- An adaptive local mesh refinement method for time-dependent partial differential equations (Q1122346) (← links)
- GBSSS: The generalized big square small square method for planar single- facility location (Q1196029) (← links)
- Pattern associativity and the retrieval of semantic networks (Q1202672) (← links)
- Locating an absolute center on graphs that are almost trees (Q1263510) (← links)
- Optimal task assignment with precedence in distributed computing systems (Q1328541) (← links)
- Linear-time optimal augmentation for componentwise bipartite-completeness of graphs (Q1349750) (← links)
- On the complexity of entailment in propositional multivalued logics (Q1380415) (← links)
- Page-queries as a tool for organizing secondary memory auxiliary databases. II: Optimal selection of SADB contents (Q1803865) (← links)
- Scheduling unit-time tasks with integer release times and deadlines (Q1838035) (← links)
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. (Q1963611) (← links)
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. (Q1963723) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- A linear time approximation algorithm for multiprocessor scheduling (Q3048240) (← links)
- Algorithms for the inverse and a generalization of the state space approach to finite automata (Q3217608) (← links)
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation (Q3310623) (← links)
- Binary search trees with binary comparison cost (Q3335002) (← links)
- From Tessellations to Table Interpretation (Q3637299) (← links)
- A comparative study of 2-3 trees and AVL trees (Q3659162) (← links)
- Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's (Q3887475) (← links)
- Equal sums of four seventh powers (Q4718422) (← links)
- An efficient external sorting with minimal space requirement (Q4747522) (← links)
- Cache Optimized Solution for Sparse Linear System over Large Order Finite Field (Q5114989) (← links)
- Graphix a graph theory sub language (Q5184374) (← links)
- Syntactic methodology of pruning large lexicons in cursive script recognition (Q5938689) (← links)
