Chang-Biau Yang

Available identifiers

zbMath Open yang.chang-biauMaRDI QIDQ169696

List of research outcomes

Publication	Date of Publication	Type
The longest almost increasing subsequence problem with sliding windows	2024-06-27	Paper
A fast maximum finding algorithm on broadcast communication	2023-12-12	Paper
Linear-space S-table algorithms for the longest common subsequence problem	2023-06-15	Paper
An efficient algorithm for the longest common palindromic subsequence problem	2022-06-13	Paper
The generalized definitions of the two-dimensional largest common substructure problems	2020-05-21	Paper
A diagonal-based algorithm for the longest common increasing subsequence problem	2020-04-06	Paper
Parallel graph algorithms based upon broadcast communications	2018-09-14	Paper
Multiperiod portfolio investment using stochastic programming with conditional value at risk	2018-07-11	Paper
Efficient merged longest common subsequence algorithms for similar sequences	2017-12-20	Paper
A parallel algorithm for circulant tridiagonal linear systems	2016-06-09	Paper
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion	2015-01-21	Paper
AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH	2015-01-21	Paper
Finding the gapped longest common subsequence by incremental suffix maximum queries	2014-07-18	Paper
The indexing for one-dimensional proportionally-scaled strings	2013-03-28	Paper
Efficient algorithms for the longest common subsequence problem with sequential substring constraints	2013-01-14	Paper
Fast algorithms for computing the constrained LCS of run-length encoded strings	2012-06-25	Paper
A new efficient indexing algorithm for one-dimensional real scaled patterns	2012-05-11	Paper
Efficient indexing algorithms for one-dimensional discretely-scaled strings	2012-03-19	Paper
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings	2010-06-09	Paper
Efficient algorithms for the block edit problems	2010-04-14	Paper
Efficient algorithms for finding interleaving relationship between sequences	2010-03-24	Paper
AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS	2010-03-09	Paper
Dynamic programming algorithms for the mosaic longest common subsequence problem	2010-01-29	Paper
Tree edge decomposition with an application to minimum ultrametric tree approximation	2007-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q2766834	2002-07-22	Paper
Multicast algorithms for hypercube multiprocessors	2001-11-27	Paper
https://portal.mardi4nfdi.de/entity/Q4488861	2000-07-09	Paper
https://portal.mardi4nfdi.de/entity/Q4953345	2000-05-09	Paper
Fault Tolerance on Star Graphs	1997-09-29	Paper
A fast maximum finding algorithm on broadcast communication	1997-02-27	Paper
Reducing conflict resolution time for solving graph problems in broadcast communications	1992-06-28	Paper
The mapping of two-dimensional array processors to one-dimensional processors	1986-01-01	Paper

Research outcomes over time

This page was built for person: Chang-Biau Yang