Heejin Park - Citegraph

Author Info

Name	Affiliation	Papers
HEEJIN PARK	Hanyang Univ, Fac Dept Comp Sci & Engn, Seoul 133791, South Korea	34
Collaborators	Citations	PageRank
70	235	21.63
Referers	Referees	References
434	706	423

Search Limit

100706

Publications (34 rows)

Collaborators (70 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
AniFilter: parallel and failure-atomic cuckoo filter for non-volatile memories	0	0.34	2020
Target-small decoy search strategy for false discovery rate estimation.	0	0.34	2019
FM-index of Alignment with Gaps.	1	0.36	2018
Efficient machine learning over encrypted data with non-interactive communication.	0	0.34	2018
Design and Implementation of the Vehicular Camera System using Deep Neural Network Compression	0	0.34	2017
Fast prime number generation algorithms on smart mobile devices.	1	0.34	2017
Streambox: Modern Stream Processing On A Multicore Machine	9	0.44	2017
Computational Study on the Thermal Effects of Implantable Magnetic Stimulation Based on Planar Coils	2	0.72	2016
FM-index of alignment: A compressed index for similar strings.	3	0.42	2016
Fast prime generation algorithms using proposed GCD test on mobile smart devices	0	0.34	2016
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm.	0	0.34	2016
HiXCorr: A Portable High-speed XCorr Engine for High-resolution Tandem Mass Spectrometry	2	0.70	2015
Incremental redundancy to reduce data retention errors in flash-based SSDs	10	0.49	2015
Performance analysis and improvement of JPV primality test for smart IC cards	1	0.43	2014
Suffix Tree of Alignment: An Efficient Index for Similar Data	3	0.39	2013
Finding consensus and optimal alignment of circular strings	5	0.46	2013
Suffix Array of Alignment: A Practical Index for Similar Data	7	0.44	2013
Probabilistic Analysis On The Optimal Combination Of Trial Division And Probabilistic Primality Tests For Safe Prime Generation	0	0.34	2011
Efficient algorithms for consensus string problems minimizing both distance sum and radius	4	0.42	2011
CentralMatch: A Fast and Accurate Method to Identify Blog-Duplicates	0	0.34	2010
A secure and mutual-profitable DRM interoperability scheme	5	0.49	2010
Boolean circuit programming: A new paradigm to design parallel algorithms	1	0.38	2009
Consensus Optimizing Both Distance Sum and Radius	6	0.44	2009
Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays	5	0.47	2008
Protocol completion incentive problems in cryptographic Vickrey auctions	8	0.73	2008
Modi : A Powerful And Convenient Web Server For Identifying Multiple Post-Translational Peptide Modifications From Tandem Mass Spectra	5	0.78	2006
A new compressed suffix tree supporting fast search and its construction algorithm using optimal working space	5	0.56	2005
Constructing suffix arrays in linear time	44	1.95	2005
Probabilistic analyses on finding optimal combinations of primality tests in real applications	1	0.36	2005
Deleting keys of B-trees in parallel	1	0.35	2004
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets	10	0.64	2004
An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size	7	0.48	2004
Linear-time construction of suffix arrays	79	5.04	2003
Parallel algorithms for red-black trees	10	0.63	2001