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="Kim, Sung-Ryul"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fast algorithm for the generalized
k
-keyword proximity problem given keyword offsets
Sung-Ryul Kim
,
Inbok Lee
,
Kunsoo Park
Information Processing Letters
91
(3), 2004, pp. 115-120
Fully scalable fault-tolerant simulations for BSP and CGM
Sung-Ryul Kim
,
Kunsoo Park
Journal Parallel Distributed Computing
60
(12), 2000, pp. 1531-1560
A dynamic edit distance table
Sung-Ryul Kim
,
Kunsoo Park
Lecture Notes in Computer Science
1848
, 2000, pp. 60-68
Efficient list ranking algorithms on reconfigurable mesh
Sung-Ryul Kim
,
Kunsoo Park
Lecture Notes in Computer Science
1858
, 2000, pp. 262-271
Fully-scalable fault-tolerant simulations for BSP and CGM
Sung-Ryul Kim
,
Kunsoo Park
Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IPPS/SPDP'99 (San Juan, Puerto Rico, April 12-16, 1999)
, 1999, pp. 117-124
An
O(\log{N}\log\log{N})
time RMESH algorithm for the simple polygon visibility problem
Sung-Ryul Kim
,
Kunsoo Park
,
Yoo-Kun Cho
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) (Kanazawa, Japan, December 14-16, 1994)
, 1994, pp. 151-158