Demo Data from EDBT 2026 / reviewers in the wild / expert
Kuo-Tsung Tseng
dblp:52/4198
· DBLP profile ↗
7ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Algorithms and data structures · 88% Coding theory · 12% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › sequence algorithms › string algorithms
longest common subsequence |
0.9 | 1 | 2025 | The generalized constrained longest common subsequence in the run-length encoded format · Inf. Comput. 2025 |
Algorithms and data structures › sequence algorithms
string algorithms |
0.9 | 1 | 2025 | The generalized constrained longest common subsequence in the run-length encoded format · Inf. Comput. 2025 |
Algorithms and data structures › data structure design
compressed data structures |
0.3 | 1 | 2025 | The generalized constrained longest common subsequence in the run-length encoded format · Inf. Comput. 2025 |
Coding theory › source coding › lossless compression
run-length coding |
0.3 | 1 | 2025 | The generalized constrained longest common subsequence in the run-length encoded format · Inf. Comput. 2025 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | The generalized constrained longest common subsequence in the run-length encoded format
En-An Song, Chang-Biau Yang, Kuo-Tsung Tseng |
Inf. Comput. | 3 |
| 2020 | A diagonal-based algorithm for the longest common increasing subsequence problem
Shou-Fu Lo, Kuo-Tsung Tseng, Chang-Biau Yang, Kuo-Si Huang |
Theor. Comput. Sci. | 2 |
| 2018 | Efficient merged longest common subsequence algorithms for similar sequences
Kuo-Tsung Tseng, De-Sheng Chan, Chang-Biau Yang, Shou-Fu Lo |
Theor. Comput. Sci. | 1 |
| 2013 | The Application of Support Vector Machine and Behavior Knowledge Space in the Disulfide Connectivity Prediction Problem
Hong-Yu Chen, Kuo-Tsung Tseng, Chang-Biau Yang, Chiou-Yi Hor |
IC3K | 2 |
| 2008 | Efficient algorithms for finding interleaving relationship between sequences
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hsing-Yen Ann, Yung-Hsing Peng |
Inf. Process. Lett. | 3 |
| 2007 | Dynamic programming algorithms for the mosaic longest common subsequence problem
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann |
Inf. Process. Lett. | 3 |
| 2006 | 1-Fair Alternator Designs for the de Bruijn NetworkabstractIn a 1-fair alternator of a network of concurrent processors, no processor executes the critical step twice when one or more other processors have not executed the critical step yet. In this paper, two algorithms are proposed to solve the coloring (1-fair alternator design) problem on the de Bruijn network. The first one uses 2 lceillog2krceil +1 colors to color the k-ary de Bruijn graph with two digits, while the second one uses p + 1 only colors, where (lfloor(p-1)/2rfloorp-1lfloorp/2rfloorp. The second coloring method is optimal when k =lfloorp/2rfloorp. Furthermore, the extension of our coloring method can be applied to the k-ary de Bruijn graph with three or more digits Hsu-Shen Lin, Chang-Biau Yang, Kuo-Tsung Tseng |
PDCAT | 3 |