default search action
Ju-Hyoung Mun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Tarikul Islam Papon, Ju Hyoung Mun, Konstantinos Karatsenidis, Shahin Roozkhosh, Denis Hoornaert, Ahmed Sanaullah, Ulrich Drepper, Renato Mancuso, Manos Athanassoulis:
Effortless Locality on Data Systems Using Relational Fabric. IEEE Trans. Knowl. Data Eng. 36(12): 7410-7422 (2024) - 2023
- [j5]Ju Hyoung Mun, Konstantinos Karatsenidis, Tarikul Islam Papon, Shahin Roozkhosh, Denis Hoornaert, Ulrich Drepper, Ahmed Sanaullah, Renato Mancuso, Manos Athanassoulis
:
On-the-fly Data Transformation in Action. Proc. VLDB Endow. 16(12): 3950-3953 (2023) - [c12]Renato Mancuso
Software-Shaped Platforms. CPS-IoT Week Workshops 2023: 185-191 - [c11]Shahin Roozkhosh, Denis Hoornaert, Ju Hyoung Mun, Tarikul Islam Papon, Ahmed Sanaullah, Ulrich Drepper, Renato Mancuso
Relational Memory: Native In-Memory Accesses on Rows and Columns. EDBT 2023: 66-79 - [c10]Tarikul Islam Papon, Ju Hyoung Mun, Shahin Roozkhosh, Denis Hoornaert, Ahmed Sanaullah, Ulrich Drepper, Renato Mancuso, Manos Athanassoulis
Relational Fabric: Transparent Data Transformation. ICDE 2023: 3688-3698 - 2022
- [c9]Ju Hyoung Mun, Zichen Zhu, Aneesh Raman, Manos Athanassoulis:
LSM-Trees Under (Memory) Pressure. ADMS@VLDB 2022: 23-35 - 2021
- [c8]Zichen Zhu, Ju Hyoung Mun, Aneesh Raman, Manos Athanassoulis
Reducing Bloom Filter CPU Overhead in LSM-Trees on Modern Storage Devices. DaMoN 2021: 1:1-1:10 - [i1]Shahin Roozkhosh, Denis Hoornaert, Ju Hyoung Mun, Tarikul Islam Papon, Ulrich Drepper, Renato Mancuso, Manos Athanassoulis:
Relational Memory: Native In-Memory Accesses on Rows and Columns. CoRR abs/2109.14349 (2021)
2010 – 2019
- 2019
- [c7]Ju Hyoung Mun, Hyesook Lim:
Cuckoo Bloom Filter. ICEIC 2019: 1-2 - 2017
- [j4]Jungwon Lee
Utilizing 2-D leaf-pushing for packet classification. Comput. Commun. 103: 116-129 (2017) - [j3]Ju Hyoung Mun, Hyesook Lim
Cache sharing using bloom filters in named data networking. J. Netw. Comput. Appl. 90: 74-82 (2017) - [c6]Ju Hyoung Mun, Jungwon Lee
A new Bloom filter structure for identifying true positiveness of a Bloom filter. HPSR 2017: 1-5 - 2016
- [j2]Ju Hyoung Mun, Hyesook Lim
New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms. IEEE Trans. Computers 65(5): 1558-1565 (2016) - [c5]Ju Hyoung Mun, Hyesook Lim:
Cache Sharing Using a Bloom Filter in Named Data Networking. ANCS 2016: 127-128 - 2014
- [c4]Ju Hyoung Mun, Hyesook Lim:
On reducing false positives of a bloom filter in trie-based algorithms. ANCS 2014: 249-250
2000 – 2009
- 2007
- [c3]Hyesook Lim, Ju Hyoung Mun:
High-speed packet classification using binary search on length. ANCS 2007: 137-144 - 2006
- [j1]Ju Hyoung Mun, Hyesook Lim
Binary search on prefix lengths for IP address lookup. IEEE Commun. Lett. 10(6): 492-494 (2006) - [c2]Hyesook Lim, Ju Hyoung Mun:
An Efficient IP Address Lookup Algorithm Using a Priority Trie. GLOBECOM 2006 - 2005
- [c1]Ju-Hyoung Mun, Sung Min Park, Myung-Ryong Nam:
Four-channel CMOS photoreceiver array for parallel optical interconnects. ISCAS (2) 2005: 1529-1532
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-12-01 00:11 CET 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: