The red-blue pebble game on trees and DAGs with large input

DOI10.1007/978-3-031-09993-9_8MaRDI QIDQ2097342OpenAlexFDO

Authors Niels Gleinig, T. Hoefler

Publication date 11 November 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09993-9_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites work

• scientific article; zbMATH DE number 1696521 (Why is no real title available?)
• scientific article; zbMATH DE number 1984680 (Why is no real title available?)
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• Communication-optimal parallel and sequential Cholesky decomposition
• Communication-optimal parallel and sequential QR and LU factorizations
• I/O-efficient undirected shortest paths
• Inapproximability of the standard pebble game and hard to pebble graphs
• Inapproximability of treewidth, one-shot pebbling, and related layout problems
• On the storage requirement in the out-of-core multifrontal method for sparse factorization
• The I/O complexity of computing prime tables
• Upper and lower I/O bounds for pebbling \(r\)-pyramids

This page was built for publication: The red-blue pebble game on trees and DAGs with large input

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097342)