On characterizing the data access complexity of programs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1345.68101
DOI: 10.1145/2676726.2677010
author: Venmugil Elango
author: Fabrice Rastello
author: Louis-Noël Pouchet
author: J. Ramanujam
author: P. Sadayappan
published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
publication date: 2016-09-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/1411.2286
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6631330
zbMATH Keywords: data access complexity
zbMATH Keywords: I/O lower bounds
zbMATH Keywords: red-blue pebble game
zbMATH Keywords: static analysis
MaRDI profile type: Publication
OpenAlex ID: W2070079053
arXiv ID: 1411.2286
title: On characterizing the data access complexity of programs
description: scientific article; zbMATH DE number 6631330