Searching for authors named Kunsoo Park – sorted by Relevance.
-
Parallel Dynamic Programming
- York, 10027, USA and Tel-Aviv University, Tel-Aviv, Israel Kunsoo Park Department of Computing King
- Cited by 17 (1 self) – Add To MetaCart
-
Work-Time Optimal Parallel Prefix Matching (Extended Abstract)
- Work-Time Optimal Parallel Prefix Matching (Extended Abstract) Leszek Gasieniec 1? Kunsoo Park 2
- Add To MetaCart
-
Efficient Parallel Exponentiation in GF(2^n) Using Normal Basis Representations
- y Yoonjeong Kim z Kunsoo Park y Yookun Cho y ABSTRACT Von zur Gathen proposed an ecient
- Add To MetaCart
-
Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract)
- Kunsoo Park Department of Computer Engineering Seoul National University, Seoul 151-742, Korea fdkkim
- Cited by 4 (0 self) – Add To MetaCart
-
The Consensus String Problem for a Metric is NP-Complete
- -mail:jssim@(email omitted); KUNSOO PARK 1 , School of Computer Science and Engineering, Seoul National University, Seoul 151
- Cited by 6 (0 self) – Add To MetaCart
-
Linear-time longest-common-prefix computation in suffix arrays and its applications
- , Gunho Lee 2 , Hiroki Arimura 1,3 , Setsuo Arikawa 1 , and Kunsoo Park 2⋆ 1 Department of Informatics
- Cited by 51 (1 self) – Add To MetaCart
-
Dynamic Programming with Convexity, Concavity, and Sparsity
- 0.87> 16, 4 (1987), 628--638. [H63] Hoffman, A. J. On simple linear programming problems. Proc. Symposia in Pure Math. Vol 7: Convexity, Amer. Math. Soc. (1963), 317--327. [HU79] Hopcroft, J. E., and Ullman, J. D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979. [
- Cited by 25 (1 self) – Add To MetaCart
-
Parallel Two Dimensional Witness Computation
- S. Muthukrishnan { Kunsoo Park k May 18, 2001 Abstract An optimal parallel CRCW-PRAM algorithm
- Cited by 5 (2 self) – Add To MetaCart
-
Dynamic Dictionary Matching
- Kunsoo Park Department of Computing King's College London Strand, London WC2R 2LS, UK 1 Partially
- Cited by 43 (8 self) – Add To MetaCart
-
Constant-Time Randomized Parallel String Matching
- , LESZEK GASIENIEC x , KUNSOO PARK -- , and WOJCIECH RYTTER " Abstract. Given a pattern string
- Cited by 5 (4 self) – Add To MetaCart

