{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:22:21Z","timestamp":1751516541028,"version":"3.41.0"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319780238"},{"type":"electronic","value":"9783319780245"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78024-5_20","type":"book-chapter","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T12:28:25Z","timestamp":1521721705000},"page":"219-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Radix Tree for Binary Sequences on GPU"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4023-5344","authenticated-orcid":false,"given":"Krzysztof","family":"Kaczmarski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Wolant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/978-3-642-33615-7_27","volume-title":"On the Move to Meaningful Internet Systems: OTM 2012","author":"K Kaczmarski","year":"2012","unstructured":"Kaczmarski, K.: B+-tree optimized for GPGPU. In: Meersman, R., et al. (eds.) OTM 2012. LNCS, vol. 7566, pp. 843\u2013854. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33615-7_27"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Li, Y., Zhang, D., Liu, A.X., Zheng, J.: GAMT: a fast and scalable IP lookup engine for GPU-based software routers. In: ANCS, pp. 1\u201312. IEEE Computer Society (2013)","DOI":"10.1109\/ANCS.2013.6665171"},{"key":"20_CR3","first-page":"33","volume-title":"High Performance Graphics","author":"T Karras","year":"2012","unstructured":"Karras, T.: Maximizing parallelism in the construction of BVHs, octrees, and k-d trees. In: Dachsbacher, C., Munkberg, J., Pantaleoni, J. (eds.) High Performance Graphics, pp. 33\u201337. Eurographics Association, Aire-la-Ville (2012)"},{"issue":"2","key":"20_CR4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1109\/TC.2012.193","volume":"63","author":"H Lim","year":"2014","unstructured":"Lim, H., Lim, K., Lee, N., Park, K.-H.: On adding bloom filters to longest prefix matching algorithms. IEEE Trans. Comput. 63(2), 411\u2013423 (2014)","journal-title":"IEEE Trans. Comput."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Lee, J., Lim, H.: Binary search on trie levels with a bloom filter for longest prefix match. In: HPSR, pp. 38\u201343. IEEE (2014)","DOI":"10.1109\/HPSR.2014.6900879"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Mu, S., Zhang, X., Zhang, N., Lu, J., Deng, Y.S., Zhang, S.: IP routing processing with graphic processors. In: Micheli, G.D., Al-Hashimi, B.M., M\u00fcller, W., Macii, E. (eds.) DATE, pp. 93\u201398. IEEE (2010)","DOI":"10.1109\/DATE.2010.5457229"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Zheng, K., Liu, B.: V6Gene: a scalable IPv6 prefix generator for route lookup algorithm benchmark. In: AINA, vol. 1, pp. 147\u2013152. IEEE Computer Society (2006)","DOI":"10.1109\/AINA.2006.344"},{"issue":"4","key":"20_CR8","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1109\/TNET.2003.815288","volume":"11","author":"S Sahni","year":"2003","unstructured":"Sahni, S., Kim, K.S.: Efficient construction of multibit tries for IP lookup. IEEE\/ACM Trans. Netw. 11(4), 650\u2013662 (2003)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78024-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T22:47:30Z","timestamp":1751496450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78024-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319780238","9783319780245"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78024-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}