Author:
Barbay Jérémy,López-Ortiz Alejandro,Lu Tyler
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Lecture Notes in Computer Science;R.A. Baeza-Yates,2004
2. Baeza-Yates, R.A., Salinger, A.: Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences. In: Proceedings of 12th International Conference on String Processing and Information Retrieval (SPIRE), pp. 13–24 (2005)
3. Barbay, J., Kenyon, C.: Adaptive Intersection and t-Threshold Problems. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 390–399 (2002)
4. Bentley, J.L., Yao, A.C.-C.: An almost optimal algorithm for unbounded searching. Information Processing Letters 5(3), 82–87 (1976)
5. Blandford, D.K., Blelloch, G.E.: Compact Representations of Ordered Sets. In: Daniel, K. (ed.) ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 11–19 (2004)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A New Fast Intersection Algorithm for Sorted Lists on GPU;Journal of Information Technology Research;2022-04-29
2. Parallelizing Pruning-based Graph Structural Clustering;Proceedings of the 47th International Conference on Parallel Processing;2018-08-13
3. SIMD-Based Multiple Sets Intersection with Dual-Scale Search Algorithm;Proceedings of the 2017 ACM on Conference on Information and Knowledge Management;2017-11-06
4. On Gapped Set Intersection Size Estimation;Proceedings of the 24th ACM International on Conference on Information and Knowledge Management;2015-10-17
5. Fast Set Intersection through Run-Time Bitmap Construction over PForDelta-Compressed Indexes;Lecture Notes in Computer Science;2014