Author:
Leiserson Charles E.,Rao Satish,Toledo Sivan
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference12 articles.
1. The input/output complexity of sorting and related problems;Aggarwal;Comm. ACM,1988
2. B. Awerbuch, D. Peleg, Sparse partitions, 31st Symposium on Foundations of Computer Science, 1990
3. A Multigrid Tutorial;Briggs,1987
4. Introduction to Algorithms;Cormen,1990
5. J.-W. Hong, H. T. Kung, I/O complexity: The red–blue pebble game, Proceedings, 13th Annual ACM Symposium on Theory of Computing, 1981
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献