{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:51Z","timestamp":1750306731044,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T00:00:00Z","timestamp":1413763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002994","name":"Ministry of Knowledge Economy","doi-asserted-by":"publisher","award":["NIPA-2013-H0301-13-1002"],"award-info":[{"award-number":["NIPA-2013-H0301-13-1002"]}],"id":[{"id":"10.13039\/501100002994","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2012-005945"],"award-info":[{"award-number":["2012-005945"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,10,20]]},"DOI":"10.1145\/2658260.2661765","type":"proceedings-article","created":{"date-parts":[[2014,10,21]],"date-time":"2014-10-21T12:59:05Z","timestamp":1413896345000},"page":"249-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On reducing false positives of a bloom filter in trie-based algorithms"],"prefix":"10.1145","author":[{"given":"Ju Hyoung","family":"Mun","sequence":"first","affiliation":[{"name":"Ewha Womans University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyesook","family":"Lim","sequence":"additional","affiliation":[{"name":"Ewha Womans University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.912716"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872576"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.193"},{"issue":"3","key":"e_1_3_2_1_4_1","first-page":"681","article-title":"Survey and proposal on binary search algorithms for longest prefix match","volume":"14","author":"Lim H.","year":"2012","unstructured":"H. Lim and N. Lee . Survey and proposal on binary search algorithms for longest prefix match . IEEE Communications Surverys and Tutorials , 14 ( 3 ): 681 -- 697 , Third Quarte 2012 . H. Lim and N. Lee. Survey and proposal on binary search algorithms for longest prefix match. IEEE Communications Surverys and Tutorials, 14(3):681--697, Third Quarte 2012.","journal-title":"IEEE Communications Surverys and Tutorials"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.1638626"},{"key":"e_1_3_2_1_6_1","unstructured":"http:\/\/www.potaroo.net.  http:\/\/www.potaroo.net."}],"event":{"name":"ANCS '14: Symposium on Architectures for Networking and Communications Systems","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS"],"location":"Los Angeles California USA","acronym":"ANCS '14"},"container-title":["Proceedings of the tenth ACM\/IEEE symposium on Architectures for networking and communications systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2658260.2661765","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2658260.2661765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:43Z","timestamp":1750231183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2658260.2661765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,20]]},"references-count":6,"alternative-id":["10.1145\/2658260.2661765","10.1145\/2658260"],"URL":"https:\/\/doi.org\/10.1145\/2658260.2661765","relation":{},"subject":[],"published":{"date-parts":[[2014,10,20]]},"assertion":[{"value":"2014-10-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}