Heejin Park

Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim: Finding consensus and optimal alignment of circular strings. Theor. Comput. Sci. 468: 92-101 (2013)

Heejin Park, Dong Kyue Kim: Probabilistic Analysis on the Optimal Combination of Trial Division and Probabilistic Primality Tests for Safe Prime Generation. IEICE Transactions 94-D(6): 1210-1215 (2011)

Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim: Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011)

Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim: Finding Optimal Alignment and Consensus of Circular Strings. CPM 2010: 310-322

Sangho Lee, Heejin Park, Jong Kim: A secure and mutual-profitable DRM interoperability scheme. ISCC 2010: 75-80

Heejin Park, Sang-Chul Lee, Soon-Haeng Lee, Sang-Wook Kim: CentralMatch: A Fast and Accurate Method to Identify Blog-Duplicates. Web Intelligence 2010: 112-119

Kunsoo Park, Heejin Park, Woo-Chul Jeun, Soonhoi Ha: Boolean circuit programming: A new paradigm to design parallel algorithms. J. Discrete Algorithms 7(2): 267-277 (2009)

Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim: Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242

Dong Kyue Kim, Minhwan Kim, Heejin Park: Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays. Algorithmica 52(3): 350-377 (2008)

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)

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)

Sangtae Kim, Seungjin Na, Ji Woong Sim, Heejin Park, Jaeho Jeong, Hokeun Kim, Younghwan Seo, Jawon Seo, Kong-Joo Lee, Eunok Paek: MODⁱ : 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)

Seung-Hwan Lim, Heejin Park, Sang-Wook Kim: Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases. DASFAA 2006: 65-79

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)

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

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

Heejin Park, Kunsoo Park, Yookun Cho: Deleting keys of B-trees in parallel. J. Parallel Distrib. Comput. 64(9): 1041-1050 (2004)

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

Dong Kyue Kim, Junha Jo, Heejin Park: A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. WEA 2004: 301-314

Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park: Linear-Time Construction of Suffix Arrays. CPM 2003: 186-199

Heejin Park, Kunsoo Park, Yookun Cho: Deleting Keys of B-trees in Parallel. IPDPS 2002

Heejin Park, Kunsoo Park: Parallel algorithms for red-black trees. Theor. Comput. Sci. 262(1): 415-435 (2001)