Kunsoo Park - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part IIOtfried Cheong, Kyung-Yong Chwa, Kunsoo Park, editors, Volume 6507 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part IOtfried Cheong, Kyung-Yong Chwa, Kunsoo Park, editors, Volume 6506 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Fair threshold decryption with semi-trusted third partiesJeongdae Hong, Jinil Kim, Jihye Kim, Matthew K. Franklin, Kunsoo Park. ijact, 2(2):139-153, 2010. [doi]

Finding Optimal Alignment and Consensus of Circular StringsTaehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim. cpm 2010: 310-322 [doi]

2009

Consensus Optimizing Both Distance Sum and RadiusAmihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim. spire 2009: 234-242 [doi]

Fair Threshold Decryption with Semi-Trusted Third PartiesJeongdae Hong, Jinil Kim, Jihye Kim, Matthew K. Franklin, Kunsoo Park. acisp 2009: 309-326 [doi]

Improving multikey Quicksort for sorting strings with many equal elementsEunsang Kim, Kunsoo Park. ipl, 109(9):454-459, 2009. [doi]

Dynamic rank/select structures with applications to run-length encoded textsSunho Lee, Kunsoo Park. TCS, 410(43):4402-4413, 2009. [doi]

On-Line Construction of Parameterized Suffix TreesTaehyung Lee, Joong Chae Na, Kunsoo Park. spire 2009: 31-38 [doi]

Dynamic Compressed Representation of Texts with Rank/SelectSunho Lee, Kunsoo Park. jcse, 3(1):15-26, 2009. [doi]

Detecting soft errors by redirection classificationTaehyung Lee, Jinil Kim, Jin Wook Kim, Sung-Ryul Kim, Kunsoo Park. WWW 2009: 1119-1120 [doi]

Alignment of biological sequences with quality scoresJoong Chae Na, Kangho Roh, Alberto Apostolico, Kunsoo Park. ijbra, 5(1):97-113, 2009. [doi]

Fast Computation of Rank and Select Functions for Succinct RepresentationJoong Chae Na, Ji Eun Kim, Kunsoo Park, Dong Kyue Kim. ieicet, 92-D(10):2025-2033, 2009. [doi]

Boolean circuit programming: A new paradigm to design parallel algorithmsKunsoo Park, Heejin Park, Woo-Chul Jeun, Soonhoi Ha. jda, 7(2):267-277, 2009. [doi]

2008

Computing similarity of run-length encoded strings with affine gap penaltyJin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park. TCS, 395(2-3):268-282, 2008. [doi]

Secure Interdomain Routing RegistryE-yong Kim, Li Xiao, Klara Nahrstedt, Kunsoo Park. tifs, 3(2):304-316, 2008. [doi]

An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite GraphEunhui Park, Kunsoo Park. FUIN, 84(1):81-97, 2008. [doi]

External Memory Algorithms for String ProblemsKangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park. FUIN, 84(1):17-32, 2008. [doi]

2007

A Simple Construction of Two-Dimensional Suffix Trees in Linear TimeDong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park. cpm 2007: 352-364 [doi]

Fast Matching Method for DNA SequencesJin Wook Kim, Eunsang Kim, Kunsoo Park. escape 2007: 271-281 [doi]

Dynamic Rank-Select Structures with Applications to Run-Length Encoded TextsSunho Lee, Kunsoo Park. cpm 2007: 95-106 [doi]

Sliding Window Method for NTRUMun-Kyu Lee, Jung-Woo Kim, Jeong Eun Song, Kunsoo Park. acns 2007: 432-442 [doi]

Linear time algorithm for the longest common repeat problemInbok Lee, Costas S. Iliopoulos, Kunsoo Park. jda, 5(2):243-249, 2007. [doi]

On-Line Construction of Two-Dimensional Suffix Trees in O(n:::2::: log n) TimeJoong Chae Na, Raffaele Giancarlo, Kunsoo Park. algorithmica, 48(2):173-186, 2007. [doi]

Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working spaceJoong Chae Na, Kunsoo Park. TCS, 385(1-3):127-136, 2007. [doi]

Combinatorial Pattern MatchingKunsoo Park, Laurent Mouchard. jda, 5(4):635, 2007. [doi]

2006

Short Traceable Signatures Based on Bilinear PairingsSeung Geol Choi, Kunsoo Park, Moti Yung. IWSEC 2006: 88-103 [doi]

Identity-based registry for secure interdomain routingE-yong Kim, Klara Nahrstedt, Li Xiao, Kunsoo Park. ccs 2006: 321-331 [doi]

2005

Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, ProceedingsAlberto Apostolico, Maxime Crochemore, Kunsoo Park, editors, Volume 3537 of Lecture Notes in Computer Science, Springer, 2005.

Approximate Seeds of StringsManolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim. jalc, 10(5/6):609-626, 2005.

Implementing approximate regularitiesManolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim. mcm, 42(7-8):855-866, 2005. [doi]

Computing Similarity of Run-Length Encoded Strings with Affine Gap PenaltyJin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park. spire 2005: 315-326 [doi]

Constructing suffix arrays in linear timeDong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park. jda, 3(2-4):126-142, 2005. [doi]

Efficient Implementation of Rank and Select Functions for Succinct RepresentationDong Kyue Kim, Joong Chae Na, Ji Eun Kim, Kunsoo Park. wea 2005: 315-327 [doi]

Efficient parallel exponentiation in GF(qn) using normal basis representationsMun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho. jal, 54(2):205-221, 2005. [doi]

O(n:::2:::log n) Time On-Line Construction of Two-Dimensional Suffix TreesJoong Chae Na, Raffaele Giancarlo, Kunsoo Park. cocoon 2005: 273-282 [doi]

2004

Parallel two dimensional witness computationRichard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park. iandc, 188(1):20-67, 2004. [doi]

Three-Dimensional Periodicity and Its Application to Pattern MatchingZvi Galil, Jong Geun Park, Kunsoo Park. siamdm, 18(2):362-381, 2004. [doi]

An Efficient Local Alignment Algorithm for Masked SequencesJin Wook Kim, Kunsoo Park. cocoon 2004: 440-449 [doi]

A fast algorithm for the generalized k-keyword proximity problem given keyword offsetsSung-Ryul Kim, Inbok Lee, Kunsoo Park. ipl, 91(3):115-120, 2004. [doi]

A dynamic edit distance tableSung-Ryul Kim, Kunsoo Park. jda, 2(2):303-312, 2004. [doi]

Linear Time Algorithm for the Longest Common Repeat ProblemInbok Lee, Costas S. Iliopoulos, Kunsoo Park. spire 2004: 10-17 [doi]

Simple Implementation of String B-Trees.Joong Chae Na, Kunsoo Park. spire 2004: 214-215 [doi]

Deleting keys of B-trees in parallelHeejin Park, Kunsoo Park, Yookun Cho. jpdc, 64(9):1041-1050, 2004. [doi]

2003

An efficient parallel algorithm for scheduling interval ordered tasksYoojin Chung, Kunsoo Park. jc, 19(4):597-609, 2003. [doi]

Linear-Time Construction of Suffix ArraysDong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park. cpm 2003: 186-199 [doi]

Generalizations of suffix arrays to multi-dimensional matricesDong Kyue Kim, Yoo Ah Kim, Kunsoo Park. TCS, 302(1-3):401-416, 2003. [doi]

Generalizations of suffix arrays to multi-dimensional matricesDong Kyue Kim, Yoo Ah Kim, Kunsoo Park. TCS, 302(1-3):223-238, 2003. [doi]

A Simple and Scalable Algorithm for the IP Address Lookup ProblemInbok Lee, Kunsoo Park, Yanghee Choi. FUIN, 56(1-2):181-190, 2003. [doi]

Truncated suffix trees and their application to data compressionJoong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park. TCS, 1-3(304):87-101, 2003. [doi]

A General Expansion Method Using Efficient EndomorphismsTae-Jun Park, Mun-Kyu Lee, E-yong Kim, Kunsoo Park. icisc 2004: 112-126 [doi]

Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius ExpansionTae-Jun Park, Mun-Kyu Lee, Kunsoo Park. icisc 2004: 152-165 [doi]

The consensus string problem for a metric is NP-completeJeong Seop Sim, Kunsoo Park. jda, 1(1):111-117, 2003. [doi]

2002

Deleting Keys of B-trees in ParallelHeejin Park, Kunsoo Park, Yookun Cho. ipps 2002: [doi]

New Frobenius Expansions for Elliptic Curves with Efficient EndomorphismsTae-Jun Park, Mun-Kyu Lee, Kunsoo Park. icisc 2003: 264-282 [doi]

2001

2000

1999

1998

Constructing Suffix Arrays for Multi-dimensional MatricesDong Kyue Kim, Yoo Ah Kim, Kunsoo Park. cpm 1998: 126-139

Analysis of Two-Dimensional Approximate Pattern Matching AlgorithmsKunsoo Park. TCS, 201(1-2):263-273, 1998. [doi]

1997

1996

Alphabet-Independent Two-Dimensional Witness ComputationZvi Galil, Kunsoo Park. siamcomp, 25(5):907-935, 1996.

Covering a StringCostas S. Iliopoulos, D. W. G. Moore, Kunsoo Park. algorithmica, 16(3):288-297, 1996.

A Work-Time Optimal Algorithm for Computing All String CoversCostas S. Iliopoulos, Kunsoo Park. TCS, 164(1&2):299-310, 1996. [doi]

Analysis of Two-Dimensional Approximate Pattern Matching AlgorithmsKunsoo Park. cpm 1996: 335-347

1995

1994

1993

1992

Truly Alphabet-Independent Two-Dimensional Pattern MatchingZvi Galil, Kunsoo Park. focs 1992: 247-256

Dynamic Programming with Convexity, Concavity, and SparsityZvi Galil, Kunsoo Park. TCS, 92(1):49-76, 1992.

1990

An Improved Algorithm for Approximate String MatchingZvi Galil, Kunsoo Park. siamcomp, 19(6):989-999, 1990.

A Linear-Time Algorithm for Concave One-Dimensional Dynamic ProgrammingZvi Galil, Kunsoo Park. ipl, 33(6):309-311, 1990.

1989

An Improved Algorithm for Approximate String MatchingZvi Galil, Kunsoo Park. icalp 1989: 394-404