The following pages link to Chang-Biau Yang (Q169696):
Displaying 33 items.
- A parallel algorithm for circulant tridiagonal linear systems (Q293282) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- Efficient indexing algorithms for one-dimensional discretely-scaled strings (Q765528) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- Efficient algorithms for the block edit problems (Q963999) (← links)
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- (Q1079954) (redirect page) (← links)
- The mapping of two-dimensional array processors to one-dimensional processors (Q1079955) (← links)
- Reducing conflict resolution time for solving graph problems in broadcast communications (Q1183491) (← links)
- A fast maximum finding algorithm on broadcast communication (Q1350933) (← links)
- Multiperiod portfolio investment using stochastic programming with conditional value at risk (Q1652255) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- Efficient algorithms for the longest common subsequence problem with sequential substring constraints (Q1931428) (← links)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
- Finding the gapped longest common subsequence by incremental suffix maximum queries (Q2252523) (← links)
- A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
- Tree edge decomposition with an application to minimum ultrametric tree approximation (Q2369981) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- (Q2766834) (← links)
- AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH (Q2941089) (← links)
- Fault Tolerance on Star Graphs (Q4358516) (← links)
- (Q4488861) (← links)
- (Q4953345) (← links)
- AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS (Q5187851) (← links)
- Parallel graph algorithms based upon broadcast communications (Q5375457) (← links)
- Multicast algorithms for hypercube multiprocessors (Q5929022) (← links)
- A fast maximum finding algorithm on broadcast communication (Q6085743) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
- The longest almost increasing subsequence problem with sliding windows (Q6562878) (← links)
