International Journal Publications
38. J. Lee and H. Lim, “Longest-First Search Using Bloom Filter: Algorithm and FPGA Implementation,” IEEE Access, vol.13, pp.49354- 49361, Mar. 2025.
37. E. Choi, J. Lee, C. Yim, and H. Lim, “Decoding Errors in Difference-Invertible Bloom Filters: Analysis and Resolution," IEEE Access, vol.12, pp.40622-40633, Mar. 2024.
36. S. Lee, H. Byun, and H. Lim, “Set Reconciliation Using Ternary and Invertible Bloom Filters," IEEE Trans. on Knowledge and Data Engineering (IF 8.9, top 2.0%), vol.35, no.11, pp.11885-11898, Nov. 2023.
35. H. Byun and H. Lim, “Learned FBF: Learning-Based Functional Bloom Filter for Key-Value Storage," IEEE Trans. on Computers, vol.71, no.8, pp.1928-1938, Aug. 2022.
34. S. Jang, H. Byun, and H. Lim, “Dynamically Allocated Bloom Filter-Based PIT Architectures," IEEE Access, no. 10, pp. 28165-28179, Mar. 2022.
33. H. Byun, S. Kim, C. Yim, and H. Lim, “Addition of a Secondary Functional Bloom Filter," IEEE Communications Letters, vol.24, no.10, pp.2123-2127, Oct. 2020.
32. H. Byun and H. Lim, “Comparison on Search Failure between Hash Tables and a Functional Bloom Filter," Applied Sciences, vol.10, no.15, pp.5218-5235, Aug. 2020.
31. J. Lee, H. Byun, and H. Lim, “Dual-Load Bloom Filter: Application for Name Lookup," Computer Communications, vol. 151, pp.1-9, Feb. 2020.
30. H. Byun, Q. Li, and H. Lim, “Vectored-Bloom Filter for IP Address Lookup: Algorithm and Hardware Architectures," Applied Sciences, vol. 9, pp.4621-4640, Oct. 2019.
29. J. Mun and H. Lim, “On Sharing an FIB Table in Named Data Networking," Applied Sciences, vol. 9, no. 15, pp.3178-3195, Aug. 2019.
28. H. Byun and H. Lim, “A New Bloom Filter Architecture for FIB Lookup in Named Data Networking," Applied Sciences, vol. 9, no. 2, pp.329-345, Jan. 2019.
27. J. Seo and H. Lim, “Bitmap-based Priority-NPT for Packet Forwarding at Named Data Network," Computer Communications, vol.130. pp.101-112, Oct. 2018.
26. J. Mun and H. Lim, “Cache sharing using Bloom filters in named data networking," Journal of Network and Computer Applications (IF top 5.6%), Elsevier Science, vol. 90, pp. 74-82, May 2017.
25. J. Lee, H. Byun, J. Mun, and H. Lim, “Utilizing 2-D Leaf-Pushing for Packet Classification," Computer Communications, vol. 103, pp. 116-1129, May 2017.
24. H. Lim, J. Lee, H. Byun, and C. Yim, “Ternary Bloom Filter Replacing Counting Bloom Filter" IEEE Communications Letters, vol. 21, no.2, pp.278-281, Feb. 2017.
23. J. Mun and H. Lim, “New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms," IEEE Trans. on Computers, vol. 65, no.5, pp.1558-1565, May 2016.
22. J. Lee, M. Shim, and H. Lim, “Name Prefix Matching Using Bloom Filter Pre-Searching for Content Centric Network," Journal of Network and Computer Applications (IF top 5.6%), Elsevier Science, vol. 65, pp.36-47, 2016.
21. H. Lim, J. Lee, and C. Yim, “Complement Bloom Filter for Identifying True Positiveness of a Bloom Filter" IEEE Communications Letters, vol. 19, no. 11, pp. 1905-1908, Nov. 2015.
20. H. Lim, N. Lee, J. Lee, and C. Yim, “Reducing False Positives of a Bloom Filter Using Cross-Checking Bloom Filters," Applied Mathematics & Information Sciences, vol. 8. no. 4, pp.1865-1877, Jul. 2014.
19. H. Lim, Y. Choe, M. Shim, J. Lee, “A Quad-Trie Conditionally Merged with a Decision Tree for Packet Classification," IEEE Communications Letters, vol.18, no. 4, pp.676-679, Apr. 2014.
18. H. Lim, N. Lee, G. Jin, J. Lee, Y. Choi, and C. Yim, “Boundary Cutting for Packet Classification," IEEE/ACM Trans. on Networking, vol. 22, no. 2, pp.443-456, Apr. 2014.
17. H. Lim, K. Lim, N. Lee, and K. Park, “On Adding Bloom Filters to Longest Prefix Matching Algorithms," IEEE Trans. on Computers, vol. 63. no. 2, pp.411-423, Feb. 2014.
16. H. Lim, C. Yim, and Earl E. Swartzlander, Jr., “Priority Area-based Quad-Tree Packet Classification Algorithm and Its Mathematical Framework," Applied Mathematics & Information Sciences, vol. 7, no. 1, pp. 9-20, Jan. 2013.
15. H. Lim, S. Lee, and Earl E. Swartzlander, Jr., “A New Hierarchical Packet Classification Algorithm," Computer Networks, Elsevier Science, vol. 56, no. 13, pp. 3010-3022, Sep. 2012.
14. H. Lim and N. Lee, “Survey and Proposal on Binary Search Algorithms for Longest Prefix Match," IEEE Communications Surveys and Tutorials (IF 0.6%, 1/155), vol. 14, no. 3, Third Quarter, pp.681-697, Jul. 2012.
13. H. Lim and S. Kim, “Tuple Pruning Using Bloom Filters for Packet Classification," IEEE Micro, vol. 30, no. 3, May/June, pp.48-58, 2010.
12. H. Lim, C. Yim, and Earl E. Swartzlander, Jr., “Priority Tries for IP Address Lookup," IEEE Trans. on Computers, vol. 59, no. 6, pp. 784-794, Jun. 2010.
11. A.G. Alagu Priya and H. Lim, “Hierarchical Packet Classification Using a Bloom Filter and Rule-Priority Tries," Computer Communications, Elsevier Science, vol. 33, no. 10, pp. 1215-1226, Jun. 2010.
10. H. Lim, H. Kim, and C. Yim, “IP Address Lookup for Internet Routers Using Balanced Binary Search with Prefix Vector," IEEE Trans. on Communications, vol. 57, no. 3, pp. 618-621, Mar. 2009.
9. H. Lim, H. Chu, and C. Yim, “Hierarchical Binary Search Tree for Packet Classification," IEEE Communications Letters, vol. 11, no. 8, pp.689-691, Aug. 2007.
8. H. Lim, M. Kang, and C. Yim, “Two-dimensional Packet Classification Algorithm Using a Quad-Tree,” Computer Communications, Elsevier Science, vol. 30, no.6, pp. 1396 – 1405, Mar. 2007.
7. Hyesook Lim, Wonjung Kim, Bomi Lee, and Changhoon Yim, “High-speed IP address lookup using balanced multi-way trees,” Computer Communications, Elsevier Science, vol. 29, no.11, pp. 1927 – 1935, July 2006.
6. Ju Hyoung Mun, Hyesook Lim, and Changhoon Yim, "Binary Search on Prefix Lengths for IP Address Lookup," IEEE Communications Letters, vol.10, no. 6, pp.492-494, June 2006.
5. Changhoon Yim, Bomi Lee, and Hyesook Lim, " Efficient Binary Search for IP Address Lookup," IEEE Communications Letters, vol.9, no. 7, pp.652-654, Jul. 2005.
4. Hyesook Lim, Bomi Lee, and Wonjung Kim, " Binary Searches on Multiple Small Trees for IP Address Lookup, " IEEE Communications Letters, vol.9, no. 1, pp.75-77, Jan. 2005.
3. Hyesook Lim, Ji-Hyun Seo, and Yeo-Jin Jung, "High Speed IP Address Lookup Architecture Using Hashing," IEEE Communications Letters, vol.7, no.10, pp.502-504, Oct. 2003.
2. Hyesook Lim, Vincenzo Piuri, and Earl E. Swartzlander, Jr., "A Serial-Parallel Architecture for Two-Dimensional Discrete Cosine and Inverse Discrete Cosine Transforms," IEEE Transactions on Computers, vol.49, no.12, pp.1297-1309, Dec. 2000.
1. Hyesook Lim and Earl E.Swartzlander Jr., "Multidimensional Systolic Arrays for the Implementation of Discrete Fourier Transforms," IEEE Transactions on Signal Processing, vol.47, no.5, pp.1359-1370, May 1999.
Tutorials
Hyesook Lim, “Survey and Proposals on Packet Classification Algorithms,” IEEE HPSR2010, Dallas, TX, June 13, 2010 (half day).