default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKunsoo Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j83]Magsarjav Bataa, Siwoo Song, Kunsoo Park
, Miran Kim, Jung Hee Cheon, Sun Kim:
Finding Highly Similar Regions of Genomic Sequences Through Homomorphic Encryption. J. Comput. Biol. 31(3): 197-212 (2024)- [j82]Wonseok Shin, Siwoo Song, Kunsoo Park, Wook-Shin Han:
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach. Proc. VLDB Endow. 17(7): 1697-1709 (2024) - [c76]Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han:
Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. ICDE 2024: 3257-3269 - 2023
- [j81]Simone Faro, Thierry Lecroq, Kunsoo Park, Stefano Scafiti:
On the Longest Common Cartesian Substring Problem. Comput. J. 66(4): 907-923 (2023) - [j80]Yongsik Kwon, Seonho Lee, Yehyun Nam, Joong Chae Na, Kunsoo Park, Sang K. Cha, Bongki Moon:
DB+-tree: A new variant of B+-tree for main-memory database systems. Inf. Syst. 119: 102287 (2023) - [j79]Yunyoung Choi, Kunsoo Park, Hyunjoon Kim:
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification. Proc. VLDB Endow. 16(9): 2186-2198 (2023) - [j78]Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han:
Fast subgraph query processing and subgraph matching via static and dynamic equivalences. VLDB J. 32(2): 343-368 (2023) - [c75]Seok-Hee Hong, Juan Pablo Bonilla Ataides, Rowena Kok, Amyra Meidiana, Kunsoo Park:
New Seeding Strategies for the Influence Maximization Problem. COMPLEX NETWORKS (2) 2023: 289-299 - [i15]Wonseok Shin, Siwoo Song, Kunsoo Park, Wook-Shin Han:
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach. CoRR abs/2309.15433 (2023) - [i14]Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han:
Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. CoRR abs/2312.10486 (2023) - 2022
- [j77]Sunho Lee, Seokchol Hong, Jonathan Woo, Jae-hak Lee, Kyunghee Kim, Lucia Kim, Kunsoo Park, Jongsun Jung:
RDscan: A New Method for Improving Germline and Somatic Variant Calling Based on Read Depth Distribution. J. Comput. Biol. 29(9): 987-1000 (2022) - [j76]Yong Sik Kwon, Cheol Ryu, Sang Kyun Cha, Arthur H. Lee, Kunsoo Park, Bongki Moon:
Index Key Compression and On-the-Fly Reconstruction of In-Memory Indexes. J. Database Manag. 33(1): 1-17 (2022) - [c74]Seok-Hee Hong, Amyra Meidiana, James Wood, Juan Pablo Ataides, Peter Eades, Kunsoo Park:
dGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization. PacificVis 2022: 51-60 - [c73]Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han:
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. ICDE 2022: 872-884 - 2021
- [j75]Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han:
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. Proc. VLDB Endow. 14(8): 1298-1310 (2021) - [j74]Siwoo Song, Geonmo Gu, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast algorithms for single and multiple pattern Cartesian tree matching. Theor. Comput. Sci. 849: 47-63 (2021) - [c72]Seok-Hee Hong, Peter Eades, Marnijati Torkel, James Wood, Kunsoo Park:
Louvain-based Multi-level Graph Drawing. PacificVis 2021: 151-155 - [c71]Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals:
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. CPM 2021: 22:1-22:9 - [c70]Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han:
Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. ICDE 2021: 1368-1379 - [c69]Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han:
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. SIGMOD Conference 2021: 925-937 - [i13]Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals:
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. CoRR abs/2102.12824 (2021) - [i12]Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han:
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. CoRR abs/2104.00886 (2021) - 2020
- [j73]Hyunjoon Kim, Seunghwan Min, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han:
IDAR: Fast Supergraph Search Using DAG Integration. Proc. VLDB Endow. 13(9): 1456-1468 (2020) - [j72]Cheol Ryu, Thierry Lecroq, Kunsoo Park:
Fast string matching for DNA sequences. Theor. Comput. Sci. 812: 137-148 (2020) - [j71]Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding patterns and periods in Cartesian tree matching. Theor. Comput. Sci. 845: 181-197 (2020) - [c68]Magsarjav Bataa, Siwoo Song, Kunsoo Park, Miran Kim, Jung Hee Cheon, Sun Kim:
Homomorphic Computation of Local Alignment. BIBM 2020: 2167-2174 - [c67]Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals:
Efficient Construction of Hierarchical Overlap Graphs. SPIRE 2020: 277-290 - [c66]Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. Stringology 2020: 48-60 - [c65]Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. WALCOM 2020: 107-119 - [i11]Yong Sik Kwon, Cheol Ryu, Sang Kyun Cha, Arthur H. Lee, Kunsoo Park, Bongki Moon:
Compressed Key Sort and Fast Index Reconstruction. CoRR abs/2009.11543 (2020)
2010 – 2019
- 2019
- [c64]Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CPM 2019: 16:1-16:14 - [c63]Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding Periods in Cartesian Tree Matching. IWOCA 2019: 70-84 - [c62]Myoungji Han, Hyunjoon Kim, Geonmo Gu, Kunsoo Park, Wook-Shin Han:
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together. SIGMOD Conference 2019: 1429-1446 - [c61]Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. SPIRE 2019: 124-137 - [i10]Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CoRR abs/1905.08974 (2019) - [i9]Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. CoRR abs/1908.04937 (2019) - [i8]Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. CoRR abs/1911.01644 (2019) - 2018
- [j70]Jungjoo Seo, Kunsoo Park:
Fast batch modular exponentiation with common-multiplicand multiplication. Inf. Process. Lett. 129: 5-10 (2018) - [j69]Sunho Lee, Cheol Ryu, Sang Kyun Cha, Kunsoo Park, Jungsuk Oh, Kihong Kim, Changbin Song:
Interval Disaggregation with Product Life Cycles and Constraints. J. Comput. Sci. Eng. 12(2): 63-76 (2018) - [j68]Cheol Ryu, Kunsoo Park:
Improved pattern-scan-order algorithms for string matching. J. Discrete Algorithms 49: 27-36 (2018) - [j67]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment with gaps. Theor. Comput. Sci. 710: 148-157 (2018) - 2017
- [j66]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. Math. Comput. Sci. 11(2): 127-136 (2017) - [j65]Jihyuk Lim, Kunsoo Park:
A fast algorithm for the all-pairs suffix-prefix problem. Theor. Comput. Sci. 698: 14-24 (2017) - [c60]Cheol Ryu, Sunho Lee, Kihong Kim, Kunsoo Park, Yong Sik Kwon, Sang Kyun Cha, Changbin Song, Emanuel Ziegler, Stephan Muench:
Optimizing Scalar User-Defined Functions in In-Memory Column-Store Database Systems. DASFAA (2) 2017: 568-580 - [c59]Jihyuk Lim, Kunsoo Park:
Algorithm Engineering for All-Pairs Suffix-Prefix Matching. SEA 2017: 14:1-14:12 - 2016
- [j64]Joong Chae Na, Hyunjoon Kim, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment: A compressed index for similar strings. Theor. Comput. Sci. 638: 159-170 (2016) - [c58]Kunsoo Park:
Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk). ISAAC 2016: 2:1-2:1 - [r4]Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park:
Indexed Two-Dimensional String Matching. Encyclopedia of Algorithms 2016: 973-977 - [r3]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Similarity Between Compressed Strings. Encyclopedia of Algorithms 2016: 1977-1981 - [i7]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of Alignment with Gaps. CoRR abs/1606.03897 (2016) - 2015
- [j63]Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
A fast algorithm for order-preserving pattern matching. Inf. Process. Lett. 115(2): 397-402 (2015) - [j62]Jungjoo Seo, Myoungji Han, Kunsoo Park:
Efficient Accessing and Searching in a Sequence of Numbers. J. Comput. Sci. Eng. 9(1): 1-8 (2015) - [j61]Jung Woo Kim, Jungjoo Seo, Jin Hong, Kunsoo Park, Sung-Ryul Kim:
High-speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous system. Softw. Pract. Exp. 45(6): 837-855 (2015) - [c57]Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park:
Fast Multiple Order-Preserving Matching Algorithms. IWOCA 2015: 248-259 - [i6]Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park:
Fast Multiple Order-Preserving Matching Algorithms. CoRR abs/1506.05203 (2015) - 2014
- [j60]Sang K. Cha, Kunsoo Park, Changbin Song, Kihong Kim, Cheol Ryu, Sunho Lee:
Interval Disaggregate: A New Operator for Business Planning. Proc. VLDB Endow. 7(13): 1381-1392 (2014) - [j59]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order-preserving matching. Theor. Comput. Sci. 525: 68-79 (2014) - [j58]Carl Barton, Costas S. Iliopoulos, Inbok Lee, Laurent Mouchard, Kunsoo Park, Solon P. Pissis:
Extending alignments with k-mismatches and ℓ-gaps. Theor. Comput. Sci. 525: 80-88 (2014) - [c56]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. ICABD 2014: 46-52 - 2013
- [j57]Mun-Kyu Lee, Jung Woo Kim, Jeong Eun Song, Kunsoo Park:
Efficient Implementation of NTRU Cryptosystem Using Sliding Window Methods. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(1): 206-214 (2013) - [j56]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) - [c55]Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
Fast Order-Preserving Pattern Matching. COCOA 2013: 295-305 - [c54]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. IWOCA 2013: 337-348 - [c53]Joong Chae Na, Heejin Park, Sunho Lee, Minsung Hong, Thierry Lecroq, Laurent Mouchard, Kunsoo Park:
Suffix Array of Alignment: A Practical Index for Similar Data. SPIRE 2013: 243-254 - [i5]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order Preserving Matching. CoRR abs/1302.4064 (2013) - [i4]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. CoRR abs/1305.1744 (2013) - [i3]Jung Woo Kim, Jin Hong, Kunsoo Park:
Analysis of the Rainbow Tradeoff Algorithm Used in Practice. IACR Cryptol. ePrint Arch. 2013: 591 (2013) - 2012
- [j55]Kyung-Yong Chwa, Kunsoo Park:
Guest Editorial: Special Issue on Algorithms and Computation. Algorithmica 64(3): 327-328 (2012) - [c52]Tomás Flouri, Costas S. Iliopoulos, Kunsoo Park, Solon P. Pissis:
GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures. AIAI (2) 2012: 593-601 - [c51]Jung Woo Kim, Jungjoo Seo, Jin Hong, Kunsoo Park, Sung-Ryul Kim:
High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous System. INDOCRYPT 2012: 303-316 - 2011
- [j54]Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
Linear-Time Construction of Two-Dimensional Suffix Trees. Algorithmica 59(2): 269-297 (2011) - [j53]Joo Yoon, Jeonghun Yeom, Heebum Lee, Kyutae Kim, Seungjin Na, Kunsoo Park, Eunok Paek, Cheolju Lee:
High-throughput peptide quantification using mTRAQ reagent triplex. BMC Bioinform. 12(S-1): S46 (2011) - [j52]Taehyung Lee, Joong Chae Na, Kunsoo Park:
On-line construction of parameterized suffix trees for large alphabets. Inf. Process. Lett. 111(5): 201-207 (2011) - [j51]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) - [c50]Tomás Flouri, Kunsoo Park, Kimon Frousios, Solon P. Pissis, Costas S. Iliopoulos, German Tischler:
Approximate string-matching with a single gap for sequence alignment. BCB 2011: 490-492 - [i2]Jeongdae Hong, Jung Woo Kim, Jihye Kim, Kunsoo Park, Jung Hee Cheon:
Constant-Round Privacy Preserving Multiset Union. IACR Cryptol. ePrint Arch. 2011: 138 (2011) - 2010
- [j50]Jeongdae Hong, Jinil Kim, Jihye Kim, Matthew K. Franklin, Kunsoo Park:
Fair threshold decryption with semi-trusted third parties. Int. J. Appl. Cryptogr. 2(2): 139-153 (2010) - [c49]Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding Optimal Alignment and Consensus of Circular Strings. CPM 2010: 310-322 - [e3]Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park:
Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6506, Springer 2010, ISBN 978-3-642-17516-9 [contents] - [e2]Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park:
Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6507, Springer 2010, ISBN 978-3-642-17513-8 [contents]
2000 – 2009
- 2009
- [j49]Joong Chae Na, Ji Eun Kim, Kunsoo Park, Dong Kyue Kim:
Fast Computation of Rank and Select Functions for Succinct Representation. IEICE Trans. Inf. Syst. 92-D(10): 2025-2033 (2009) - [j48]Joong Chae Na, Kangho Roh, Alberto Apostolico, Kunsoo Park:
Alignment of biological sequences with quality scores. Int. J. Bioinform. Res. Appl. 5(1): 97-113 (2009) - [j47]Eunsang Kim, Kunsoo Park:
Improving multikey Quicksort for sorting strings with many equal elements. Inf. Process. Lett. 109(9): 454-459 (2009) - [j46]Sunho Lee, Kunsoo Park:
Dynamic Compressed Representation of Texts with Rank/Select. J. Comput. Sci. Eng. 3(1): 15-26 (2009) - [j45]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) - [j44]Sunho Lee, Kunsoo Park:
Dynamic rank/select structures with applications to run-length encoded texts. Theor. Comput. Sci. 410(43): 4402-4413 (2009) - [c48]Jeongdae Hong, Jinil Kim, Jihye Kim, Matthew K. Franklin, Kunsoo Park:
Fair Threshold Decryption with Semi-Trusted Third Parties. ACISP 2009: 309-326 - [c47]Taehyung Lee, Joong Chae Na, Kunsoo Park:
On-Line Construction of Parameterized Suffix Trees. SPIRE 2009: 31-38 - [c46]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 - [c45]Taehyung Lee, Jinil Kim, Jin Wook Kim, Sung-Ryul Kim, Kunsoo Park:
Detecting soft errors by redirection classification. WWW 2009: 1119-1120 - 2008
- [j43]Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park:
External Memory Algorithms for String Problems. Fundam. Informaticae 84(1): 17-32 (2008) - [j42]Eunhui Park, Kunsoo Park:
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph. Fundam. Informaticae 84(1): 81-97 (2008) - [j41]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) - [j40]E-yong Kim, Li Xiao, Klara Nahrstedt, Kunsoo Park:
Secure Interdomain Routing Registry. IEEE Trans. Inf. Forensics Secur. 3(2): 304-316 (2008) - [c44]Eunsang Kim, Kunsoo Park:
Improving Multikey Quicksort for Sorting Strings. IWOCA 2008: 89-99 - [c43]Taehyung Lee, Sung-Ryul Kim, Kunsoo Park:
Approximate Word Sequence Matching on an Inverted File Index. IWOCA 2008: 100-114 - [r2]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Similarity between Compressed Strings. Encyclopedia of Algorithms 2008 - [r1]Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park:
Two-Dimensional Pattern Indexing. Encyclopedia of Algorithms 2008 - 2007
- [j39]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) - [j38]Inbok Lee, Costas S. Iliopoulos, Kunsoo Park:
Linear time algorithm for the longest common repeat problem. J. Discrete Algorithms 5(2): 243-249 (2007) - [j37]Kunsoo Park, Laurent Mouchard:
Combinatorial Pattern Matching. J. Discrete Algorithms 5(4): 635 (2007) - [j36]Jin Wook Kim, Kunsoo Park:
An efficient alignment algorithm for masked sequences. Theor. Comput. Sci. 370(1-3): 19-33 (2007) - [j35]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) - [c42]Mun-Kyu Lee, Jung Woo Kim, Jeong Eun Song, Kunsoo Park:
Sliding Window Method for NTRU. ACNS 2007: 432-442 - [c41]Sunho Lee, Kunsoo Park:
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. CPM 2007: 95-106 - [c40]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 - [c39]Jin Wook Kim, Eunsang Kim, Kunsoo Park:
Fast Matching Method for DNA Sequences. ESCAPE 2007: 271-281 - 2006
- [c38]E-yong Kim, Klara Nahrstedt, Li Xiao, Kunsoo Park:
Identity-based registry for secure interdomain routing. AsiaCCS 2006: 321-331 - [c37]Seung Geol Choi, Kunsoo Park, Moti Yung:
Short Traceable Signatures Based on Bilinear Pairings. IWSEC 2006: 88-103 - [i1]E-yong Kim, Hwangnam Kim, Kunsoo Park:
Provisioning Protected Resource Sharing in Multi-Hop Wireless Networks. IACR Cryptol. ePrint Arch. 2006: 382 (2006) - 2005
- [j34]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) - [j33]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. J. Autom. Lang. Comb. 10(5/6): 609-626 (2005) - [j32]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) - [j31]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Implementing approximate regularities. Math. Comput. Model. 42(7-8): 855-866 (2005) - [c36]Joong Chae Na, Raffaele Giancarlo, Kunsoo Park:
O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees. COCOON 2005: 273-282 - [c35]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 - [c34]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 - [e1]Alberto Apostolico, Maxime Crochemore, Kunsoo Park:
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings. Lecture Notes in Computer Science 3537, Springer 2005, ISBN 3-540-26201-6 [contents] - 2004
- [j30]Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park:
Parallel two dimensional witness computation. Inf. Comput. 188(1): 20-67 (2004) - [j29]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) - [j28]Sung-Ryul Kim, Kunsoo Park:
A dynamic edit distance table. J. Discrete Algorithms 2(2): 303-312 (2004) - [j27]Heejin Park, Kunsoo Park, Yookun Cho:
Deleting keys of B-trees in parallel. J. Parallel Distributed Comput. 64(9): 1041-1050 (2004) - [j26]Zvi Galil, Jong Geun Park, Kunsoo Park:
Three-Dimensional Periodicity and Its Application to Pattern Matching. SIAM J. Discret. Math. 18(2): 362-381 (2004) - [c33]Jin Wook Kim, Kunsoo Park:
An Efficient Local Alignment Algorithm for Masked Sequences. COCOON 2004: 440-449 - [c32]Inbok Lee, Costas S. Iliopoulos, Kunsoo Park:
Linear Time Algorithm for the Longest Common Repeat Problem. SPIRE 2004: 10-17 - [c31]Joong Chae Na, Kunsoo Park:
Simple Implementation of String B-Trees.. SPIRE 2004: 214-215 - 2003
- [j25]Inbok Lee, Kunsoo Park, Yanghee Choi:
A Simple and Scalable Algorithm for the IP Address Lookup Problem. Fundam. Informaticae 56(1-2): 181-190 (2003) - [j24]Mun-Kyu Lee, Kunsoo Park:
Efficient Arithmetic in Optimal Extension Fields Using Simultaneous Multiplication. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1316-1321 (2003) - [j23]Yoojin Chung, Kunsoo Park:
An efficient parallel algorithm for scheduling interval ordered tasks. J. Complex. 19(4): 597-609 (2003) - [j22]Jeong Seop Sim, Kunsoo Park:
The consensus string problem for a metric is NP-complete. J. Discrete Algorithms 1(1): 111-117 (2003) - [j21]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) - [j20]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) - [j19]Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park:
Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 304(1-3): 87-101 (2003) - [c30]Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Linear-Time Construction of Suffix Arrays. CPM 2003: 186-199 - [c29]Tae-Jun Park, Mun-Kyu Lee, E-yong Kim, Kunsoo Park:
A General Expansion Method Using Efficient Endomorphisms. ICISC 2003: 112-126 - [c28]Tae-Jun Park, Mun-Kyu Lee, Kunsoo Park:
Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion. ICISC 2003: 152-165 - [c27]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. Stringology 2003: 25-36 - 2002
- [c26]Tae-Jun Park, Mun-Kyu Lee, Kunsoo Park:
New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms. ICISC 2002: 264-282 - [c25]Heejin Park, Kunsoo Park, Yookun Cho:
Deleting Keys of B-trees in Parallel. IPDPS 2002 - 2001
- [j18]Heejin Park, Kunsoo Park:
Parallel algorithms for red-black trees. Theor. Comput. Sci. 262(1): 415-435 (2001) - [j17]Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate periods of strings. Theor. Comput. Sci. 262(1): 557-568 (2001) - [c24]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 - [c23]Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho:
Efficient parallel exponentiation in GF(2n) using normal basis representations. SPAA 2001: 179-188 - 2000
- [j16]Sung-Ryul Kim, Kunsoo Park:
Fully Scalable Fault-Tolerant Simulations for BSP and CGM. J. Parallel Distributed Comput. 60(12): 1531-1560 (2000) - [c22]Sung-Ryul Kim, Kunsoo Park:
Efficient List Ranking Algorithms on Reconfigurable Mesh. COCOON 2000: 262-271 - [c21]Sung-Ryul Kim, Kunsoo Park:
A Dynamic Edit Distance Table. CPM 2000: 60-68 - [c20]Joong Chae Na, Kunsoo Park:
Data Compression with Truncated Suffix Trees. Data Compression Conference 2000: 565 - [c19]Yoojin Chung, Kunsoo Park, Hyuk-Chul Kwon:
An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks. IFIP TCS 2000: 100-111
1990 – 1999
- 1999
- [j15]Dong Kyue Kim, Jee-Soo Lee, Kunsoo Park, Yookun Cho:
Efficient Algorithms for Approximate String Matching with Swaps. J. Complex. 15(1): 128-147 (1999) - [c18]Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate Periods of Strings. CPM 1999: 123-133 - [c17]Dong Kyue Kim, Kunsoo Park:
Linear-Time Construction of Two-Dimensional Suffix Trees. ICALP 1999: 463-472 - [c16]Sung-Ryul Kim, Kunsoo Park:
Fully-Scalable Fault-Tolerant Simulations for BSP and CGM. IPPS/SPDP 1999: 117-124 - 1998
- [j14]Kunsoo Park:
Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. Theor. Comput. Sci. 201(1-2): 263-273 (1998) - [c15]Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park:
Constructing Suffix Arrays for Multi-dimensional Matrices. CPM 1998: 126-139 - 1997
- [j13]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) - [j12]Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter:
Constant-Time Randomized Parallel String Matching. SIAM J. Comput. 26(4): 950-960 (1997) - [c14]Jee-Soo Lee, Dong Kyue Kim, Kunsoo Park, Yookun Cho:
Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract). CPM 1997: 28-39 - [c13]Yoojin Chung, Kunsoo Park, Yookun Cho:
Parallel Maximum Matching Algorithms in Interval Graphs. ICPADS 1997: 602-609 - [c12]Zvi Galil, Jong Geun Park, Kunsoo Park:
Three-Dimensional Pattern Matching. SPAA 1997: 53-62 - 1996
- [j11]Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park:
Covering a String. Algorithmica 16(3): 288-297 (1996) - [j10]Zvi Galil, Kunsoo Park:
Alphabet-Independent Two-Dimensional Witness Computation. SIAM J. Comput. 25(5): 907-935 (1996) - [j9]Costas S. Iliopoulos, Kunsoo Park:
A Work-Time Optimal Algorithm for Computing All String Covers. Theor. Comput. Sci. 164(1&2): 299-310 (1996) - [c11]Kunsoo Park:
Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. CPM 1996: 335-347 - 1995
- [j8]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) - [j7]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) - [c10]Kunsoo Park, Dong Kyue Kim:
String Matching in Hypertext. CPM 1995: 318-329 - [c9]Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski:
Work-time-optimal parallel algorithms for string problems. STOC 1995: 713-722 - 1994
- [j6]Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park:
Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49(2): 208-222 (1994) - [j5]Zvi Galil, Kunsoo Park:
Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency. J. Parallel Distributed Comput. 21(2): 213-222 (1994) - [c8]Leszek Gasieniec, Kunsoo Park:
Work-Time Optimal Parallel Prefix Matching (Extended Abstract). ESA 1994: 471-482 - [c7]Sung-Ryul Kim, Kunsoo Park, Yookun Cho:
An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem. ISPAN 1994: 151-158 - [c6]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. RTSS 1994: 97-108 - [c5]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 - 1993
- [j4]Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park:
On the Set LCS and Set-Set LCS Problems. J. Algorithms 14(3): 466-477 (1993) - [c4]Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park:
Covering a String. CPM 1993: 54-62 - [c3]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 - 1992
- [j3]Zvi Galil, Kunsoo Park:
Dynamic Programming with Convexity, Concavity, and Sparsity. Theor. Comput. Sci. 92(1): 49-76 (1992) - [c2]Zvi Galil, Kunsoo Park:
Truly Alphabet-Independent Two-Dimensional Pattern Matching. FOCS 1992: 247-256 - 1990
- [j2]Zvi Galil, Kunsoo Park:
A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming. Inf. Process. Lett. 33(6): 309-311 (1990) - [j1]Zvi Galil, Kunsoo Park:
An Improved Algorithm for Approximate String Matching. SIAM J. Comput. 19(6): 989-999 (1990)
1980 – 1989
- 1989
- [c1]Zvi Galil, Kunsoo Park:
An Improved Algorithm for Approximate String Matching. ICALP 1989: 394-404
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
