| 2009 | ||
|---|---|---|
| 91 | Jeongdae Hong, Jinil Kim, Jihye Kim, Matthew K. Franklin, Kunsoo Park: Fair Threshold Decryption with Semi-Trusted Third Parties. ACISP 2009: 309-326 | |
| 90 | 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 | |
| 89 | Taehyung Lee, Joong Chae Na, Kunsoo Park: On-Line Construction of Parameterized Suffix Trees. SPIRE 2009: 31-38 | |
| 88 | Taehyung Lee, Jinil Kim, Jin Wook Kim, Sung-Ryul Kim, Kunsoo Park: Detecting soft errors by redirection classification. WWW 2009: 1119-1120 | |
| 87 | Joong Chae Na, Kangho Roh, Alberto Apostolico, Kunsoo Park: Alignment of biological sequences with quality scores. IJBRA 5(1): 97-113 (2009) | |
| 86 | Eunsang Kim, Kunsoo Park: Improving multikey Quicksort for sorting strings with many equal elements. Inf. Process. Lett. 109(9): 454-459 (2009) | |
| 85 | 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 | ||
| 84 | Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park: Similarity between Compressed Strings. Encyclopedia of Algorithms 2008 | |
| 83 | Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park: Two-Dimensional Pattern Indexing. Encyclopedia of Algorithms 2008 | |
| 82 | Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park: External Memory Algorithms for String Problems. Fundam. Inform. 84(1): 17-32 (2008) | |
| 81 | Eunhui Park, Kunsoo Park: An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph. Fundam. Inform. 84(1): 81-97 (2008) | |
| 80 | E-yong Kim, Li Xiao, Klara Nahrstedt, Kunsoo Park: Secure Interdomain Routing Registry. IEEE Transactions on Information Forensics and Security 3(2): 304-316 (2008) | |
| 79 | Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park: Computing similarity of run-length encoded strings with affine gap penalty. Theor. Comput. Sci. 395(2-3): 268-282 (2008) | |
| 2007 | ||
| 78 | Mun-Kyu Lee, Jung Woo Kim, Jeong Eun Song, Kunsoo Park: Sliding Window Method for NTRU. ACNS 2007: 432-442 | |
| 77 | Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park: A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. CPM 2007: 352-364 | |
| 76 | Sunho Lee, Kunsoo Park: Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. CPM 2007: 95-106 | |
| 75 | Jin Wook Kim, Eunsang Kim, Kunsoo Park: Fast Matching Method for DNA Sequences. ESCAPE 2007: 271-281 | |
| 74 | Joong Chae Na, Raffaele Giancarlo, Kunsoo Park: On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time. Algorithmica 48(2): 173-186 (2007) | |
| 73 | Inbok Lee, Costas S. Iliopoulos, Kunsoo Park: Linear time algorithm for the longest common repeat problem. J. Discrete Algorithms 5(2): 243-249 (2007) | |
| 72 | Kunsoo Park, Laurent Mouchard: Combinatorial Pattern Matching. J. Discrete Algorithms 5(4): 635 (2007) | |
| 71 | Jin Wook Kim, Kunsoo Park: An efficient alignment algorithm for masked sequences. Theor. Comput. Sci. 370(1-3): 19-33 (2007) | |
| 70 | Joong Chae Na, Kunsoo Park: Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space. Theor. Comput. Sci. 385(1-3): 127-136 (2007) | |
| 2006 | ||
| 69 | E-yong Kim, Klara Nahrstedt, Li Xiao, Kunsoo Park: Identity-based registry for secure interdomain routing. ASIACCS 2006: 321-331 | |
| 68 | Seung Geol Choi, Kunsoo Park, Moti Yung: Short Traceable Signatures Based on Bilinear Pairings. IWSEC 2006: 88-103 | |
| 2005 | ||
| 67 | Alberto Apostolico, Maxime Crochemore, Kunsoo Park: Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings Springer 2005 | |
| 66 | Joong Chae Na, Raffaele Giancarlo, Kunsoo Park: O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees. COCOON 2005: 273-282 | |
| 65 | Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park: Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. SPIRE 2005: 315-326 | |
| 64 | Dong Kyue Kim, Joong Chae Na, Ji Eun Kim, Kunsoo Park: Efficient Implementation of Rank and Select Functions for Succinct Representation. WEA 2005: 315-327 | |
| 63 | Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho: Efficient parallel exponentiation in GF(qn) using normal basis representations. J. Algorithms 54(2): 205-221 (2005) | |
| 62 | 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) | |
| 61 | Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim: Approximate Seeds of Strings. Journal of Automata, Languages and Combinatorics 10(5/6): 609-626 (2005) | |
| 2004 | ||
| 60 | Jin Wook Kim, Kunsoo Park: An Efficient Local Alignment Algorithm for Masked Sequences. COCOON 2004: 440-449 | |
| 59 | Inbok Lee, Costas S. Iliopoulos, Kunsoo Park: Linear Time Algorithm for the Longest Common Repeat Problem. SPIRE 2004: 10-17 | |
| 58 | Joong Chae Na, Kunsoo Park: Simple Implementation of String B-Trees.. SPIRE 2004: 214-215 | |
| 57 | Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park: Parallel two dimensional witness computation. Inf. Comput. 188(1): 20-67 (2004) | |
| 56 | Sung-Ryul Kim, Inbok Lee, Kunsoo Park: A fast algorithm for the generalized k-keyword proximity problem given keyword offsets. Inf. Process. Lett. 91(3): 115-120 (2004) | |
| 55 | Sung-Ryul Kim, Kunsoo Park: A dynamic edit distance table. J. Discrete Algorithms 2(2): 303-312 (2004) | |
| 54 | Heejin Park, Kunsoo Park, Yookun Cho: Deleting keys of B-trees in parallel. J. Parallel Distrib. Comput. 64(9): 1041-1050 (2004) | |
| 53 | Zvi Galil, Jong Geun Park, Kunsoo Park: Three-Dimensional Periodicity and Its Application to Pattern Matching. SIAM J. Discrete Math. 18(2): 362-381 (2004) | |
| 2003 | ||
| 52 | Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park: Linear-Time Construction of Suffix Arrays. CPM 2003: 186-199 | |
| 51 | Tae-Jun Park, Mun-Kyu Lee, E-yong Kim, Kunsoo Park: A General Expansion Method Using Efficient Endomorphisms. ICISC 2003: 112-126 | |
| 50 | Tae-Jun Park, Mun-Kyu Lee, Kunsoo Park: Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion. ICISC 2003: 152-165 | |
| 49 | Inbok Lee, Kunsoo Park, Yanghee Choi: A Simple and Scalable Algorithm for the IP Address Lookup Problem. Fundam. Inform. 56(1-2): 181-190 (2003) | |
| 48 | Yoojin Chung, Kunsoo Park: An efficient parallel algorithm for scheduling interval ordered tasks. J. Complexity 19(4): 597-609 (2003) | |
| 47 | Jeong Seop Sim, Kunsoo Park: The consensus string problem for a metric is NP-complete. J. Discrete Algorithms 1(1): 111-117 (2003) | |
| 46 | Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park: Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 1-3(304): 87-101 (2003) | |
| 45 | Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park: Generalizations of suffix arrays to multi-dimensional matrices. Theor. Comput. Sci. 302(1-3): 223-238 (2003) | |
| 44 | Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park: Generalizations of suffix arrays to multi-dimensional matrices. Theor. Comput. Sci. 302(1-3): 401-416 (2003) | |
| 2002 | ||
| 43 | Tae-Jun Park, Mun-Kyu Lee, Kunsoo Park: New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms. ICISC 2002: 264-282 | |
| 42 | Heejin Park, Kunsoo Park, Yookun Cho: Deleting Keys of B-trees in Parallel. IPDPS 2002 | |
| 2001 | ||
| 41 | Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. CPM 2001: 181-192 | |
| 40 | Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho: Efficient parallel exponentiation in GF(2n) using normal basis representations. SPAA 2001: 179-188 | |
| 39 | Heejin Park, Kunsoo Park: Parallel algorithms for red-black trees. Theor. Comput. Sci. 262(1): 415-435 (2001) | |
| 38 | Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate periods of strings. Theor. Comput. Sci. 262(1): 557-568 (2001) | |
| 2000 | ||
| 37 | Sung-Ryul Kim, Kunsoo Park: Efficient List Ranking Algorithms on Reconfigurable Mesh. COCOON 2000: 262-271 | |
| 36 | Sung-Ryul Kim, Kunsoo Park: A Dynamic Edit Distance Table. CPM 2000: 60-68 | |
| 35 | Joong Chae Na, Kunsoo Park: Data Compression with Truncated Suffix Trees. Data Compression Conference 2000: 565 | |
| 34 | Yoojin Chung, Kunsoo Park, Hyuk-Chul Kwon: An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks. IFIP TCS 2000: 100-111 | |
| 33 | Sung-Ryul Kim, Kunsoo Park: Fully Scalable Fault-Tolerant Simulations for BSP and CGM. J. Parallel Distrib. Comput. 60(12): 1531-1560 (2000) | |
| 1999 | ||
| 32 | Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate Periods of Strings. CPM 1999: 123-133 | |
| 31 | Dong Kyue Kim, Kunsoo Park: Linear-Time Construction of Two-Dimensional Suffix Trees. ICALP 1999: 463-472 | |
| 30 | Sung-Ryul Kim, Kunsoo Park: Fully-Scalable Fault-Tolerant Simulations for BSP and CGM. IPPS/SPDP 1999: 117-124 | |
| 29 | Dong Kyue Kim, Jee-Soo Lee, Kunsoo Park, Yookun Cho: Efficient Algorithms for Approximate String Matching with Swaps. J. Complexity 15(1): 128-147 (1999) | |
| 1998 | ||
| 28 | Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park: Constructing Suffix Arrays for Multi-dimensional Matrices. CPM 1998: 126-139 | |
| 27 | Kunsoo Park: Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. Theor. Comput. Sci. 201(1-2): 263-273 (1998) | |
| 1997 | ||
| 26 | Jee-Soo Lee, Dong Kyue Kim, Kunsoo Park, Yookun Cho: Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract). CPM 1997: 28-39 | |
| 25 | Yoojin Chung, Kunsoo Park, Yookun Cho: Parallel Maximum Matching Algorithms in Interval Graphs. ICPADS 1997: 602-609 | |
| 24 | Zvi Galil, Jong Geun Park, Kunsoo Park: Three-Dimensional Pattern Matching. SPAA 1997: 53-62 | |
| 23 | Kunsoo Park, Sang Lyul Min, Yookun Cho: The Working Set Algorithm has Competitive Ratio Less Than Two. Inf. Process. Lett. 63(4): 183-188 (1997) | |
| 22 | Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter: Constant-Time Randomized Parallel String Matching. SIAM J. Comput. 26(4): 950-960 (1997) | |
| 1996 | ||
| 21 | Kunsoo Park: Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. CPM 1996: 335-347 | |
| 20 | Costas S. Iliopoulos, D. W. G. Moore, Kunsoo Park: Covering a String. Algorithmica 16(3): 288-297 (1996) | |
| 19 | Zvi Galil, Kunsoo Park: Alphabet-Independent Two-Dimensional Witness Computation. SIAM J. Comput. 25(5): 907-935 (1996) | |
| 18 | Costas S. Iliopoulos, Kunsoo Park: A Work-Time Optimal Algorithm for Computing All String Covers. Theor. Comput. Sci. 164(1&2): 299-310 (1996) | |
| 1995 | ||
| 17 | Kunsoo Park, Dong Kyue Kim: String Matching in Hypertext. CPM 1995: 318-329 | |
| 16 | Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski: Work-time-optimal parallel algorithms for string problems. STOC 1995: 713-722 | |
| 15 | Sung-Soo Lim, Young Hyun Bae, Gyu Tae Jang, Byung-Do Rhee, Sang Lyul Min, Chang Yun Park, Heonshik Shin, Kunsoo Park, Soo-Mook Moon, Chong-Sang Kim: An Accurate Worst Case Timing Analysis for RISC Processors. IEEE Trans. Software Eng. 21(7): 593-604 (1995) | |
| 14 | Omer Berkman, Costas S. Iliopoulos, Kunsoo Park: The Subtree Max Gap Problem with Application to Parallel String Covering. Inf. Comput. 123(1): 127-137 (1995) | |
| 1994 | ||
| 13 | Leszek Gasieniec, Kunsoo Park: Work-Time Optimal Parallel Prefix Matching (Extended Abstract). ESA 1994: 471-482 | |
| 12 | Sung-Soo Lim, Young Hyun Bae, Gyu Tae Jang, Byung-Do Rhee, Sang Lyul Min, Chang Yun Park, Heonshik Shin, Kunsoo Park, Chong-Sang Kim: An Accurate Worst Case Timing Analysis Technique for RISC Processors. IEEE Real-Time Systems Symposium 1994: 142-151 | |
| 11 | Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park: The Subtree Max Gap Problem with Application to Parallel String Covering. SODA 1994: 501-510 | |
| 10 | Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park: Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49(2): 208-222 (1994) | |
| 9 | Zvi Galil, Kunsoo Park: Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency. J. Parallel Distrib. Comput. 21(2): 213-222 (1994) | |
| 1993 | ||
| 8 | Costas S. Iliopoulos, Dennis Moore, Kunsoo Park: Covering a String. CPM 1993: 54-62 | |
| 7 | Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter: Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions FOCS 1993: 248-258 | |
| 6 | Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park: On the Set LCS and Set-Set LCS Problems. J. Algorithms 14(3): 466-477 (1993) | |
| 1992 | ||
| 5 | Zvi Galil, Kunsoo Park: Truly Alphabet-Independent Two-Dimensional Pattern Matching FOCS 1992: 247-256 | |
| 4 | Zvi Galil, Kunsoo Park: Dynamic Programming with Convexity, Concavity, and Sparsity. Theor. Comput. Sci. 92(1): 49-76 (1992) | |
| 1990 | ||
| 3 | Zvi Galil, Kunsoo Park: A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming. Inf. Process. Lett. 33(6): 309-311 (1990) | |
| 2 | Zvi Galil, Kunsoo Park: An Improved Algorithm for Approximate String Matching. SIAM J. Comput. 19(6): 989-999 (1990) | |
| 1989 | ||
| 1 | Zvi Galil, Kunsoo Park: An Improved Algorithm for Approximate String Matching. ICALP 1989: 394-404 | |