{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:41:00Z","timestamp":1766486460559,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,22]]},"DOI":"10.1145\/3527974.3545728","type":"proceedings-article","created":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T22:06:51Z","timestamp":1663970811000},"page":"66-71","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast and efficient lookups via data-driven FIB designs"],"prefix":"10.1145","author":[{"given":"Sachin","family":"Ashok","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Aditi","family":"Partap","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Ammar","family":"Tahir","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]}],"member":"320","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Optimizing memory usage for hybridfib design (https:\/\/drive.google.com\/file\/d\/1O41f43pyhi2LH8g7Qdcep9ldWQbTVvJE\/view?usp=sharing)","author":"Ashok S.","year":"2022","unstructured":"S. Ashok , A. Partap , and A. Tahir . Optimizing memory usage for hybridfib design (https:\/\/drive.google.com\/file\/d\/1O41f43pyhi2LH8g7Qdcep9ldWQbTVvJE\/view?usp=sharing) , 2022 . S. Ashok, A. Partap, and A. Tahir. Optimizing memory usage for hybridfib design (https:\/\/drive.google.com\/file\/d\/1O41f43pyhi2LH8g7Qdcep9ldWQbTVvJE\/view?usp=sharing), 2022."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863979"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INCOS45849.2019.8951425"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2014.6900879"},{"issue":"3","key":"e_1_3_2_2_6_1","first-page":"681","article-title":"Survey and proposal on binary search algorithms for longest prefix match","volume":"14","author":"Lim H.","year":"2011","unstructured":"H. Lim and N. Lee . Survey and proposal on binary search algorithms for longest prefix match . IEEE Communications Surveys & Tutorials , 14 ( 3 ): 681 -- 697 , 2011 . H. Lim and N. Lee. Survey and proposal on binary search algorithms for longest prefix match. IEEE Communications Surveys & Tutorials, 14(3):681--697, 2011.","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"2","key":"e_1_3_2_2_7_1","first-page":"411","article-title":"On adding bloom filters to longest prefix matching algorithms","volume":"63","author":"Lim H.","year":"2012","unstructured":"H. Lim , K. Lim , N. Lee , and K.-H. Park . On adding bloom filters to longest prefix matching algorithms . IEEE Transactions on Computers , 63 ( 2 ): 411 -- 423 , 2012 . H. Lim, K. Lim, N. Lee, and K.-H. Park. On adding bloom filters to longest prefix matching algorithms. IEEE Transactions on Computers, 63(2):411--423, 2012.","journal-title":"IEEE Transactions on Computers"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/40.903060"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394198"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2016.070620"},{"key":"e_1_3_2_2_12_1","volume-title":"International Conference on Learning Representations","author":"Vaidya K.","year":"2021","unstructured":"K. Vaidya , E. Knorr , M. Mitzenmacher , and T. Kraska . Partitioned learned bloom filters . In International Conference on Learning Representations , 2021 . K. Vaidya, E. Knorr, M. Mitzenmacher, and T. Kraska. Partitioned learned bloom filters. In International Conference on Learning Representations, 2021."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364333"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2007.01.023"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658975"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535379"}],"event":{"name":"SIGCOMM '22: ACM SIGCOMM 2022 Conference","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Amsterdam Netherlands","acronym":"SIGCOMM '22"},"container-title":["Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3527974.3545728","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3527974.3545728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:03Z","timestamp":1750186803000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3527974.3545728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":16,"alternative-id":["10.1145\/3527974.3545728","10.1145\/3527974"],"URL":"https:\/\/doi.org\/10.1145\/3527974.3545728","relation":{},"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"2022-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}