default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeejin Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]Yoonsung Joh, Kangbae Lee, Hyunwoo Kim
, Heejin Park:
Progressive search in tandem mass spectrometry. BMC Bioinform. 24(1): 94 (2023)- [c26]Heejin Park, Felix Xiaozhu Lin:
Safe and Practical GPU Computation in TrustZone. EuroSys 2023: 505-520 - 2022
- [j21]Suji Yoon, Heejin Park, KyungWoon Cho, Hyokyung Bahn:
Supporting Swap in Real-Time Task Scheduling for Unified Power-Saving in CPU and Memory. IEEE Access 10: 3559-3570 (2022) - [j20]Sangjeong Lee, Heejin Park, Hyunwoo Kim:
False discovery rate estimation using candidate peptides for each spectrum. BMC Bioinform. 23(1): 454 (2022) - [c25]Heejin Park, Felix Xiaozhu Lin:
GPUReplay: a 50-KB GPU stack for client ML. ASPLOS 2022: 157-170 - [c24]Soeun Han, Yun-Yong Ko, Yushim Kim, Seong Soo Oh, Heejin Park, Sang-Wook Kim:
D-FEND: a diffusion-based fake news detection framework for news articles related to COVID-19. SAC 2022: 1771-1778 - [e1]Sang Won Bae, Heejin Park:
33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea. LIPIcs 248, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-258-7 [contents] - 2021
- [j19]Jeong Won Lee, Sung Hae Chang, Su Jin Jang, Heejin Park, Sang Mi Lee, Ki Jin Jung:
Clinical utility of quantitative analysis of bone scintigraphy in detecting clinically active joint and high disease activity in patients with rheumatoid arthritis. BMC Medical Imaging 21(1): 177 (2021) - [i5]Heejin Park, Felix Xiaozhu Lin:
TinyStack: A Minimal GPU Stack for Client ML. CoRR abs/2105.05085 (2021) - [i4]Heejin Park, Felix Xiaozhu Lin:
Safe and Practical GPU Acceleration in TrustZone. CoRR abs/2111.03065 (2021) - 2020
- [c23]Chris Alen Sula, Xiaoguang Wang, Heejin Park, Claudia Berger:
Digital Humanities among the iSchools: An Anlysis of DH Courses. DH 2020 - [c22]Hyungjun Oh, Bongki Cho, Changdae Kim, Heejin Park, Jiwon Seo:
AniFilter: parallel and failure-atomic cuckoo filter for non-volatile memories. EuroSys 2020: 21:1-21:15
2010 – 2019
- 2019
- [j18]Hyunwoo Kim, Sangjeong Lee, Heejin Park:
Target-small decoy search strategy for false discovery rate estimation. BMC Bioinform. 20(1): 438:1-438:6 (2019) - [c21]Heejin Park, Donghyeon Kim, Jeasoo Kim, Joo Young Hahn, Joung-Soo Park:
Underwater Communication with Spatio-Temporal Diversity in a Deep-Water Environment. ICUFN 2019: 45-48 - [c20]Donghyeon Kim, Heejin Park, Jeasoo Kim, Joo Young Hahn, Joung-Soo Park:
MIMO Communication Based on Adaptive Passive Time Reversal in Deep Water. ICUFN 2019: 49-51 - [c19]Heejin Park, Shuang Zhai, Long Lu, Felix Xiaozhu Lin:
StreamBox-TZ: Secure Stream Analytics at the Edge with TrustZone. USENIX ATC 2019: 537-554 - 2018
- [j17]Heejin Park, Pyung Kim, Heeyoul Kim, Ki-Woong Park, Younho Lee:
Efficient machine learning over encrypted data with non-interactive communication. Comput. Stand. Interfaces 58: 87-108 (2018) - [j16]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment with gaps. Theor. Comput. Sci. 710: 148-157 (2018) - [i3]Heejin Park, Shuang Zhai, Long Lu, Felix Xiaozhu Lin:
StreamBox-TZ: A Secure IoT Analytics Engine at the Edge. CoRR abs/1808.05078 (2018) - 2017
- [j15]Hosung Jo, Heejin Park:
Fast prime number generation algorithms on smart mobile devices. Clust. Comput. 20(3): 2167-2175 (2017) - [c18]Beomjun Kim, Yongsu Jeon, Heejin Park, Dongheon Han, Yunju Baek:
Design and Implementation of the Vehicular Camera System using Deep Neural Network Compression. EMDL@MobiSys 2017: 25-30 - [c17]Hongyu Miao, Heejin Park, Myeongjae Jeon, Gennady Pekhimenko, Kathryn S. McKinley, Felix Xiaozhu Lin:
StreamBox: Modern Stream Processing on a Multicore Machine. USENIX ATC 2017: 617-629 - 2016
- [j14]Joong Chae Na, Hyunjoon Kim, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment: A compressed index for similar strings. Theor. Comput. Sci. 638: 159-170 (2016) - [j13]Youngho Kim, Joong Chae Na, Heejin Park, Jeong Seop Sim:
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm. Theor. Comput. Sci. 656: 173-179 (2016) - [c16]Hosung Jo, Heejin Park:
Fast prime generation algorithms using proposed GCD test on mobile smart devices. BigComp 2016: 374-377 - [i2]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of Alignment with Gaps. CoRR abs/1606.03897 (2016) - 2015
- [j12]Hyunwoo Kim, Hosung Jo, Heejin Park, Eunok Paek:
HiXCorr: a portable high-speed XCorr engine for high-resolution tandem mass spectrometry. Bioinform. 31(24): 4026-4028 (2015) - [c15]Heejin Park, Jaeho Kim, Jongmoo Choi, Donghee Lee, Sam H. Noh:
Incremental redundancy to reduce data retention errors in flash-based SSDs. MSST 2015: 1-13 - 2014
- [c14]Hosung Jo, Heejin Park:
Performance analysis and improvement of JPV primality test for smart IC cards. BigComp 2014: 271-275 - 2013
- [j11]Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding consensus and optimal alignment of circular strings. Theor. Comput. Sci. 468: 92-101 (2013) - [c13]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. IWOCA 2013: 337-348 - [c12]Joong Chae Na, Heejin Park, Sunho Lee, Minsung Hong, Thierry Lecroq, Laurent Mouchard, Kunsoo Park:
Suffix Array of Alignment: A Practical Index for Similar Data. SPIRE 2013: 243-254 - [i1]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. CoRR abs/1305.1744 (2013) - 2011
- [j10]Heejin Park, Dong Kyue Kim:
Probabilistic Analysis on the Optimal Combination of Trial Division and Probabilistic Primality Tests for Safe Prime Generation. IEICE Trans. Inf. Syst. 94-D(6): 1210-1215 (2011) - [j9]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011) - 2010
- [c11]Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding Optimal Alignment and Consensus of Circular Strings. CPM 2010: 310-322 - [c10]Sangho Lee, Heejin Park, Jong Kim:
A secure and mutual-profitable DRM interoperability scheme. ISCC 2010: 75-80 - [c9]Heejin Park, Sang-Chul Lee, Soon-Haeng Lee, Sang-Wook Kim:
CentralMatch: A Fast and Accurate Method to Identify Blog-Duplicates. Web Intelligence 2010: 112-119
2000 – 2009
- 2009
- [j8]Kunsoo Park, Heejin Park, Woo-Chul Jeun, Soonhoi Ha:
Boolean circuit programming: A new paradigm to design parallel algorithms. J. Discrete Algorithms 7(2): 267-277 (2009) - [c8]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242 - 2008
- [j7]Dong Kyue Kim, Minhwan Kim, Heejin Park:
Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays. Algorithmica 52(3): 350-377 (2008) - [j6]Phillip G. Bradford, Sunju Park, Michael H. Rothkopf, Heejin Park:
Protocol completion incentive problems in cryptographic Vickrey auctions. Electron. Commer. Res. 8(1-2): 57-77 (2008) - 2007
- [j5]Seung-Hwan Lim, Heejin Park, Sang-Wook Kim:
Using multiple indexes for efficient subsequence matching in time-series databases. Inf. Sci. 177(24): 5691-5706 (2007) - 2006
- [j4]Sangtae Kim, Seungjin Na, Ji Woong Sim, Heejin Park, Jaeho Jeong, Hokeun Kim, Younghwan Seo, Jawon Seo, Kong-Joo Lee, Eunok Paek:
MODi : a powerful and convenient web server for identifying multiple post-translational peptide modifications from tandem mass spectra. Nucleic Acids Res. 34(Web-Server-Issue): 258-263 (2006) - [c7]Seung-Hwan Lim, Heejin Park, Sang-Wook Kim:
Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases. DASFAA 2006: 65-79 - 2005
- [j3]Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Constructing suffix arrays in linear time. J. Discrete Algorithms 3(2-4): 126-142 (2005) - [c6]Dong Kyue Kim, Heejin Park:
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space. CPM 2005: 33-44 - [c5]Heejin Park, Sang-Kil Park, Ki-Ryong Kwon, Dong Kyue Kim:
Probabilistic Analyses on Finding Optimal Combinations of Primality Tests in Real Applications. ISPEC 2005: 74-84 - 2004
- [j2]Heejin Park, Kunsoo Park, Yookun Cho:
Deleting keys of B-trees in parallel. J. Parallel Distributed Comput. 64(9): 1041-1050 (2004) - [c4]Dong Kyue Kim, Jeong Eun Jeon, Heejin Park:
An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size. SPIRE 2004: 138-149 - [c3]Dong Kyue Kim, Junha Jo, Heejin Park:
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. WEA 2004: 301-314 - 2003
- [c2]Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Linear-Time Construction of Suffix Arrays. CPM 2003: 186-199 - 2002
- [c1]Heejin Park, Kunsoo Park, Yookun Cho:
Deleting Keys of B-trees in Parallel. IPDPS 2002 - 2001
- [j1]Heejin Park, Kunsoo Park:
Parallel algorithms for red-black trees. Theor. Comput. Sci. 262(1): 415-435 (2001)
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-08-22 20:47 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:
