Author:
Bille Philip,Pagh Anna,Pagh Rasmus
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Comm. ACM 31(9), 1116–1127 (1988)
2. Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. Information and Computation 136, 25–51 (1997)
3. Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? In: Proceedings of the 27th annual ACM symposium on Theory of computing (STOC 1995), pp. 427–436 (1995)
4. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. System Sci. 68(4), 702–732 (2004)
5. Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 390–399 (2002)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Aggregated Boolean Query Processing for Document Retrieval in Edge Computing;Electronics;2022-06-19
2. A New Fast Intersection Algorithm for Sorted Lists on GPU;Journal of Information Technology Research;2022-04-29
3. Accelerating All-Edge Common Neighbor Counting on Three Processors;Proceedings of the 48th International Conference on Parallel Processing;2019-08-05
4. A RESTful Web Service for Non-overlapping Community Quality Assessment with MPI;Web Services – ICWS 2018;2018
5. Brief Announcement;Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures;2017-07-24