{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:18:33Z","timestamp":1775283513423,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1109\/ipdpsw.2010.5470886","type":"proceedings-article","created":{"date-parts":[[2010,5,28]],"date-time":"2010-05-28T18:25:42Z","timestamp":1275071142000},"page":"1-8","source":"Crossref","is-referenced-by-count":6,"title":["Efficient lists intersection by CPU-GPU cooperative computing"],"prefix":"10.1109","author":[{"family":"Di Wu","sequence":"first","affiliation":[]},{"family":"Fan Zhang","sequence":"additional","affiliation":[]},{"family":"Naiyong Ao","sequence":"additional","affiliation":[]},{"family":"Gang Wang","sequence":"additional","affiliation":[]},{"family":"Xiaoguang Liu","sequence":"additional","affiliation":[]},{"family":"Jing Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367732"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/SPIRE.2000.878197","article-title":"Parallel Search Using Partitioned Inverted Files","author":"macfarlane","year":"2000","journal-title":"Proceedings of the 7th International Conference on String Processing and Information Retrieval SPRIE 2000"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148232"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572104"},{"key":"ref14","year":"2009","journal-title":"NVIDIA CUDA Compute Unified Device Architecture Programming Guide"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2008.5214359"},{"key":"ref16","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.partic.2009.06.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/I-SPAN.2009.89"},{"key":"ref19","author":"steel","year":"1960","journal-title":"Principles and Procedures of Statistics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_13"},{"key":"ref3","first-page":"390","article-title":"Adaptive intersection and t-threshold problems","author":"barbay","year":"2002","journal-title":"SODA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289521"},{"key":"ref5","first-page":"743","article-title":"Adaptive set intersections, unions, and differences","author":"demaine","year":"2000","journal-title":"SODA"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92859-1_19"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0201004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/11575832_2"},{"key":"ref1","first-page":"400","article-title":"A Fast Set Intersection Algorithm for Sorted Sequences","author":"baeza-yates","year":"2004","journal-title":"Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching 2004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687722"}],"event":{"name":"Distributed Processing, Workshops and Phd Forum (IPDPSW 2010)","location":"Atlanta, GA","start":{"date-parts":[[2010,4,19]]},"end":{"date-parts":[[2010,4,23]]}},"container-title":["2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5465895\/5470678\/05470886.pdf?arnumber=5470886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T08:48:48Z","timestamp":1497862128000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5470886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/ipdpsw.2010.5470886","relation":{},"subject":[],"published":{"date-parts":[[2010,4]]}}}