The following pages link to (Q4144192):
Displaying 50 items.
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Super-exponentially convergent parallel algorithm for a fractional eigenvalue problem of Jacobi-type (Q1697106) (← links)
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns (Q1736650) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- An efficient algorithm for software generation of binary linear recurrences (Q1762549) (← links)
- Construction of a topological drawing of the most planar subgraph of the non-planar graph (Q1792535) (← links)
- Solving the symmetric tridiagonal eigenvalue problem on hypercubes (Q1802455) (← links)
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131) (← links)
- Complexity analysis of algorithms by recognition of their classification properties (Q1816037) (← links)
- Combinatorial compression algorithms for ordered record sequences (Q1816050) (← links)
- Generating random binary trees -- a survey (Q1818783) (← links)
- ``Global'' graph problems tend to be intractable (Q1820581) (← links)
- Optimal matching of deformed patterns with positional influence (Q1822516) (← links)
- A parallel derangement generation algorithm (Q1822966) (← links)
- Least-cost partition algorithms (Q1823166) (← links)
- A parallel algorithm for generating combinations (Q1825043) (← links)
- A systolic generation of combinations (Q1825668) (← links)
- Backtrack search with isomorph rejection and consistency check (Q1825676) (← links)
- On the transformation semigroups of finite automata (Q1836302) (← links)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544) (← links)
- On the NP-hardness of edge-deletion and -contraction problems (Q1838829) (← links)
- Reflectiveness and compression of threshold transformations (Q1841890) (← links)
- A simplified correctness proof for a well-known algorithm computing strongly connected components. (Q1853027) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- Optimal detection of a counterfeit coin with multi-arms balances (Q1897358) (← links)
- Construction of simple path graphs in transport networks. I: General solutions and examples (Q1995394) (← links)
- A bit-string longest-common-subsequence algorithm (Q1996891) (← links)
- Exponentially convergent symbolic algorithm of the functional-discrete method for the fourth order Sturm-Liouville problems with polynomial coefficients (Q2000638) (← links)
- Method and algorithms for adaptive multiagent resource scheduling in heterogeneous distributed computing environments (Q2081120) (← links)
- Method of fictitious domains and homotopy as a new alternative to multidimensional partial differential equations in domains of any shape (Q2203100) (← links)
- Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity (Q2239174) (← links)
- DNA codes for nonadditive stem similarity (Q2263009) (← links)
- An application of Ramsey's theory to partitions in groups. I (Q2276985) (← links)
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem (Q2289917) (← links)
- Fast enumeration of words generated by Dyck grammars (Q2342339) (← links)
- Parallel algorithm for computing points on a computation front hyperplane (Q2354425) (← links)
- Fast gapped variants for Lempel-Ziv-Welch compression (Q2373875) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
- Application of the multivariate runs test to compositional data (Q2454626) (← links)
- Combinatorial optimisation and hierarchical classifications (Q2480261) (← links)
- Efficient iteration in admissible combinatorial classes (Q2581353) (← links)
- Polynomial solvability of cost-based abduction (Q2676566) (← links)
- Aggregation of fuzzy relations of strict order (Q2688298) (← links)
- Using state diagrams for hilbert curve mappings (Q2763945) (← links)
- On the cardinality of a factor set in the symmetric group (Q2920902) (← links)
- (Q2980971) (← links)
- A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS (Q3022025) (← links)
- The travelling salesman problem: selected algorithms and heuristics† (Q3033569) (← links)
- Permutational labelling of constant weight Gray codes (Q3149456) (← links)
