![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Hyejeong Hong
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j12]Hyejeong Hong, Jaeil Lim, Hyunyul Lim, Sungho Kang:
Lifetime Reliability Enhancement of Microprocessors: Mitigating the Impact of Negative Bias Temperature Instability. ACM Comput. Surv. 48(1): 9:1-9:25 (2015) - 2014
- [j11]Hyejeong Hong, Jaeil Lim, Sungho Kang:
Recovery-enhancing task scheduling for multicore processors under NBTI impact. IEICE Electron. Express 11(11): 20140324 (2014) - 2013
- [j10]Hyejeong Hong, Jaeil Lim, Hyunyul Lim, Sungho Kang:
Thermal-aware dynamic voltage frequency scaling for many-core processors under process variations. IEICE Electron. Express 10(14): 20130463 (2013) - [j9]Hyejeong Hong, Jaeil Lim, Hyunyul Lim, Sungho Kang:
Dynamic thermal management for 3D multicore processors under process variations. IEICE Electron. Express 10(23): 20130800 (2013) - [j8]Hyejeong Hong, Sungho Kang:
Acceleration of Deep Packet Inspection Using a Multi-Byte Processing Prefilter. IEICE Trans. Commun. 96-B(2): 643-646 (2013) - 2012
- [j7]Hyuntae Park, Hyejeong Hong, Sungho Kang:
An efficient IP address lookup algorithm based on a small balanced tree using entry reduction. Comput. Networks 56(1): 231-243 (2012) - 2011
- [j6]Hyuntae Park, Hyejeong Hong, Sungho Kang:
An Efficient IP Address Lookup Scheme Using Balanced Binary Search with Minimal Entry and Optimal Prefix Vector. IEICE Trans. Commun. 94-B(11): 3128-3131 (2011) - 2010
- [j5]Hyunjin Kim, Hyejeong Hong, Dongmyoung Baek, Jin-Ho Ahn, Sungho Kang:
A memory-efficient heterogeneous parallel pattern matching scheme in deep packet inspection. IEICE Electron. Express 7(5): 377-382 (2010) - [j4]Hyunjin Kim, Hyejeong Hong, Dongmyong Baek, Sungho Kang:
A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection. IEICE Trans. Commun. 93-B(6): 1612-1614 (2010) - [j3]Seongyong Ahn, Hyejeong Hong, Hyunjin Kim, Jin-Ho Ahn, Dongmyong Baek, Sungho Kang:
A Hardware-Efficient Pattern Matching Architecture Using Process Element Tree for Deep Packet Inspection. IEICE Trans. Commun. 93-B(9): 2440-2442 (2010)
2000 – 2009
- 2009
- [j2]Hyunjin Kim, Hyejeong Hong, Hong-Sik Kim, Sungho Kang:
A memory-efficient parallel string matching for intrusion detection systems. IEEE Commun. Lett. 13(12): 1004-1006 (2009) - 2008
- [j1]Hyunjin Kim, Hyejeong Hong, Hong-Sik Kim, Jin-Ho Ahn, Sungho Kang:
Total Energy Minimization of Real-Time Tasks in an On-Chip Multiprocessor Using Dynamic Voltage Scaling Efficiency Metric. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(11): 2088-2092 (2008)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-24 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint