| 2008 |
|---|
| 12 | EE | Phillip G. Bradford,
Sunju Park,
Michael H. Rothkopf,
Heejin Park:
Protocol completion incentive problems in cryptographic Vickrey auctions.
Electronic Commerce Research 8(1-2): 57-77 (2008) |
| 2007 |
|---|
| 11 | EE | Seung-Hwan Lim,
Heejin Park,
Sang-Wook Kim:
Using multiple indexes for efficient subsequence matching in time-series databases.
Inf. Sci. 177(24): 5691-5706 (2007) |
| 2006 |
|---|
| 10 | EE | Sangtae Kim,
Seungjin Na,
Ji Woong Sim,
Heejin Park,
Jaeho Jeong,
Hokeun Kim,
Younghwan Seo,
Jawon Seo,
Kong-Joo Lee,
Eunok Paek:
MODi : a powerful and convenient web server for identifying multiple post-translational peptide modifications from tandem mass spectra.
Nucleic Acids Research 34(Web-Server-Issue): 258-263 (2006) |
| 2005 |
|---|
| 9 | EE | Dong Kyue Kim,
Heejin Park:
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space.
CPM 2005: 33-44 |
| 8 | EE | Heejin Park,
Sang-Kil Park,
Ki-Ryong Kwon,
Dong Kyue Kim:
Probabilistic Analyses on Finding Optimal Combinations of Primality Tests in Real Applications.
ISPEC 2005: 74-84 |
| 7 | EE | Dong Kyue Kim,
Jeong Seop Sim,
Heejin Park,
Kunsoo Park:
Constructing suffix arrays in linear time.
J. Discrete Algorithms 3(2-4): 126-142 (2005) |
| 2004 |
|---|
| 6 | EE | Dong Kyue Kim,
Jeong Eun Jeon,
Heejin Park:
An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size.
SPIRE 2004: 138-149 |
| 5 | EE | Dong Kyue Kim,
Junha Jo,
Heejin Park:
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets.
WEA 2004: 301-314 |
| 4 | EE | Heejin Park,
Kunsoo Park,
Yookun Cho:
Deleting keys of B-trees in parallel.
J. Parallel Distrib. Comput. 64(9): 1041-1050 (2004) |
| 2003 |
|---|
| 3 | EE | Dong Kyue Kim,
Jeong Seop Sim,
Heejin Park,
Kunsoo Park:
Linear-Time Construction of Suffix Arrays.
CPM 2003: 186-199 |
| 2002 |
|---|
| 2 | EE | Heejin Park,
Kunsoo Park,
Yookun Cho:
Deleting Keys of B-trees in Parallel.
IPDPS 2002 |
| 2001 |
|---|
| 1 | EE | Heejin Park,
Kunsoo Park:
Parallel algorithms for red-black trees.
Theor. Comput. Sci. 262(1): 415-435 (2001) |
