Author:
Arge Lars,Fischer Johannes,Sanders Peter,Sitchinava Nodari
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)
2. Arge, L.: The buffer tree: A technique for designing batched external data structures. Algorithmica 37(1), 1–24 (2003)
3. Arge, L., Goodrich, M.T., Nelson, M.J., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: SPAA, pp. 197–206 (2008)
4. Arge, L., Goodrich, M.T., Sitchinava, N.: Parallel external memory graph algorithms. In: IPDPS, pp. 1–11 (2010)
5. Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. In: SODA, pp. 685–694 (1998)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis;Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3;2024-04-27
2. Optimal Parallel Algorithms in the Binary-Forking Model;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
3. How to Answer a Small Batch of RMQs or LCA Queries in Practice;Lecture Notes in Computer Science;2018
4. Efficient dynamic range minimum query;Theoretical Computer Science;2016-12
5. LCP Array Construction Using O(sort(n)) (or Less) I/Os;String Processing and Information Retrieval;2016