ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016


Article Details
Title: Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Article URLs:
Alternative Article URLs:
Authors: Timothy Carpenter
  • The Ohio State University, Dept. of Computer Science and Engineering
Fabrice Rastello
  • Univ. Grenoble Alpes, LIG, F-38000, Grenoble, France
  • CNRS, LIG, F-38000 Grenoble, France
P. Sadayappan
  • The Ohio State University, Dept. of Computer Science and Engineering
Anastasios Sidiropoulos
  • The Ohio State University, Dept. of Mathematics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1453472, 1423230
DBLP Key: conf/spaa/CarpenterRSS16
Author Comments:

Discuss this paper and its artifacts below