default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChan-Ik Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c18]Hyung Sook Kim
, Chan-Ik Park, David O'Sullivan, Jeesun Lee:
Development of Educational Application Using Standard Movement Code-Based on Human Behavior. HCI (30) 2017: 141-145- [c17]Hyung Sook Kim, Chan-Ik Park, David O'Sullivan, Jeesun Lee:
Development of Content for an ICT Screening Program Based on the Emotional and Behavioral Disorder Questionnaire. HCI (30) 2017: 255-260 - 2013
- [c16]Kang-Il Park, Chan-Ik Park, Jangmyung Lee:
Vision Based People Tracking Using Stereo Camera and Camshift. ICIRA (1) 2013: 145-153
2000 – 2009
- 2007
- [c15]Dae Woong Kim, Woo-Ram Park, Chan-Ik Park:
Effect of unstable routing in location-aware mobile ad hoc networks on a geographic DHT protocol. ICPADS 2007: 1-8 - 2006
- [j8]Young Jin Nam, Chan-Ik Park:
Design and evaluation of an efficient proportional-share disk scheduling algorithm. Future Gener. Comput. Syst. 22(5): 601-610 (2006) - 2005
- [c14]Dae Woong Kim, Chan-Ik Park:
An Efficient Peer-to-Peer Lookup Protocol for Location-Aware Mobile Ad Hoc Networks. MobiQuitous 2005: 510-512 - 2004
- [c13]Kui-Yon Mun, Dae Woong Kim, Do-Hun Kim, Chan-Ik Park:
dDVS: An Efficient Dynamic Voltage Scaling Algorithm Based on the Differential of CPU Utilization. Asia-Pacific Computer Systems Architecture Conference 2004: 160-169 - [c12]Woon-Gwun Lee, Chan-Ik Park, Dae Woong Kim:
mNFS: Multicast-Based NFS Cluster. International Conference on Computational Science 2004: 363-370 - [c11]Dae Woong Kim, Soon-Ho Lee, Chan-Ik Park:
Balanced RM2: An Improved Data Placement Scheme for Tolerating Double Disk Failures in Disk Arrays. International Conference on Computational Science 2004: 371-378 - [c10]Tae-Young Choe, Chan-Ik Park:
A k-way Graph Partitioning Algorithm Based on Clustering by Eigenvector. International Conference on Computational Science 2004: 598-601 - 2002
- [j7]Chan-Ik Park, Tae-Young Choe:
An Optimal Scheduling Algorithm Based on Task Duplication. IEEE Trans. Computers 51(4): 444-448 (2002) - [c9]Young Jin Nam, Dae Woong Kim, Tae-Young Choe, Chan-Ik Park:
Enhancing Write I/O Performance of Disk Array RM2 Tolerating Double Disk Failures. ICPP 2002: 211-218 - [c8]Tae-Young Choe, Chan-Ik Park:
A Task Duplication Based Scheduling Algorithm with Optimality Condition in Heterogeneous Systems. ICPP Workshops 2002: 531-536 - 2001
- [j6]Hanwook Lee, Dae Woong Kim, Chan-Ik Park:
Phased RGSS: An improved disk array scheduling for continuous media retrieval. Inf. Process. Lett. 80(5): 225-231 (2001) - [j5]Sangyoon Lee, Chan-Ik Park, Chan-Mo Park:
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers. Parallel Process. Lett. 11(2/3): 341-352 (2001) - [c7]Chan-Ik Park, Tae-Young Choe:
An Optimal Scheduling Algorithm Based on Task Duplication. ICPADS 2001: 9-14 - [c6]Jae-Chang Namgoong, Chan-Ik Park:
Design and Implementation of a Fibre Channel Network Driver for SAN-Attached RAID Controllers. ICPADS 2001: 477-483
1990 – 1999
- 1997
- [c5]Sangyoon Lee, Chan-Ik Park, Chan-Mo Park:
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers. APDC 1997: 131-138 - 1996
- [j4]Chan-Ik Park, Kyung Sook Hwang:
Performance analysis of hybrid disk array architectures to meet I/O requirements. J. Syst. Archit. 42(1): 37-53 (1996) - [c4]Tae-Young Choe, Chan-Ik Park, Chan-Mo Park, Byung-Seop Kim:
An Improved Multi-Priority Preemptive Scheduler for Transputer-Based Real-Time Systems. RTS 1996: 181-186 - [c3]Sangyoon Lee, Chan-Ik Park, Chan-Mo Park:
An Efficient Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers. PDPTA 1996: 169-177 - [c2]Chan-Ik Park, Tae-Young Choe:
Striping in Disk Array RM2 Enabling the Tolerance of Double Disk Failures. SC 1996: 46 - 1995
- [j3]Chan-Ik Park:
Efficient Placement of Parity and Data to Tolerate Two Disk Failures in Disk Array Systems. IEEE Trans. Parallel Distributed Syst. 6(11): 1177-1184 (1995) - 1993
- [j2]Chan-Ik Park, Yun-Bo Park:
An efficient algorithm for VLSI network partitioning problem using a cost function with balancing factor. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(11): 1686-1694 (1993) - 1990
- [c1]Cheol-Hoon Lee, Myunghwan Kim, Chan-Ik Park:
An Efficient K-Way Graph Partioning Algorithm for Task Allocation in Parallel Computing Systems. ICSI 1990: 748-751
1980 – 1989
- 1988
- [j1]Chan-Ik Park, Kyu Ho Park, Myunghwan Kim:
Efficient Backward execution in and/or Process Model. Inf. Process. Lett. 29(4): 191-198 (1988)
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-04-24 23:11 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:
