Author:
Ranjan Desh,Savage John,Zubair Mohammad
Publisher
Springer Berlin Heidelberg
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tightening I/O Lower Bounds through the Hourglass Dependency Pattern;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. Binom Katsayılı Geometrik Serilere Farklı Bir Bakış;Kırklareli Üniversitesi Mühendislik ve Fen Bilimleri Dergisi;2023-12-31
3. 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
4. A Lower Bound Technique for Communication in BSP;ACM Transactions on Parallel Computing;2018-04-27
5. On Characterizing the Data Access Complexity of Programs;ACM SIGPLAN Notices;2015-05-11