| 2026 | AAAI | ProgRAG: Hallucination-Resistant Progressive Retrieval and Reasoning over Knowledge Graphs. | Minbae Park, Hyemin Yang, Jeonghyun Kim, Kunsoo Park, Hyunjoon Kim |
| 2026 | ICDE | Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint. | Siwoo Song, Wonseok Shin, Kunsoo Park, Giuseppe F. Italiano, Zhengyi Yang, Wenjie Zhang |
| 2024 | ICDE | Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. | Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han |
| 2022 | ICDE | Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. | Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han |
| 2021 | CPM | A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. | Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals |
| 2021 | ICDE | Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. | Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han |
| 2021 | SIGMOD | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. | Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han |
| 2020 | SPIRE | Efficient Construction of Hierarchical Overlap Graphs. | Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals |
| 2020 | WALCOM | Fast Multiple Pattern Cartesian Tree Matching. | Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park |
| 2019 | CPM | Cartesian Tree Matching and Indexing. | Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park |
| 2019 | IWOCA | Finding Periods in Cartesian Tree Matching. | Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park |
| 2019 | SIGMOD | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together. | Myoungji Han, Hyunjoon Kim, Geonmo Gu, Kunsoo Park, Wook-Shin Han |
| 2019 | SPIRE | Fast Cartesian Tree Matching. | Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park |
| 2017 | DASFAA | Optimizing Scalar User-Defined Functions in In-Memory Column-Store Database Systems. | Cheol Ryu, Sunho Lee, Kihong Kim, Kunsoo Park, Yong Sik Kwon, Sang Kyun Cha, Changbin Song, Emanuel Ziegler, Stephan Muench |
| 2016 | ISAAC | Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk). | Kunsoo Park |
| 2015 | IWOCA | Fast Multiple Order-Preserving Matching Algorithms. | Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park |
| 2013 | COCOA | Fast Order-Preserving Pattern Matching. | Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim |
| 2013 | IWOCA | Suffix Tree of Alignment: An Efficient Index for Similar Data. | Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park |
| 2013 | SPIRE | Suffix Array of Alignment: A Practical Index for Similar Data. | Joong Chae Na, Heejin Park, Sunho Lee, Minsung Hong, Thierry Lecroq, Laurent Mouchard, Kunsoo Park |
| 2012 | INDOCRYPT | High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous System. | Jung Woo Kim, Jungjoo Seo, Jin Hong, Kunsoo Park, Sung-Ryul Kim |
| 2010 | CPM | Finding Optimal Alignment and Consensus of Circular Strings. | Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim |
| 2009 | ACISP | Fair Threshold Decryption with Semi-Trusted Third Parties. | Jeongdae Hong, Jinil Kim, Jihye Kim, Matthew K. Franklin, Kunsoo Park |
| 2009 | WWW | Detecting soft errors by redirection classification. | Taehyung Lee, Jinil Kim, Jin Wook Kim, Sung-Ryul Kim, Kunsoo Park |
| 2009 | SPIRE | Consensus Optimizing Both Distance Sum and Radius. | Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim |
| 2009 | SPIRE | On-Line Construction of Parameterized Suffix Trees. | Taehyung Lee, Joong Chae Na, Kunsoo Park |
| 2008 | IWOCA | Improving Multikey Quicksort for Sorting Strings. | Eunsang Kim, Kunsoo Park |
| 2008 | IWOCA | Approximate Word Sequence Matching on an Inverted File Index. | Taehyung Lee, Sung-Ryul Kim, Kunsoo Park |
| 2007 | ACNS | Sliding Window Method for NTRU. | Mun-Kyu Lee, Jung Woo Kim, Jeong Eun Song, Kunsoo Park |
| 2007 | CPM | A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. | Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park |
| 2007 | CPM | Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. | Sunho Lee, Kunsoo Park |
| 2006 | CCS | Identity-based registry for secure interdomain routing. | E-yong Kim, Klara Nahrstedt, Li Xiao, Kunsoo Park |
| 2006 | IWSEC | Short Traceable Signatures Based on Bilinear Pairings. | Seung Geol Choi, Kunsoo Park, Moti Yung |
| 2005 | COCOON | O(n | Joong Chae Na, Raffaele Giancarlo, Kunsoo Park |
| 2005 | SPIRE | Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. | Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park |
| 2004 | COCOON | An Efficient Local Alignment Algorithm for Masked Sequences. | Jin Wook Kim, Kunsoo Park |
| 2004 | SPIRE | Linear Time Algorithm for the Longest Common Repeat Problem. | Inbok Lee, Costas S. Iliopoulos, Kunsoo Park |
| 2004 | SPIRE | Simple Implementation of String B-Trees.. | Joong Chae Na, Kunsoo Park |
| 2003 | CPM | Linear-Time Construction of Suffix Arrays. | Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park |
| 2003 | ICISC | A General Expansion Method Using Efficient Endomorphisms. | Tae-Jun Park, Mun-Kyu Lee, E-yong Kim, Kunsoo Park |
| 2003 | ICISC | Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion. | Tae-Jun Park, Mun-Kyu Lee, Kunsoo Park |
| 2002 | ICISC | New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms. | Tae-Jun Park, Mun-Kyu Lee, Kunsoo Park |
| 2001 | CPM | Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. | Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park |
| 2001 | SPAA | Efficient parallel exponentiation in GF(2 | Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho |
| 2000 | COCOON | Efficient List Ranking Algorithms on Reconfigurable Mesh. | Sung-Ryul Kim, Kunsoo Park |
| 2000 | CPM | A Dynamic Edit Distance Table. | Sung-Ryul Kim, Kunsoo Park |
| 2000 | DCC | Data Compression with Truncated Suffix Trees. | Joong Chae Na, Kunsoo Park |
| 1999 | CPM | Approximate Periods of Strings. | Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth |
| 1999 | ICALP | Linear-Time Construction of Two-Dimensional Suffix Trees. | Dong Kyue Kim, Kunsoo Park |
| 1998 | CPM | Constructing Suffix Arrays for Multi-dimensional Matrices. | Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park |
| 1997 | CPM | Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract). | Jee-Soo Lee, Dong Kyue Kim, Kunsoo Park, Yookun Cho |
| 1997 | ICPADS | Parallel Maximum Matching Algorithms in Interval Graphs. | Yoojin Chung, Kunsoo Park, Yookun Cho |
| 1997 | SPAA | Three-Dimensional Pattern Matching. | Zvi Galil, Jong Geun Park, Kunsoo Park |
| 1996 | CPM | Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. | Kunsoo Park |
| 1995 | CPM | String Matching in Hypertext. | Kunsoo Park, Dong Kyue Kim |
| 1995 | STOC | Work-time-optimal parallel algorithms for string problems. | Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski |
| 1994 | ESA | Work-Time Optimal Parallel Prefix Matching (Extended Abstract). | Leszek Gasieniec, Kunsoo Park |
| 1994 | SODA | The Subtree Max Gap Problem with Application to Parallel String Covering. | Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park |
| 1994 | RTSS | An Accurate Worst Case Timing Analysis Technique for RISC Processors. | 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 |
| 1993 | CPM | Covering a String. | Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park |
| 1993 | FOCS | Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions | Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter |
| 1992 | FOCS | Truly Alphabet-Independent Two-Dimensional Pattern Matching | Zvi Galil, Kunsoo Park |
| 1989 | ICALP | An Improved Algorithm for Approximate String Matching. | Zvi Galil, Kunsoo Park |