The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Kunsoo Park: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  76. Fair Threshold Decryption with Semi-Trusted Third Parties. [Citation Graph (, )][DBLP]


  77. Finding Optimal Alignment and Consensus of Circular Strings. [Citation Graph (, )][DBLP]


  78. On-Line Construction of Parameterized Suffix Trees. [Citation Graph (, )][DBLP]


  79. Consensus Optimizing Both Distance Sum and Radius. [Citation Graph (, )][DBLP]


  80. Detecting soft errors by redirection classification. [Citation Graph (, )][DBLP]


Search in 0.148secs, Finished in 0.151secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002