| 2011 | ||
|---|---|---|
| 22 | Jin-Hyun Yoon, Sung-Ryul Kim: Improved Sampling for Triangle Counting with MapReduce. ICHIT (1) 2011: 685-689 | |
| 2009 | ||
| 21 | HeeJoong Noh, Young Hyun Kwon, Chenglong Xu, Sung-Ryul Kim: Combined ranking for multi-media web search engine. ICHIT 2009: 554-557 | |
| 20 | Chenglong Xu, Jeong sik Mun, Sung-Ryul Kim: Development and verification of the DRM standard protocol for media card. ICHIT 2009: 572-575 | |
| 19 | Young Hyun Kwon, Myung Hyun Lee, Sung-Ryul Kim: Effective spelling correction in web queries and run-time DB construction. ICHIT 2009: 581-586 | |
| 18 | Taehyung Lee, Jinil Kim, Jin Wook Kim, Sung-Ryul Kim, Kunsoo Park: Detecting soft errors by redirection classification. WWW 2009: 1119-1120 | |
| 2008 | ||
| 17 | Taehyung Lee, Sung-Ryul Kim, Kunsoo Park: Approximate Word Sequence Matching on an Inverted File Index. IWOCA 2008: 100-114 | |
| 2007 | ||
| 16 | Bo-young Kang, Young Jin Nam, Sung-Ryul Kim, Dae-Wha Seo: Design of UPnP-based Ubiquitous Virtual Storage. ESA 2007: 155-158 | |
| 2006 | ||
| 15 | Young Jin Nam, Eun-Joo Yang, Jong-Yeol Lee, Sung-Ryul Kim, Dae-Wha Seo: Measurement-based Analysis of Power Consumption Patterns for Portable Multimedia Players. ESA 2006: 134-140 | |
| 14 | Inbok Lee, Raphaël Clifford, Sung-Ryul Kim: Algorithms on Extended (delta, gamma)-Matching. ICCSA (3) 2006: 1137-1142 | |
| 13 | Inbok Lee, Sung-Ryul Kim: An Algorithm for the Generalized k-Keyword Proximity Problem and Finding Longest Repetitive Substring in a Set of Strings. International Conference on Computational Science (4) 2006: 289-292 | |
| 2005 | ||
| 12 | Inbok Lee, Jeong-Shik Mun, Sung-Ryul Kim: IP Address Lookup with the Visualizable Biased Segment Tree. FSKD (1) 2005: 1137-1140 | |
| 11 | Sung-Ryul Kim: Scalable Hash Chain Traversal for Mobile Devices. ICCSA (1) 2005: 359-367 | |
| 10 | Youngjin Choi, Sung-Ryul Kim, Suntae Hwang, Karpjoo Jeong: A Grid Computing-Based Monte Carlo Docking Simulations Approach for Computational Chiral Discrimination. RSFDGrC (2) 2005: 446-455 | |
| 9 | Sung-Ryul Kim, Jiman Hong: An Efficient and Practical Algorithm for the Many-Keyword Proximity Problem by Offsets. RSFDGrC (2) 2005: 477-483 | |
| 2004 | ||
| 8 | Sung-Ryul Kim: Effcient Sequential and Parallel Algorithms for Popularity Computation on the World Wide Web with Applications against Spamming. ICCSA (3) 2004: 367-375 | |
| 7 | 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) | |
| 6 | Sung-Ryul Kim, Kunsoo Park: A dynamic edit distance table. J. Discrete Algorithms 2(2): 303-312 (2004) | |
| 2003 | ||
| 5 | Sung-Ryul Kim: Improved Scalable Hash Chain Traversal. ACNS 2003: 86-95 | |
| 2000 | ||
| 4 | Sung-Ryul Kim, Kunsoo Park: Efficient List Ranking Algorithms on Reconfigurable Mesh. COCOON 2000: 262-271 | |
| 3 | Sung-Ryul Kim, Kunsoo Park: A Dynamic Edit Distance Table. CPM 2000: 60-68 | |
| 2 | Sung-Ryul Kim, Kunsoo Park: Fully Scalable Fault-Tolerant Simulations for BSP and CGM. J. Parallel Distrib. Comput. 60(12): 1531-1560 (2000) | |
| 1999 | ||
| 1 | Sung-Ryul Kim, Kunsoo Park: Fully-Scalable Fault-Tolerant Simulations for BSP and CGM. IPPS/SPDP 1999: 117-124 | |
| 1 | Youngjin Choi | [10] |
| 2 | Raphaël Clifford | [14] |
| 3 | Jiman Hong | [9] |
| 4 | Suntae Hwang | [10] |
| 5 | Karpjoo Jeong | [10] |
| 6 | Bo-young Kang | [16] |
| 7 | Jin Wook Kim | [18] |
| 8 | Jinil Kim | [18] |
| 9 | Young Hyun Kwon | [19] [21] |
| 10 | Inbok Lee | [7] [12] [13] [14] |
| 11 | Jong-Yeol Lee | [15] |
| 12 | Myung Hyun Lee | [19] |
| 13 | Taehyung Lee | [17] [18] |
| 14 | Jeong sik Mun | [20] |
| 15 | Jeong-Shik Mun | [12] |
| 16 | Young Jin Nam | [15] [16] |
| 17 | HeeJoong Noh | [21] |
| 18 | Kunsoo Park | [1] [2] [3] [4] [6] [7] [17] [18] |
| 19 | Dae-Wha Seo | [15] [16] |
| 20 | Chenglong Xu | [20] [21] |
| 21 | Eun-Joo Yang | [15] |
| 22 | Jin-Hyun Yoon | [22] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page