Heejin Park

	2009
16		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
15		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)
	2008
14		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)
13		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
12		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
11		Seung-Hwan Lim, Heejin Park, Sang-Wook Kim: Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases. DASFAA 2006: 65-79
10		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		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		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		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		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		Dong Kyue Kim, Junha Jo, Heejin Park: A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. WEA 2004: 301-314
4		Heejin Park, Kunsoo Park, Yookun Cho: Deleting keys of B-trees in parallel. J. Parallel Distrib. Comput. 64(9): 1041-1050 (2004)
	2003
3		Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park: Linear-Time Construction of Suffix Arrays. CPM 2003: 186-199
	2002
2		Heejin Park, Kunsoo Park, Yookun Cho: Deleting Keys of B-trees in Parallel. IPDPS 2002
	2001
1		Heejin Park, Kunsoo Park: Parallel algorithms for red-black trees. Theor. Comput. Sci. 262(1): 415-435 (2001)

Coauthor Index

1	Amihood Amir	[16]
2	Phillip G. Bradford	[13]
3	Yookun Cho	[2] [4]
4	Soonhoi Ha	[15]
5	Jeong Eun Jeon	[6]
6	Jaeho Jeong	[10]
7	Woo-Chul Jeun	[15]
8	Junha Jo	[5]
9	Dong Kyue Kim	[3] [5] [6] [7] [8] [9] [14]
10	Hokeun Kim	[10]
11	Minhwan Kim	[14]
12	Sang-Wook Kim	[11] [12]
13	Sangtae Kim	[10]
14	Ki-Ryong Kwon	[8]
15	Gad M. Landau	[16]
16	Kong-Joo Lee	[10]
17	Seung-Hwan Lim	[11] [12]
18	Joong Chae Na	[16]
19	Seungjin Na	[10]
20	Eunok Paek	[10]
21	Kunsoo Park	[1] [2] [3] [4] [7] [15] [16]
22	Sang-Kil Park	[8]
23	Sunju Park	[13]
24	Michael H. Rothkopf	[13]
25	Jawon Seo	[10]
26	Younghwan Seo	[10]
27	Jeong Seop Sim	[3] [7] [16]
28	Ji Woong Sim	[10]

Colors in the list of coauthors