Author:
Bender Michael A.,Brodal Gerth Stølting,Fagerberg Rolf,Jacob Riko,Vicari Elias
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
2. DIMACS Series in Discrete Mathematics and Theoretical Computer Science;L. Arge,1999
3. Brodal, G.S., Fagerberg, R.: On the limits of cache-obliviousness. In: Proc. 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 307–315. ACM, San Diego (2003)
4. Lecture Notes in Computer Science;G.S. Brodal,2005
5. Cormen, T.H., Sundquist, T., Wisniewski, L.F.: Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. SIAM J. Comput. 28(1), 105–136 (1999)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献