Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Chen, Kuan-Yu"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
One-dimensional approximate point set pattern matching with
L_p
-norm
Hung-Lung Wang
,
Kuan-Yu Chen
Theoretical Computer Science
521
, 2014, pp. 42-50
A fully compressed algorithm for computing the edit distance of run-length encoded strings
Kuan-Yu Chen
,
Kun-Mao Chao
Algorithmica
65
(2), 2013, pp. 354-370
Efficient retrieval of approximate palindromes in a run-length encoded string
Kuan-Yu Chen
,
Ping-Hui Hsu
,
Kun-Mao Chao
Theoretical Computer Science
432
, 2012, pp. 28-37
A fully compressed algorithm for computing the edit distance of run-length encoded strings
Kuan-Yu Chen
,
Kun-Mao Chao
Lecture Notes in Computer Science
6346
, 2010, pp. 415-426
Hardness of comparing two run-length encoded strings
Kuan-Yu Chen
,
Ping-Hui Hsu
,
Kun-Mao Chao
Journal of Complexity
26
(4), 2010, pp. 364-374
Identifying approximate palindromes in run-length encoded strings
Kuan-Yu Chen
,
Ping-Hui Hsu
,
Kun-Mao Chao
Lecture Notes in Computer Science
6507
, 2010, pp. 339-350
Finding all approximate gapped palindromes
Ping-Hui Hsu
,
Kuan-Yu Chen
,
Kun-Mao Chao
International Journal of Foundations of Computer Science
21
(6), 2010, pp. 925-939
Approximate matching for run-length encoded strings is 3
sum
-hard
Kuan-Yu Chen
,
Ping-Hui Hsu
,
Kun-Mao Chao
Lecture Notes in Computer Science
5577
, 2009, pp. 168-179
Finding all approximate gapped palindromes
Ping-Hui Hsu
,
Kuan-Yu Chen
,
Kun-Mao Chao
Lecture Notes in Computer Science
5878
, 2009, pp. 1084-1093
Improved algorithms for the
k
maximum-sums problems
Chih-Huai Cheng
,
Kuan-Yu Chen
,
Wen-Chin Tien
,
Kun-Mao Chao
Theoretical Computer Science
362
(1-3), 2006, pp. 162-170
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
Kuan-Yu Chen
,
Kun-Mao Chao
Information Processing Letters
96
(6), 2005, pp. 197-201
Improved algorithms for the
k
maximum-sums problems
Chih-Huai Cheng
,
Kuan-Yu Chen
,
Wen-Chin Tien
,
Kun-Mao Chao
Lecture Notes in Computer Science
3827
, 2005, pp. 799-808
On the range maximum-sum segment query problem
Kuan-Yu Chen
,
Kun-Mao Chao
Lecture Notes in Computer Science
3341
, 2004, pp. 294-305