Author:
Ranjan Desh,Savage John,Zubair Mohammad
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. IOOpt: automatic derivation of I/O complexity bounds for affine programs;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18
2. On the Hardness of Red-Blue Pebble Games;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
3. Automated derivation of parametric data movement lower bounds for affine programs;Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation;2020-06-06
4. Red-Blue Pebble Game;Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures;2018-07-11
5. The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation;Lecture Notes in Computer Science;2017