default search action
Hyesook Lim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Eunji Choi, Jungwon Lee, Changhoon Yim
, Hyesook Lim
Decoding Errors in Difference-Invertible Bloom Filters: Analysis and Resolution. IEEE Access 12: 40622-40633 (2024) - [c19]Jinsol Lee, Hyesook Lim:
Longest Prefix Matching Using Longest-First Search in a Leaf-Pushing Trie. ICEIC 2024: 1-4 - 2023
- [j30]Seungeun Lee, Hayoung Byun
Set Reconciliation Using Ternary and Invertible Bloom Filters. IEEE Trans. Knowl. Data Eng. 35(11): 11885-11898 (2023) - 2022
- [j29]Saeyoung Jang, Ha Young Byun
Dynamically Allocated Bloom Filter-Based PIT Architectures. IEEE Access 10: 28165-28179 (2022) - [j28]Hayoung Byun
Learned FBF: Learning-Based Functional Bloom Filter for Key-Value Storage. IEEE Trans. Computers 71(8): 1928-1938 (2022) - 2020
- [j27]Jungwon Lee
Dual-load Bloom filter: Application for name lookup. Comput. Commun. 151: 1-9 (2020) - [j26]Ha Young Byun
Addition of a Secondary Functional Bloom Filter. IEEE Commun. Lett. 24(10): 2123-2127 (2020)
2010 – 2019
- 2019
- [c18]Ha Young Byun, Qingling Li, Hyesook Lim:
Vectored-Bloom Filter Implemented on FPGA for IP Address Lookup. ICEIC 2019: 1-4 - [c17]Jungwon Lee
A circled Bloom filter for the membership identification of multiple sets. ICEIC 2019: 1-3 - [c16]Ju Hyoung Mun, Hyesook Lim:
Cuckoo Bloom Filter. ICEIC 2019: 1-2 - 2018
- [j25]Jihee Seo, Hyesook Lim
Bitmap-based priority-NPT for packet forwarding at named data network. Comput. Commun. 130: 101-112 (2018) - 2017
- [j24]Jungwon Lee
Utilizing 2-D leaf-pushing for packet classification. Comput. Commun. 103: 116-129 (2017) - [j23]Hyesook Lim
Ternary Bloom Filter Replacing Counting Bloom Filter. IEEE Commun. Lett. 21(1): 278-281 (2017) - [j22]Ju Hyoung Mun, Hyesook Lim
Cache sharing using bloom filters in named data networking. J. Netw. Comput. Appl. 90: 74-82 (2017) - [c15]Ju Hyoung Mun, Jungwon Lee
A new Bloom filter structure for identifying true positiveness of a Bloom filter. HPSR 2017: 1-5 - 2016
- [j21]Jungwon Lee
Name prefix matching using bloom filter pre-searching for content centric network. J. Netw. Comput. Appl. 65: 36-47 (2016) - [j20]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) - [c14]Ju Hyoung Mun, Hyesook Lim:
Cache Sharing Using a Bloom Filter in Named Data Networking. ANCS 2016: 127-128 - 2015
- [j19]Hyesook Lim
Complement Bloom Filter for Identifying True Positiveness of a Bloom Filter. IEEE Commun. Lett. 19(11): 1905-1908 (2015) - [c13]Hyesook Lim, Ha Young Byun:
Packet Classification Using a Bloom Filter in a Leaf-Pushing Area-based Quad-Trie. ANCS 2015: 183-184 - [c12]Hyesook Lim, Miran Shim, Jungwon Lee
Name Prefix Matching Using Bloom Filter Pre-Searching. ANCS 2015: 203-204 - 2014
- [j18]Hyesook Lim
A Quad-Trie Conditionally Merged with a Decision Tree for Packet Classification. IEEE Commun. Lett. 18(4): 676-679 (2014) - [j17]Hyesook Lim
On Adding Bloom Filters to Longest Prefix Matching Algorithms. IEEE Trans. Computers 63(2): 411-423 (2014) - [j16]Hyesook Lim
Boundary Cutting for Packet Classification. IEEE/ACM Trans. Netw. 22(2): 443-456 (2014) - [c11]Ju Hyoung Mun, Hyesook Lim:
On reducing false positives of a bloom filter in trie-based algorithms. ANCS 2014: 249-250 - [c10]Jungwon Lee
Binary search on trie levels with a bloom filter for longest prefix match. HPSR 2014: 38-43 - 2012
- [j15]Hyesook Lim
A new hierarchical packet classification algorithm. Comput. Networks 56(13): 3010-3022 (2012) - [j14]Hyesook Lim
Survey and Proposal on Binary Search Algorithms for Longest Prefix Match. IEEE Commun. Surv. Tutorials 14(3): 681-697 (2012) - 2010
- [j13]A. G. Alagu Priya, Hyesook Lim
Hierarchical packet classification using a Bloom filter and rule-priority tries. Comput. Commun. 33(10): 1215-1226 (2010) - [j12]Hyesook Lim
Tuple Pruning Using Bloom Filters for Packet Classification. IEEE Micro 30(3): 48-59 (2010) - [j11]Hyesook Lim
Priority Tries for IP Address Lookup. IEEE Trans. Computers 59(6): 784-794 (2010)
2000 – 2009
- 2009
- [j10]Hyesook Lim
IP address lookup for internet routers using balanced binary search with prefix vector. IEEE Trans. Commun. 57(3): 618-621 (2009) - [c9]Kyuhee Lim, Kyunghye Park, Hyesook Lim:
Binary search on levels using a Bloom filter for IPv6 address lookup. ANCS 2009: 185-186 - 2007
- [j9]Hyesook Lim
Two-dimensional packet classification algorithm using a quad-tree. Comput. Commun. 30(6): 1396-1405 (2007) - [j8]Hyesook Lim
Hierarchical Binary Search Tree for Packet Classification. IEEE Commun. Lett. 11(8): 689-691 (2007) - [c8]Hyesook Lim, Ju Hyoung Mun:
High-speed packet classification using binary search on length. ANCS 2007: 137-144 - [c7]Changhoon Yim
Hybrid error concealment method for H.264 video transmission over wireless networks. IWCMC 2007: 606-611 - 2006
- [j7]Hyesook Lim
High-speed IP address lookup using balanced multi-way trees. Comput. Commun. 29(11): 1927-1935 (2006) - [j6]Ju Hyoung Mun, Hyesook Lim
Binary search on prefix lengths for IP address lookup. IEEE Commun. Lett. 10(6): 492-494 (2006) - [c6]Hyesook Lim, Ju Hyoung Mun:
An Efficient IP Address Lookup Algorithm Using a Priority Trie. GLOBECOM 2006 - 2005
- [j5]Hyesook Lim, Bomi Lee, Wonjung Kim:
Binary searches on multiple small trees for IP address lookup. IEEE Commun. Lett. 9(1): 75-77 (2005) - [j4]Changhoon Yim, Bomi Lee, Hyesook Lim:
Efficient binary search for IP address lookup. IEEE Commun. Lett. 9(7): 652-654 (2005) - [c5]Changhoon Yim
Analysis and Performance Evaluation of Flexible Marcoblock Ordering for H.264 Video Transmission over Packet-Lossy Networks. PCM (1) 2005: 120-131 - 2003
- [j3]Hyesook Lim
High speed IP address lookup architecture using hashing. IEEE Commun. Lett. 7(10): 502-504 (2003) - 2000
- [j2]Hyesook Lim
A Serial-Parallel Architecture for Two-Dimensional Discrete Cosine and Inverse Discrete Cosine Transforms. IEEE Trans. Computers 49(12): 1297-1309 (2000)
1990 – 1999
- 1999
- [j1]Hyesook Lim
Multidimensional systolic arrays for the implementation of discrete Fourier transforms. IEEE Trans. Signal Process. 47(5): 1359-1370 (1999) - 1996
- [c4]Hyesook Lim, Changhoon Yim, Earl E. Swartzlander Jr.:
Finite Word-Length Effects Of An Unified Systolic Array For 2-D DCT/IDCT. ASAP 1996: 35- - [c3]Hyesook Lim, Earl E. Swartzlander Jr.:
Multidimensional systolic arrays for multidimensional DFTs. ICASSP 1996: 3276-3279 - 1995
- [c2]Hyesook Lim, Earl E. Swartzlander Jr.:
An efficient systolic array for the discrete cosine transform based on prime-factor decomposition . ICCD 1995: 644-649 - 1994
- [c1]Hyesook Lim, Earl E. Swartzlander Jr.:
A systolic array for 2-D DFT and 2-D DCT. ASAP 1994: 123-131
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-25 05:55 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: