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="Park, Heejin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding consensus and optimal alignment of circular strings
Taehyung Lee
,
Joong Chae Na
,
Heejin Park
,
Kunsoo Park
,
Jeong Seop Sim
Theoretical Computer Science
468
, 2013, pp. 92-101
Efficient algorithms for consensus string problems minimizing both distance sum and radius
Amihood Amir
,
Gad M. Landau
,
Joong Chae Na
,
Heejin Park
,
Kunsoo Park
,
Jeong Seop Sim
Theoretical Computer Science
412
(39), 2011, pp. 5239-5246
Finding optimal alignment and consensus of circular strings
Taehyung Lee
,
Joong Chae Na
,
Heejin Park
,
Kunsoo Park
,
Jeong Seop Sim
Lecture Notes in Computer Science
6129
, 2010, pp. 310-322
Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees andsuffix arrays
Dong Kyue Kim
,
Minhwan Kim
,
Heejin Park
Algorithmica
52
(3), 2008, pp. 350-377
A new compressed suffix tree supporting fast search and its construction algorithm using optimal working space
Dong Kyue Kim
,
Heejin Park
Lecture Notes in Computer Science
3537
, 2005, pp. 33-44
Deleting keys of
B
-trees in parallel
Heejin Park
,
Kunsoo Park
,
Yookun Cho
Journal Parallel Distributed Computing
64
(9), 2004, pp. 1041-1050
Linear-time construction of suffix arrays
Dong Kyue Kim
,
Jeong Seop Sim
,
Heejin Park
,
Kunsoo Park
Lecture Notes in Computer Science
2676
, 2003, pp. 186-199
Parallel algorithms for red-black trees
Heejin Park
,
Kunsoo Park
Theoretical Computer Science
262
(1-2), 2001, pp. 415-435